|
|
Path-Controlled Grammars
Adamec, Ondřej ; Soukup, Ondřej (referee) ; Křivka, Zbyněk (advisor)
This thesis deals with path-controlled grammars, which are grammars that place restrictions on the paths in a derivation tree of a context-free grammar. The goal of this thesis is to create an algorithm for conversion between the path-controlled grammars and the state grammars, which is a di erent type of regulated grammars. Another goal is to study the generative power of path-controlled grammars based on the conversion algorithm. The conversion algorithm is implemented and tested on a number of path-controlled grammars. Also, its complexity is discussed. Finally, a parsing tool for path-controlled grammars is implemented. Complexity of this tool is analyzed as well.
|
|
|
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.
|
|
|
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.
|
|
|
Path-Controlled Grammars
Adamec, Ondřej ; Soukup, Ondřej (referee) ; Křivka, Zbyněk (advisor)
This thesis deals with path-controlled grammars, which are grammars that place restrictions on the paths in a derivation tree of a context-free grammar. The goal of this thesis is to create an algorithm for conversion between the path-controlled grammars and the state grammars, which is a di erent type of regulated grammars. Another goal is to study the generative power of path-controlled grammars based on the conversion algorithm. The conversion algorithm is implemented and tested on a number of path-controlled grammars. Also, its complexity is discussed. Finally, a parsing tool for path-controlled grammars is implemented. Complexity of this tool is analyzed as well.
|
guest ::
