|
|
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.
|
|
|
Syntax-Direxted Translation Based on Deep Pushdown Automata
Solár, Peter ; Lukáš, Roman (referee) ; Meduna, Alexandr (advisor)
This thesis introduces syntax-directed translation based on deep pushdown automata. Necessary theoretical models are introduced in the theoretical part. The most important model, introduced in this thesis, is a deep pushdown transducer. The transducer should be used in syntax analysis, significant part of translation. Practical part consists of an implementation of simple-language interpret based on these models.
|
|
|
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.
|
|
|
Compiler of a Language with User-Defined Syntax for New Constructs
Kuklínek, Lukáš ; Křivka, Zbyněk (referee) ; Kolář, Dušan (advisor)
Tato práce si klade za cíl navrhnout a implementovat experimentální programovací jazyk s podporou uživatelsky definovaných syntaktických konstrukcí. Nový jazyk je kompilován do nativní binární podoby a vyžaduje statickou typovou disciplínu v době překladu. Jazyk se skládá ze dvou hlavních komponent. První z nich je minimalistické jádro založené na principech zásobníkově orientovaných jazyků. Druhou částí je mechanismus pro definici nových syntaktických konstrukcí uživatelem. Poté jsou shrnuty poznatky nabyté při návrhu a experimentování s prototypem překladače tohoto jazyka.
|
|
| |
|
|
Modified Parsing
Sopuch, Zbyněk ; Rychnovský, Lukáš (referee) ; Meduna, Alexandr (advisor)
This project deals with modification of syntax analysis. I realize three modifications of bottom up algorithm. First way is modification of Cocke-Younger-Kasami algorithm, second is based on EOL system and third is based on ETOL system.
|
|
|
Parsing Based on Multigeneration
Kyjovská, Linda ; Přikryl, Zdeněk (referee) ; Lukáš, Roman (advisor)
This work deals with syntax analysis problems based on multi-generation. The basic idea is to create computer program, which transforms one input string to n -1 output strings. An Input of this program is some plain text file created by user, which contains n grammar rules. Just one grammar from the input file is marked as an input grammar and others n -1 grammars are output grammars. This program creates list of used input grammar rules for an input string and uses corresponding output grammar rules for the creation of n -1 output strings. The program is written in C++ and Bison
|
|
|
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.
|
|
|
Advanced Error Recovery during Top-Down Parsing
Obluková, Alena ; Kolář, Dušan (referee) ; Meduna, Alexandr (advisor)
Parser is one of the most important parts in compiler since Syntax-Directed Translation is often used. This approach means that parser controls semantic actions and generation of syntax tree. When the input contains an error, parser cannot continue and the whole compiler has to stop. Therefore, it is important to have parser with error recovery, so when error occurs parser is able to continue. There are several error-recovery strategies and methods. In this paper is described Acceptable-sets derived from continuations specifically continuation in LL parsers. However it is not so well known method it is easy to explain and to implement. It can be used in the lesson to demonstrate error recovery in top-down parser.
|
|
|
Combined Parsing Based on Grammar Systems
Caha, Petr ; Solár, Peter (referee) ; Meduna, Alexandr (advisor)
This thesis deals with a combined parsing based on grammar systems. Introduces modified method of classical grammar systems. At first they will be theoretically described and in the next part they will be implemented for parsing. The basis for the parser is a cooperating distributed grammar system. Implementation uses recursive method and case analysis. The parser is universal, applicable to any grammar systems based on context-free and some not context-free.
|
guest ::
