National Repository of Grey Literature 17 records found  previous11 - 17  jump to record: Search took 0.04 seconds. 
Parsing Based on State Grammars
Paulík, Miroslav ; Solár, Peter (referee) ; Meduna, Alexandr (advisor)
This work describes the characteristics of state grammars and n-limited state grammars with a focus on non-determinism in a parsing proccess based on such grammars. In particular, it focuses on the problems caused by enabling erasing productions or by possible occur of recursion. This work also describes possible solutions to non-deterministic problems, which are used in the design of a parallel parsing method. This method is significantly faster than sequence analysis based on backtracking.
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.
Deep Pushdown Automata of Finite Index
Poncová, Vendula ; Horáček, Petr (referee) ; Meduna, Alexandr (advisor)
This thesis introduces several modifications of deep pushdown automata considering the reduced number of states or non-input symbols. It is shown that the power of deep pushdown automata of finite index is not affected by a limitation of non-input symbols to one, thus these automata characterize an infinite hierarchy of language families resulting from programmed grammars of finite index. Based on a principle of these automata, it is established the normal form of deep pushdown automata. Finally, I introduce generalized deep pushdown automata. They expand the topmost possible non-input symbol in the pushdown. These automata and their reduced forms are equivalent to state grammars.
Parsing Based on Modified Pushdown Automata
Pluháček, David ; Lukáš, Roman (referee) ; Meduna, Alexandr (advisor)
The thesis introduces new models for formal languages, the m-limited state   grammar and the deep pushdown automaton. Their basic definitions are presented,   so is their mutual equivalence and the characteristics of the language family they describe.   Following, a parsing method based on these models is presented. The method is an extension   of a similar method used for context-free languages, the table driven parsing.   The final part of the thesis describes the implementation of a parser based on the method.
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.
Application of Deep Pushdown Automata in Compilers
Viktorin, Jiří ; Lukáš, Roman (referee) ; Meduna, Alexandr (advisor)
In this thesis, I focus on the application of deep pushdown automatons in compilers, their composition in the parser, and the possibility of further recovery. Thanks to these automatons can carry out the expansion of the nonterminals in various depths and thus makes it possible to use other records of expressions.
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.

National Repository of Grey Literature : 17 records found   previous11 - 17  jump to record:
Interested in being notified about new results for this query?
Subscribe to the RSS feed.