|
|
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.
|
|
|
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
|
|
|
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.
|
|
|
Regulated Syntax-Directed Translation
Dvořák, Tomáš ; Kocman, Radim (referee) ; Meduna, Alexandr (advisor)
This thesis deals with formal and syntax directed translation. This thesis contains theoretical part, which defines regular, context free, context sensitive and recursively enumerable languages a grammar. There are given examples of grammars which are able to generate languages that are not context free. Covered by this thesis are matrix grammars, random context grammars and programed grammars. Researched are also finite, pushdown, deep and regular automata, transducers and their part within format syntax directed translation. This project also defines regular transducers based as regulated automata. Thesis defines regulated methods of syntax analysis based on predictive parsers. These methods cover analysis of studied regulated grammars. The final part of this thesis describes new language capable of effective description of these grammars and compiler producing parser code for these grammars written in this new language and their graphical analyzer.
|
|
|
Transformation of Equation Editor Expressions to LaTeX
Šimek, Jiří ; Jirák, Ota (referee) ; Křivka, Zbyněk (advisor)
The bachelor thesis deals with the problem of transformation of Equation editor expressions to LaTeX. It presents description of Equation editor expressions in Word 2007, it subsequently focuses on the syntax of particular expressions and it suggests the ways of their transformation into LaTeX. The grammar, which was used for the implementation of the converter, is designed on the basis of the syntax of expressions.
|
|
|
Static Analysis of CodAL Language Source Code
Fajčík, Martin ; Přikryl, Zdeněk (referee) ; Hynek, Jiří (advisor)
The goal of bachelor's thesis is to design and implement extensions devoted to source code static analysis and automatic corrections used in CodAL language editors. This form of analysis is convenient e.g. for the source code semantic checks. The thesis consists of theoretical and practical part. Role of the theoretical part is to overview with extension development related to Eclipse platform, especially with the CodAL language editor, CodAL language itself and to define problems of this language which are suitable to be solved on the static analysis level. Practical part includes specific implementation details of the particular static analysis elements and automatic corrections. These extended CodAL language editors are available in integrated development environment Codasip Studio based first and foremost on the Eclipse platform and project CDT. Codasip Studio has been developed by company Codasip Ltd. in collaboration with Lissom research team.
|
|
| |
|
|
Jumping Language Models
Ošmera, Lubomír ; Kocman, Radim (referee) ; Meduna, Alexandr (advisor)
The main goal of this master thesis is introduction and investigation of extended version of jumping automata and grammars. New versions are primarily focused on bioinformatic applications - DNA computing. This thesis examine their power and other properties of new models and makes comparison with existing computer science models. Then thesis demontrates practical applications, specifically amino acid and protein detections inside DNA sequence and makes comparision with existing tools in DNA computing for example Mark´s probabilistic models.
|
|
|
Procedural Track Generator
Ončo, Michael ; Lysek, Tomáš (referee) ; Milet, Tomáš (advisor)
This bachelor's thesis deals with procedural generation of an obstacle course for a game in which the player has to overcome these obstacles. It researches suitable ways of generating such course. Within the scope of this research the thesis studies basic traits of noises and grammars. Furthermore it mainly focuses on grammars, L-systems and their attributes. Output of this bachelor's thesis is an application generating the obstacle course, visualizing its geometry using OpenGL and enabling movement through it.
|
guest ::
