|
|
Syntactic Analysis Based on Matrix Grammar
Brindza, Dominik ; Horáček, Petr (referee) ; Zámečníková, Eva (advisor)
The subject of this thesis is to develop a method of syntactic analysis based on matrix grammar s. In its theoretical part we provide various analytical aspects for this type of regulated grammar in order to reveal the common background as well as search for similarities with the classical context-free grammars which we will then be able to benefit from in the practical part. Our goal is to extend the well-known predictive method of syntactic analysis to further accept a wider spectrum of formal languages - some of the context-sensitive ones which we are able to generate using our matrix grammars. Besides this main effort we also present some experimental algorithms and suggestions hich could be used in further research of this project.
|
|
|
Parsing Based on Programmed Grammars
Pačes, Jan ; Solár, Peter (referee) ; Meduna, Alexandr (advisor)
This thesis is researching methods of parsing based on programmed grammars. It modifies known algorithm of table driven non-recursive predictive parser for context-free grammars and applies it on programmed grammars. It studies strength of this method, focusing on some languages which are not context-free.
|
|
|
Transformation of Grammars into Normal Forms
Klapuchová, Mirka ; Koutný, Jiří (referee) ; Zemek, Petr (advisor)
This thesis deals with issues of normal forms from theory of formal languages. Basic terms from this area are listed here, different types of grammars as well and especially normal forms and algorithms that transfer grammars into normal forms. Description of design and implementation of program which is used to transfer input grammar into entered normal form is included.
|
|
|
Parsing Based on Deep Pushdown Automata
Senko, Jozef ; Vrábel, Lukáš (referee) ; Solár, Peter (advisor)
This thesis is concerning with syntax analysis based on deep pushdown automata. In theoretical part are defined themselves deep pushdown automata, all the necessary theoretical concepts and then is discussed the implementation of these deep pushdown automata embedded in the educational program for students.
|
|
|
Parsing Based on State Grammars
Svatý, Lukáš ; Vrábel, Lukáš (referee) ; Solár, Peter (advisor)
Syntax-directed translation based on state grammars is introduced in this bachelor's thesis. Theoretical section of this thesis is focused on the introduction of theoretical models that are necessary for understanding syntax analysis based on state grammars. The most important theoretical formal models in this thesis include deep pushdown transducer and translation grammar based on state grammar, which can be used in syntax analysis. Practical section of this thesis is focused on bottom-up syntax analysis using state grammar and its implementation.
|
|
|
Parsing Based on Random Context Grammars
Mikita, Martin ; Solár, Peter (referee) ; Vrábel, Lukáš (advisor)
This thesis describes a random context grammar and the implementation of an application which will convert this grammar (respecting the LL condition) to an equivalent context-free grammar (also satisfying the LL condition). The resulting grammar can be used in the existing parser generator that accepts a yacc-compatible format. This thesis uses the GNU Bison generator, for which the encapsulated script was introduced. The potential advantage of random context grammar consists in the proven efficient description compared to context-free grammar for some languages.
|
|
|
General System for Testing of Interprets
Drahošová, Michaela ; Koutný, Jiří (referee) ; Lukáš, Roman (advisor)
This work deals with concept and implementation of General system for testing of interprets. Testing of interprets is based on the principle of comparation of results of the interpretation carried out by the testing with reference results. The set of testing programmes is acquired by translating testing programmes, in the reference language to programmes in the language of tested interpret. The testing system enables generation of a testing set of programmes for an interpret according input and reference result after a preceding analysis of a file consisting of description of the syntax and semantics of the interpret's language. These actions result is translation of a more complex programming language to another.
|
|
|
Demonstration of Tree Controlled Grammars Properties
Kunštátský, Martin ; Čermák, Martin (referee) ; Koutný, Jiří (advisor)
Tree controlled grammars are grammars regulated by restriction placed on its derivation trees. It is simple and natural extension of context-free grammars. There are several types of derivation tree control, two principles are mentioned in this work: horizontal and vertical control. Application demonstrating tree controlled grammars properties, implemented in Python programming language, is also part of this work.
|
|
|
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.
|
|
|
On Erasing Rules in Regulated Grammars
Zemek, Petr ; Koutný, Jiří (referee) ; Meduna, Alexandr (advisor)
This work discusses the effect of erasing rules to the generative power of regulated grammars, which is a big open problem in the theory of regulated rewriting. It studies the possibility of removal of erasing rules from regulated grammars by aggregation of current, up-to-date results concerning this elimination and by presentation of a new condition, called k-limited erasing, under which all erasing rules can be always removed from regularly controlled context-free grammars without affecting their generative power. This result partially solves the abovementioned problem. Moreover, a new algorithm for elimination of erasing rules from context-free grammars is presented. This algorithm does not require any predetermination of so called epsilon-nonterminals (in contrast to the standard algorithm used in textbooks). In the conclusion, a significance of these results concerning syntactical analysis is discussed.
|
guest ::
