|
|
Parsing Based on Several Grammars
Koumar, Ondřej ; Havel, Martin (referee) ; Meduna, Alexandr (advisor)
This thesis focuses on research of CD grammar systems and their utilization in syntax analysis. The objective is to design a parser that combines both top-down and bottom-up techniques for a CD grammar system that describes a language generated by an LL grammar, using a deterministic pushdown automaton. The goals are achieved by introducing a modified LL table with ordered pairs that reference rules within individual components. This concept is demonstrated on a new programming language called Koubp, for which a parser is implemented in C++.
|
|
|
Grammar Systems and Their Applications
Kříčka, Dalibor ; Klembara, Radovan (referee) ; Meduna, Alexandr (advisor)
This thesis aims to introduce a new type of cooperating distributed (CD) grammar system based on already existing types, then define a specific grammar system of the new type and apply it within a parser. The newly introduced type combines features of the hybrid CD grammar system and CD grammar system with internal control and emphasizes the determinism of cooperation protocol. The explicitly defined grammar system applies three methods of syntactic analysis (LL predictive, precedence and SLR) and accepts a subset of C++ language. The practical aspect of this thesis demonstrates the applicability of the mentioned grammar system by console application, which implements the forepart of a compiler based on this system.
|
|
|
Syntaktická analýza založená na spolupracujících gramatikách
Nehéz, Patrik ; Havel, Martin (referee) ; Meduna, Alexandr (advisor)
This thesis deals with the issue of grammatical systems and syntax analysis. Thesis presents cooperatively distributed and parallel communicating grammatical systems. Thesis describes my design of grammar system and which works on the basics of CD grammar systems and than it shows my implementation. The result of this thesis is application that uses bigger number of components that works together and it combines both methods of syntax analysis.
|
|
|
Automata Systems
Petřík, Patrik ; Lukáš, Roman (referee) ; Meduna, Alexandr (advisor)
This work deals with automata systems. We define parallel automata systems and parallel communicating automata systems communicating by transitions, whose components are finite state automata. We investigate their properties compared with grammar systems or grammars.
|
|
|
A Combination of Automata and Grammars
Kučera, Jiří ; Horáček, Petr (referee) ; Meduna, Alexandr (advisor)
V této práci byly zavedeny a studovány nové systémy formálních modelů, zvané stavově synchronizované automatové systémy stupně n . Výpočet je v těchto prezentovaných systémech řízen pomocí slov patřících do konečného řídícího jazyka, kde každé slovo z tohoto jazyka je složeno ze stavů komponent systému. Dále byla v této práci studována výpočetní síla zavedených systémů. Praktické použití zavedených systémů bylo demonstrováno na příkladu z oblasti překladu přirozených jazyků a dále na příkladu z oblasti paralelního překladu.
|
|
|
Transducer Systems and Their Applications
Boros, Adrián ; Dvořák, Tomáš (referee) ; Meduna, Alexandr (advisor)
This thesis introduces a new variant of translation devices. We propose a new formal model based on the interconnection of several cooperating pushdown transducers. This new model is called transducer system. The principle of operation of these systems is similar to the cooperating distributed (CD) grammar systems, enabling a cooperation of several grammar over a common sentential form. Furthermore, the thesis deals with the computational power of this formal model. The main result is an application that converts arithmetic expressions from infix to postfix notation.
|
|
|
Parsing Based on Multigeneration
Kleiner, Miloš ; Čermák, Martin (referee) ; Meduna, Alexandr (advisor)
Multygeneratic system is based on cooperation action of infinity count of context-free grammars. All this context free-grammars parallel and synchronous derivate individual sentential form. During generation came in each specific derivation step to checking of correction of each generated sentential forms. This checking can be made by different ways. Solution is then so-called multistring (vector of strings), so by the help of this is defined generated language.
|
|
|
Parser Systems
Kunda, Matej ; Tomko, Martin (referee) ; Meduna, Alexandr (advisor)
The goal of this thesis is to make a formal model of a new grammar system, which can combine different methods of syntax analysis. The inspiration for the making of the new grammar system were cooperating distributed grammar systems, from which an idea of communication symbols came from. With the help of communication symbols, components of the grammar system can cooperate on creating one sentential form. The thesis describes the formalization of the grammar system, its application in syntax analysis and finally its implementation. The result of this thesis is an application, which works on the principle of the formalized grammar system and combines two methods of syntax analysis.
|
|
|
Formal Systems Based on Automata and Grammars
Čermák, Martin ; Rybička, Jiří (referee) ; Šaloun, Petr (referee) ; Meduna, Alexandr (advisor)
Tyto teze navazují na studium gramatických a automatových systémů. Na začátku, práce pojednává o regulárně řízených CD gramatických systémech využívající frázově strukturované gramatiky jako komponenty. Do systémů jsou zavedena tři nová omezení na derivacích a je studován jejich vliv na vyjadřovací sílu těchto systémů. Poté, tato práce definuje dva automatové protějšky ke kanonickým multi-generatiním nonterminálem a pravi\-dlově synchronizovyným gramatickým systemům, generujících vektory řetězců, a ukazuje, že všechny tyto vyšetřované systemy si jsou vzájemně ekvivalentní. Dále táto práce tyto systémy zobecňuje a zakládá fundamentalní hierarchii n-jazyků (množin n-tic řetězců). V~souvislosti se zavedenými systémy tyto teze zavádí automatově-gramatický převodník založený na konečném automatu a bezkontextové gramatice. Tento převodník je pak studovaný a použitý jako nástroj přímého překladu. V~poslední části jsou v této práci zavedené automatové systémy jádrem pársovací metody založené na stromově řízených gramatikách s n omezenými cestami.
|
|
|
Systems that Combine Automata and Grammars
Petřík, Patrik ; Křivka, Zbyněk (referee) ; Meduna, Alexandr (advisor)
This work deals with Systems that combine automata and grammars. We investigate their properties compared with grammar systems and automaton systems. Work is focused on systems, which components are finite state automata, right linear grammars, pushdown automata or context free grammars. We also investigate usage of these systems in compilers.
|
guest ::
