|
|
Predictive Parsing with Deep Pushdowns
Viktorin, Jiří ; Blatný, Petr (referee) ; Meduna, Alexandr (advisor)
This paper introduces a generalization of classical pushdown automata-deep pushdown automata. Deep pushdown automata expand a pushdown symbol in a depth defined by a rule. Deep pushdown expands a non-terminal in the deep defined in the rule and this non-terminal need not be on the top of pushdown.
|
|
|
The Pushdown Automaton Simulator
Graizely, Martin ; Blatný, Petr (referee) ; Bidlo, Radek (advisor)
Visualization often helps with the understanding and allows for a quicker grasp of the problem. This work is aimed on implementation of pushdown automaton simulator. The purpose of the application is to ease understanding of such abstract machine and its abilities, by providing visual design and possibility of algorithm's interactive animation.
|
|
|
Conversions between CF Grammars and Pushdown Automata
Makovský, Benjamin ; Goldefus, Filip (referee) ; Masopust, Tomáš (advisor)
This work suggests and solves the implementation of the transformation of context-free grammars and the conversions between context-free grammars and pushdown automata. It makes acquainted with the models used in modern theory of formal languages. In the work are indicated all algorithms necessary for transformations and mutual conversions between context-free grammars and pushdown automata. Proposed is an object representing the grammar and the automaton in the programme. Described is the assigning of definitions of grammar and of the automaton, the solution of drawing the automaton on the screen and the creation of graphical user interface of the application. The resulting programme is developed as Jawa applet which is available on public internet pages www.convertcfg.php5.cz.
|
|
|
Semi-Parallel Deep Pushdown Automata
Ševčík, Miroslav ; Zámečníková, Eva (referee) ; Meduna, Alexandr (advisor)
This work introduces semi-parallel deep pushdown automata as an extension of sequential deep pushdown automata. Unlike the sequential automaton, a semi-parallel one is able to make expansions of n nonterminal symbols on the pushdown top simultaneously. These automata, same as sequential deep pushdown automata, define the family of languages generated by n-limited state grammars. The advantage of semi-parallel deep pushdown automata lies in higher speed. This work also describes the implementation of an aplication that simulates operation of these automata.
|
|
|
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
|
|
| |
|
|
Modified Pushdown Automata
Hromádka, David ; Solár, Peter (referee) ; Meduna, Alexandr (advisor)
This work introduces limited Hromádka's automata as an extension of classical pushdown automata. This extension means that the automaton is able to create new pushdowns, insert input symbols into them, join them and compare with the input string in run time. The number of such pushdowns is limited by choosen constant n . This work also describes the implementation of the application, that realizes the activity of this automata and is looking for the sequence of derivational steps, by which the automaton accepts the input string.
|
|
| |
|
|
The Pushdown Automaton Simulator
Graizely, Martin ; Blatný, Petr (referee) ; Bidlo, Radek (advisor)
Visualization often helps with the understanding and allows for a quicker grasp of the problem. This work is aimed on implementation of pushdown automaton simulator. The purpose of the application is to ease understanding of such abstract machine and its abilities, by providing visual design and possibility of algorithm's interactive animation.
|
|
|
Predictive Parsing with Deep Pushdowns
Viktorin, Jiří ; Blatný, Petr (referee) ; Meduna, Alexandr (advisor)
This paper introduces a generalization of classical pushdown automata-deep pushdown automata. Deep pushdown automata expand a pushdown symbol in a depth defined by a rule. Deep pushdown expands a non-terminal in the deep defined in the rule and this non-terminal need not be on the top of pushdown.
|
guest ::
