National Repository of Grey Literature 2 records found  Search took 0.01 seconds. 
Grammar Systems and Parsing Based on Them
Hrstka, Jan ; Martiško, Jakub (referee) ; Meduna, Alexandr (advisor)
This thesis provides a summary of knowledge of grammar systems. It focuses primarily on sequentially oriented grammar systems. The aim of thesis is to introduce approaches to syntactic analysis base on grammar systems. Thesis is based on context-free methods of syntactic analysis, extending them and connecting them together. It provides recipe for simplification of big context-free grammars using decomposition to cooperating components. Great attention is dedicated to increase generative capacity of LL parsing. There were created structures within this thesis, which are capable to generate context-sensitive languages. This work also provides a simple recipe for implementation of these structures. We introduced LL table based parser, which is capable to parse deterministic context-sensitive languages. Using presented method is possible to extend many of often used languages with context-sensitive elements, especially elements contradicting with pumping lemma.
Grammar Systems and Parsing Based on Them
Hrstka, Jan ; Martiško, Jakub (referee) ; Meduna, Alexandr (advisor)
This thesis provides a summary of knowledge of grammar systems. It focuses primarily on sequentially oriented grammar systems. The aim of thesis is to introduce approaches to syntactic analysis base on grammar systems. Thesis is based on context-free methods of syntactic analysis, extending them and connecting them together. It provides recipe for simplification of big context-free grammars using decomposition to cooperating components. Great attention is dedicated to increase generative capacity of LL parsing. There were created structures within this thesis, which are capable to generate context-sensitive languages. This work also provides a simple recipe for implementation of these structures. We introduced LL table based parser, which is capable to parse deterministic context-sensitive languages. Using presented method is possible to extend many of often used languages with context-sensitive elements, especially elements contradicting with pumping lemma.

Interested in being notified about new results for this query?
Subscribe to the RSS feed.