|
|
Canonical Derivations in Programmed Grammars
Zemek, Petr ; Masopust, Tomáš (referee) ; Meduna, Alexandr (advisor)
This work studies canonical derivations (with focus on leftmost derivations) in programmed grammars and left restriction range. It is shown that if we introduce n-limited derivations in programmed grammars as they were defined for state grammars, we get an infinite hierarchy of language families resulting from n-limited programmed grammars, so the left restriction range affects the generative power of n-limited programmed grammars. This result is significant for syntactical analysis based on programmed grammars.
|
|
|
Reformation, Counterreformation and Development of After the Reformation Catholicism in Uherský Brod - the Christian Faith in Changing Times
Zemek, Petr ; Rejchrtová, Noemi (advisor) ; Válka, Josef (referee) ; Pojsl, Miloslav (referee)
The study presents an attempt to depict the character of changes in life, thought and feelings of inhabitants of the town of Uherský Brod as Christians throughout 16th - 17th centuries. Its aim is to deepen the understanding of the internal and external factors forming the specific local religiosity in the context of the enormous transformation of the Church at the end of the Middle-Ages and the Early Modern Period. Rather a small social segment has been selected in order to allow carrying out a study on individuals and their behaviour. In Uherský Brod, several substantial changes in confession conditions have taken place in the course of history. In terms of later development, the most important one was the restoration fo Catholicism after the Battle of White Mountain, which permanently affected the religious conditions of the town and the entire region. Based od the source material preserved, the author attempts to get an insight into the people who were actively or passively participating in these processes in order to contribute to a better understanding of the cultural development in the Early Modern Period, with special focus on this region. Powered by TCPDF (www.tcpdf.org)
|
|
|
Graphical User Interface of Retargetable Decompiler
Jánský, Jiří ; Zemek, Petr (referee) ; Matula, Peter (advisor)
P { margin-bottom: 0.21cm; direction: ltr; color: rgb(0, 0, 0); line-height: 150%; widows: 2; orphans: 2; }P.western { font-family: "Times New Roman",serif; font-size: 11pt; }P.cjk { font-family: "Times New Roman",serif; font-size: 11pt; }P.ctl { font-family: "Times New Roman",serif; font-size: 12pt; } The thesis deals with creating a graphic interface for disassembler of project Lissom, which is controlled from command line. The dissasembler produces a translated code and graphs of functions calling and flow control. The mentioned outputs of the disassembler shows, functionally connects and adds to each representations of outputs useful features.
|
|
|
Reformation, Counterreformation and Development of After the Reformation Catholicism in Uherský Brod - the Christian Faith in Changing Times
Zemek, Petr ; Rejchrtová, Noemi (advisor) ; Válka, Josef (referee) ; Pojsl, Miloslav (referee)
The study presents an attempt to depict the character of changes in life, thought and feelings of inhabitants of the town of Uherský Brod as Christians throughout 16th - 17th centuries. Its aim is to deepen the understanding of the internal and external factors forming the specific local religiosity in the context of the enormous transformation of the Church at the end of the Middle-Ages and the Early Modern Period. Rather a small social segment has been selected in order to allow carrying out a study on individuals and their behaviour. In Uherský Brod, several substantial changes in confession conditions have taken place in the course of history. In terms of later development, the most important one was the restoration fo Catholicism after the Battle of White Mountain, which permanently affected the religious conditions of the town and the entire region. Based od the source material preserved, the author attempts to get an insight into the people who were actively or passively participating in these processes in order to contribute to a better understanding of the cultural development in the Early Modern Period, with special focus on this region. Powered by TCPDF (www.tcpdf.org)
|
|
|
One-Sided Random Context Grammars
Zemek, Petr ; Černá, Ivana (referee) ; Doc. In.g Petr Sosík, Dr. (referee) ; Meduna, Alexandr (advisor)
Tato disertační práce zavádí jednostranné gramatiky s nahodilým kontextem jako řízené gramatiky založené na bezkontextových gramatikách. V těchto gramatikách je ke každému pravidlu přiřazena množina povolujících symbolů a množina zakazujících symbolů a množina pravidel je rozdělena na množinu levých pravidel s nahodilým kontextem a množinu pravých pravidel s nahodilým kontextem . Levým pravidlem s nahodilým kontextem lze přepsat neterminál pokud se všechny povolující symboly vyskytují vlevo od přepisovaného neterminálu a žádný zakazující symbol tam přítomen není. Pravé pravidlo s nahodilým kontextem lze aplikovat analogicky, ale ona kontrola na přítomnost a nepřítomnost symbolů je provedena doprava od přepisovaného neterminálu. Práce je rozdělena na tři části. První část uvádí motivaci za zavedením jednostranných gramatik s nahodilým kontextem a umisťuje materiál pokrytý v této práci do vědeckého kontextu. Poté dává přehled základů teorie formálních jazyků a některých méně známých oblastí, jejichž znalost je nutná pro pochopení studovaného tématu. Druhá část tvoří jádro práce. Formálně definuje jednostranné gramatiky s nahodilým kontextem a studuje je z mnoha pohledů. Mezi studovaná témata patří generativní síla, vztah k jiným typům gramatik, redukce, normální formy, nejlevější derivace, zobecněné a LL verze těchto gramatiky. Třetí část této práce zakončuje diskusi několika poznámkami. Mezi ně patří poznámky týkající se aplikovatelnosti zavedených gramatik v praxi, bibliografie a otevřených problémů.
|
|
|
Decompilation of Selected C++ Constructions
Mihulka, Tomáš ; Zemek, Petr (referee) ; Matula, Peter (advisor)
This bachelor's thesis deals with the reconstruction of a hierarchy of classes and their virtual methods from programmes created by C++ language . The aim of this work is to extend a decompiler , which has been developed as a part of the Lissom project, by an analysis of those reconstructions for various decompilers . The reconstructions are created through detection of RTTI and virtual tables . The first part of this thesis involves a description of reverse engineering as well as of the Lissom project in terms of the decompiler . The following section of the paper explains the basics of C++ language , its structures and different possibilities of their decompilation . The final part of the paper deals with a design, implementation and testing of a recognition of RTTI and virtual tables .
|
|
|
Linux Software Protection Against Reverse Engineering
Korec, Tomáš ; Zemek, Petr (referee) ; Hruška, Tomáš (advisor)
This thesis deals with an implementation of Linux software protection against reverse engineering within the Lissom project. Protection consists of three layers. The first layer is represented by methods detecting tools, that enable the application of reverse engineering methods. Protection based on hashing the functions represents the second layer which protects the application against changes. The third layer of protection is a binary parts file encryption. These methods complete an existing license server of the Lissom project. Possible future extensions are discussed at the end of the thesis.
|
|
|
Automata with a Limited Number of Pure Pushdowns
Soukup, Ondřej ; Zemek, Petr (referee) ; Meduna, Alexandr (advisor)
Pushdown automata with limited number of pure pushdowns are specialization of pure pushdown automata. Examination of their power is mainly focused on the view of combinatorics of words. In language defined by automata we introduce term of dependence, which denotes relation between parts of strings in language. It is shown, how the defined automata proceed on processing of dependencies. Then the relation between distribution of dependencies in language and required number of pushdowns is derived. Also is defined the infinite hierarchy of languages corresponding to automata in dependence on number of their pushdowns. At the end belonging of the class of languages defined by pushdown automata with limited number of pure pushdowns to Chomsky hierarchy of languages is studied, but it is discovered, that they do not correspond to Chomsky hierarchy. Based on this result it is proposed to study possible changes of models as a future development. Then the simulating program is created to illustrate features of examined automata.
|
|
|
Canonical Derivations in Programmed Grammars
Zemek, Petr ; Masopust, Tomáš (referee) ; Meduna, Alexandr (advisor)
This work studies canonical derivations (with focus on leftmost derivations) in programmed grammars and left restriction range. It is shown that if we introduce n-limited derivations in programmed grammars as they were defined for state grammars, we get an infinite hierarchy of language families resulting from n-limited programmed grammars, so the left restriction range affects the generative power of n-limited programmed grammars. This result is significant for syntactical analysis based on programmed grammars.
|
|
|
C Back-End for a Decompiler
Urban, Martin ; Ďurfina, Lukáš (referee) ; Zemek, Petr (advisor)
This thesis deals with the implementation of the back-end of the decompiler, which produces a code in C language. It contains basic information about the principals and using of the reverse engineering either in the area of information technology or apart from it. The main goal is to create the back-end of the decompiler which would generate a code that would be equivalent against the input and will be translatable into a binary code. Functionality of the output code will be conserved in state of the functionality of the source code. The output is the implementation of the classes in C++ language. It does described activity as a part of the general decompiler which is developed in terms of the project Lissom.
|
guest ::
