|
|
Parsing Based on Matrix Grammars
Bednář, Petr ; Solár, Peter (referee) ; Meduna, Alexandr (advisor)
This thesis is researching parsing based on matrix grammars. Introduces automata controled parsing method. It discusses problems of deterministic parsing of matrix grammars. Thesis is focusing on deterministic parsing of non-deterministic languages. It studies strength of this deterministic method.
|
|
|
A General Generator of Syntax Directed Translation
Marcin, Juraj ; Kučera, Jiří (referee) ; Meduna, Alexandr (advisor)
This thesis is dedicated to the design and creation of generic generator that performs syntax directed translation according to user requirements. The translation is processing in the time of analysis of the source program. Parser is based on bottom-up parsing. The result of the translation is the creation of syntax tree. From this syntax tree are created instructions in the form of three - address code. These instructions represent final program and they are essential in rendering of syntax tree.
|
|
|
Parsing Based on Several Methods
Dolíhal, Luděk ; Goldefus, Filip (referee) ; Meduna, Alexandr (advisor)
p, li { white-space: pre-wrap; } The main goal of this work is to analyze the creation of the composite compiler. Composite compiler is in this case a szstem, which consists of more cooperating parts. My compiler is special, because its syntactic analyser consists of two parts. The work is focused on the construction of the parsers parts, on its cooperation and comunication. I will trys to scatch the teoretical backgroun of this solution. This is to be done by gramatical systems. Then I~will try to justify whether or not it is neccesary and suitable to create such a kind of parser. Last but not least I~will analyse the language, whose syntactic analyser is to be implemented by the chosen method.
|
|
|
Parsing of Regulated Grammars
Šrajer, Roman ; Čermák, Martin (referee) ; Křivka, Zbyněk (advisor)
This thesis studies regulated grammars, their fundamentals and expressing power regarding Chomsky hierarchy of languages. Programmed grammars are investigated in more depth considering a few types of leftmost derivations. A variant of deterministic syntax analysis of programmed grammars is introduced. This analysis works similarly as LL(k) parsing. Transformations of matrix grammars into programmed grammars without changing their expressing power are introduced. The syntax analysis by regularly controlled grammars partly using programmed grammars are presented. In the end, cooperating distributed grammars with left permitting grammars as components are mentioned. Their deterministic syntax analysis uses predictive table or exhaustive exploration of the whole state space.
|
|
|
Deep Syntax-Directed Translation
Senko, Jozef ; Kučera, Jiří (referee) ; Meduna, Alexandr (advisor)
This thesis is a continuation of my bachelor thesis, which is dedicated to syntax analysis based on deep pushdown automata. In theorical part of this thesis is defined everything fundamental for this work, for example deep syntax-directed translation, pushdown automata, deep pushdown automata, finite transducer and deep pushdown transducer. The second part of this thesis is dedicated to the educational program for students of IFJ. In this part is defined strucure of this program and its parts. All part of program are analyzed from a theoretical and practical point of view.
|
|
|
Using structural method for objects recognition
Valsa, Vít ; Heriban, Pavel (referee) ; Šťastný, Jiří (advisor)
This diploma thesis deals with posibilities of using structural methods for recognition objects in a picture. The first part of this thesis describes methods for preparing the picture before processing. The core of the whole thesis is in chapter 3, where is analyzed in details the problem of the formation of deformation grammars for parsing and their using. In the next part is space for syntactic parser describing the deformation grammar. The conclusion is focused on testing the suggested methods and their results.
|
|
|
Grammar Systems and Parsing Based on Them
Handlíř, Jaroslav ; Zámečníková, Eva (referee) ; Meduna, Alexandr (advisor)
This work is devoted to grammar systems. Defines cooperating distributed grammar systems CD and parallel communicating grammar systems PC in conjunction with context-free grammars. It also examines their principles and generative forces in different regime and to different languages. Studying the use of grammatical parsing systems. It focuses primarily on top-down parsing and precedential bottom-up analysis in conjunction with the PC grammar systems.
|
|
|
Combined Parsing Based on Several Methods
Dolíhal, Luděk ; Masopust, Tomáš (referee) ; Meduna, Alexandr (advisor)
The main goal of this work is to analyze the creation of the composite parser. Composite syntactic parser is in this case a parser, which consists of more cooperating parts. In my case two parts. The work is focused on the construction of the parsers parts, on its cooperation and comunication. Then I will try to justify whether or not it is neccesary and suitable to create such a kind of parser. Last but not least I will analyse the language, whose syntactic analyser is to be implemented by the chosen method.
|
|
|
Translation Grammars: Properties and Applications
Vít, Radek ; Krčmář, Radim (referee) ; Meduna, Alexandr (advisor)
The goal of this thesis is to discuss translation grammars and their use in syntax-driven translation. It provides an example of the use of translation grammars in predictive top-down translation and provides formal devices for language accepting and translation output generation. It examines the descriptional complexity of tranlation grammars as language generating devices. An implementation of a translation framework using these devices is described and a simple compiler is designed and implemented using this framework. This compiler translates a new language REON designed in this paper to Python 3.
|
|
|
Modification of a Syntax Analysis
Macek, Roman ; Jirák, Ota (referee) ; Dolíhal, Luděk (advisor)
Bachelor's thesis deals with modification of syntax analysis, specifically method called recursive descent. The main goal of this work is to increase the power of this method. The improvement is designed in order the method is able to analyse ambiguous grammars. In the project, there is also designed a language and its grammar. On the basis of the grammar, implementation of the demonstration application is done. Application does lexical and syntax analysis of the given source code and the output are several lists of rules which can be used to parse the input.
|
guest ::
