|
|
Parser and Validator of Data Models in YANG Language
Vican, Pavol ; Kekely, Lukáš (referee) ; Kořenek, Jan (advisor)
Computer network administrators need tools for configuration and monitoring of network devices. Therefore, NETCONF protocol was designed for remote devices configuration and YANG modelling language which describes the structure of the configuration data. The aim of this thesis is to extend the libyang library with syntax parser, that processes models written in YANG and stores them into internal structures. This parser is generated by bison and flex tools.
|
|
| |
|
|
Conversion of Models of Regular Languages
Navrkal, David ; Kučera, Jiří (referee) ; Křivka, Zbyněk (advisor)
p { margin-bottom: 0.08in; direction: ltr; color: rgb(0, 0, 0); line-height: 150%; widows: 2; orphans: 2; }p.western { font-family: "Times New Roman",serif; font-size: 11pt; }p.cjk { font-family: "Times New Roman",serif; font-size: 11pt; }p.ctl { font-family: "Times New Roman",serif; font-size: 12pt; } My thesis deals with how to didactically demonstrate models of regular languages focusing on their mutual conversions. These conversions are transformation of regular expressions to finite automata (FA), remove epsilon rules from FA and determinization FA. The goal was implement demonstration of these transformations in an application. In this thesis I document development of this application. This application was programmed in language C++ using graphic library Qt 5. The application was developed in an operating system (OS) Linux and tested in OS Microsoft Windows 7. All these conversions are implemented. The application is user-friendly, intuitive and functional. The application was not tested on a wider sample of students. As the main benefit, the application can help students of formal languages and finite automata better understand this theory using didactical examples. Source codes of this project (regularConvertor) are available online on Github server.
|
|
|
Parsing Based on Matrix Grammars
Bednář, Petr ; Solár, Peter (referee) ; Meduna, Alexandr (advisor)
This thesis is researching parsing based on matrix grammars. Introduces automata controled parsing method. It discusses problems of deterministic parsing of matrix grammars. Thesis is focusing on deterministic parsing of non-deterministic languages. It studies strength of this deterministic method.
|
|
|
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.
|
|
|
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.
|
|
|
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 of Regulated Grammars
Šrajer, Roman ; Čermák, Martin (referee) ; Křivka, Zbyněk (advisor)
This thesis studies regulated grammars, their fundamentals and expressing power regarding Chomsky hierarchy of languages. Programmed grammars are investigated in more depth considering a few types of leftmost derivations. A variant of deterministic syntax analysis of programmed grammars is introduced. This analysis works similarly as LL(k) parsing. Transformations of matrix grammars into programmed grammars without changing their expressing power are introduced. The syntax analysis by regularly controlled grammars partly using programmed grammars are presented. In the end, cooperating distributed grammars with left permitting grammars as components are mentioned. Their deterministic syntax analysis uses predictive table or exhaustive exploration of the whole state space.
|
|
|
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.
|
|
|
Parsing Based on Several Methods
Dolíhal, Luděk ; Goldefus, Filip (referee) ; Meduna, Alexandr (advisor)
p, li { white-space: pre-wrap; } The main goal of this work is to analyze the creation of the composite compiler. Composite compiler is in this case a szstem, which consists of more cooperating parts. My compiler is special, because its syntactic analyser consists of two parts. The work is focused on the construction of the parsers parts, on its cooperation and comunication. I will trys to scatch the teoretical backgroun of this solution. This is to be done by gramatical systems. 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.
|
guest ::
