|
|
Combined Parsing Based on Several Methods
Dolíhal, Luděk ; Masopust, Tomáš (referee) ; Meduna, Alexandr (advisor)
The main goal of this work is to analyze the creation of the composite parser. Composite syntactic parser is in this case a parser, which consists of more cooperating parts. In my case two parts. The work is focused on the construction of the parsers parts, on its cooperation and comunication. Then I will try to justify whether or not it is neccesary and suitable to create such a kind of parser. Last but not least I will analyse the language, whose syntactic analyser is to be implemented by the chosen method.
|
|
|
Translation Grammars: Properties and Applications
Vít, Radek ; Krčmář, Radim (referee) ; Meduna, Alexandr (advisor)
The goal of this thesis is to discuss translation grammars and their use in syntax-driven translation. It provides an example of the use of translation grammars in predictive top-down translation and provides formal devices for language accepting and translation output generation. It examines the descriptional complexity of tranlation grammars as language generating devices. An implementation of a translation framework using these devices is described and a simple compiler is designed and implemented using this framework. This compiler translates a new language REON designed in this paper to Python 3.
|
|
|
Modification of a Syntax Analysis
Macek, Roman ; Jirák, Ota (referee) ; Dolíhal, Luděk (advisor)
Bachelor's thesis deals with modification of syntax analysis, specifically method called recursive descent. The main goal of this work is to increase the power of this method. The improvement is designed in order the method is able to analyse ambiguous grammars. In the project, there is also designed a language and its grammar. On the basis of the grammar, implementation of the demonstration application is done. Application does lexical and syntax analysis of the given source code and the output are several lists of rules which can be used to parse the input.
|
|
|
Blender Add-on for Generation of 3D Mathematical Equations
Strenková, Katarína ; Milet, Tomáš (referee) ; Chlubna, Tomáš (advisor)
This bachelor's thesis aims to create a Blender add-on, which makes the creation of 3D mathematical equations easier for users. Unlike alternative solutions, equations consist of individual editable text objects. The input data are entered in the mathematical notation of the Latex language. They are later analyzed using lexical and syntax analysis. When no faults are found, the specified mathematical equation is generated in a 3D environment. The final add-on is functional with the support of main Latex commands and is intended for public use.
|
|
|
Translation Among Higher Programming Languages
Knapovský, Jan ; Kožár, Tomáš (referee) ; Meduna, Alexandr (advisor)
With the development of new technologies, programming languages and their devices the need arises for existing codebases to be updated and upgraded to use such devices and technologies, to preserve the maintainability and sustainability of such systems. This thesis proposes the use of automatised means to aid such efforts – a transpiler.
|
|
| |
|
|
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.
|
|
|
Parsing Based on Grammar Systems
Sedmík, Adam ; Klobučníková, Dominika (referee) ; Meduna, Alexandr (advisor)
This thesis is focused on grammar systems and syntax analysis. Thesis introduces cooperating distributed and parallel communicating grammar systems. Based on knowledge of grammar systems, new grammar system is introduced. This grammar system focuses on modularization of syntax analysis. Shown are two methods of syntax analysis, recursive descent parsing and precedence parsing. Grammar systems introduced are demonstrated on syntax analysis of custom programming language.
|
|
|
Grammar Systems Applied to Compilation
Reš, Jakub ; Klobučníková, Dominika (referee) ; Meduna, Alexandr (advisor)
The main goal of this work is to design a method of constructing a compiler based on grammar systems that allows it's user to by able to combine any existing construction methods. Solution of this problem lies in utilization of cooperating distributed grammar systems. The principle of dividing compiler into sequentially cooperating components was used by this thesis. So we have a construction of smaller, narrowly specified units that are able to pass control to each other and together analyze complex languages. Each of these components is using one of the existing methods of analysis and any way of it's implementation. Benefit of this thesis is the design of construction method using principle of grammar systems, that allows us to use combination of any existing methods and brings overall higher generative power, and showing a possible way of using this method.
|
|
|
Parsing for ET0L Systems
Kožár, Tomáš ; Klobučníková, Dominika (referee) ; Meduna, Alexandr (advisor)
This thesis focuses on deciding the membership of strings in languages generated by ET0L systems. It is achieved by designing two algorithms. The first one is a modification of the existing algorithm Cocke-Younger-Kasami for syntax analysis of context-free grammars in Chomsky normal form. This modification takes into account different properties of ET0L systems compared to context-free grammars. Specifically, the parallel application of production rules and multiple tables of these production rules. Also, used normal form is different from Chomsky normal form since CNF is unfit for ET0L systems. The second designed algorithm works in a top-down manner and gradually generates all valid strings. The resulting algorithms are tested, demonstrated, and fully functional. The contributions of this thesis are two new algorithms for syntax analysis of ET0L systems.
|
guest ::
