|
|
Parsing Based on Random Context Grammars
Mikita, Martin ; Solár, Peter (referee) ; Vrábel, Lukáš (advisor)
This thesis describes a random context grammar and the implementation of an application which will convert this grammar (respecting the LL condition) to an equivalent context-free grammar (also satisfying the LL condition). The resulting grammar can be used in the existing parser generator that accepts a yacc-compatible format. This thesis uses the GNU Bison generator, for which the encapsulated script was introduced. The potential advantage of random context grammar consists in the proven efficient description compared to context-free grammar for some languages.
|
|
|
C Language Interactive Interpreter
Blažek, Martin ; Peringer, Petr (referee) ; Martinek, David (advisor)
This master's thesis deals with implementation of ISO C99 language interpreter. The goal of this thesis is to provide support of education in C language programming and fast algorithm prototyping. It enables students to create own C programs and to experiment with language constructions without compiling. User interface includes editor and simple debugger. The interpreter is implemented in a novel grammar development environment written in Java language - ANTLRWorks which includes ANTLR language tool.
|
|
|
Advanced Parser Generators
Havranek, Daniel ; Kövári, Adam (referee) ; Křivka, Zbyněk (advisor)
This bachelor thesis deals with parser generation by tools that use advanced parsing techniques. These techniques are compared from both theoretical and practical point of view. The GNU Bison tool, which uses the LALR(1) method and Generalized LR method, and the ANTLR tool, which uses the more modern ALL(*) method, are examined in detail. To compare the effectiveness of these tools, a parser for a fictional programming language is implemented using them to demonstrate the strengths and weaknesses of each approach. As the results, GNU Bison is much more powerful, but the ANTLR outweighs it in terms of implementation friendliness and functionality. The results of this thesis can help deciding which approach or tool to choose when implementing a parser.
|
|
|
Advanced Parser Generators
Havranek, Daniel ; Kövári, Adam (referee) ; Křivka, Zbyněk (advisor)
This bachelor thesis deals with parser generation by tools that use advanced parsing techniques. These techniques are compared from both theoretical and practical point of view. The GNU Bison tool, which uses the LALR(1) method and Generalized LR method, and the ANTLR tool, which uses the more modern ALL(*) method, are examined in detail. To compare the effectiveness of these tools, a parser for a fictional programming language is implemented using them to demonstrate the strengths and weaknesses of each approach. As the results, GNU Bison is much more powerful, but the ANTLR outweighs it in terms of implementation friendliness and functionality. The results of this thesis can help deciding which approach or tool to choose when implementing a parser.
|
|
|
Kind parser generator
Dzurenko, Tomáš ; Žemlička, Michal (advisor) ; Bednárek, David (referee)
Title: Kind parser generator Author: Bc. Tomáš Dzurenko Department: Network and Labs Management Center Supervisor: RNDr. Michal Žemlička, Ph.D., Department of Software and Com- puter Science Education Abstract: This thesis introduces a generator which takes as its input a definition k-kind grammar and creates source code of analyzer or translator for the language generated by this kind grammar. Opposed to traditional LL(k) grammars, k-kind grammars allow usage of direct left recursion in its rules. This allows for more comfortable and clearer formulation of input grammar rules. Keywords: parser, translator, generator, C++, kind grammar
|
|
|
Kind parser generator
Dzurenko, Tomáš ; Žemlička, Michal (advisor) ; Bednárek, David (referee)
Title: Kind parser generator Author: Bc. Tomáš Dzurenko Department: Network and Labs Management Center Supervisor: RNDr. Michal Žemlička, Ph.D., Department of Software and Com- puter Science Education Abstract: This thesis introduces a generator which takes as its input a definition k-kind grammar and creates source code of analyzer or translator for the language generated by this kind grammar. Opposed to traditional LL(k) grammars, k-kind grammars allow usage of direct left recursion in its rules. This allows for more comfortable and clearer formulation of input grammar rules. Keywords: parser, translator, generator, C++, kind grammar
|
|
|
Parsing Based on Random Context Grammars
Mikita, Martin ; Solár, Peter (referee) ; Vrábel, Lukáš (advisor)
This thesis describes a random context grammar and the implementation of an application which will convert this grammar (respecting the LL condition) to an equivalent context-free grammar (also satisfying the LL condition). The resulting grammar can be used in the existing parser generator that accepts a yacc-compatible format. This thesis uses the GNU Bison generator, for which the encapsulated script was introduced. The potential advantage of random context grammar consists in the proven efficient description compared to context-free grammar for some languages.
|
|
|
C Language Interactive Interpreter
Blažek, Martin ; Peringer, Petr (referee) ; Martinek, David (advisor)
This master's thesis deals with implementation of ISO C99 language interpreter. The goal of this thesis is to provide support of education in C language programming and fast algorithm prototyping. It enables students to create own C programs and to experiment with language constructions without compiling. User interface includes editor and simple debugger. The interpreter is implemented in a novel grammar development environment written in Java language - ANTLRWorks which includes ANTLR language tool.
|
guest ::
