|
|
Parsing Based on Automata with Deep Pushdowns
Pločicová, Dominika ; Dvořák, Tomáš (referee) ; Meduna, Alexandr (advisor)
Language is a basic means of communication. Formal languages provide the basis for human-computer communication. The aim of this work is to contribute to this area and analyze the possibility of processing the context-sensitive elements of formal languages. The work includes the theoretical description of state grammar and deep pushdown automaton, which is a model of a parser for languages including context-sensitive elements. It describes an algorithm that can convert the state grammar to the said deep pushdown automaton. The work further describes parsing, its methods and the use of the created automaton in performing the syntax analysis. For a better understanding, the work also includes examples of the creation and operation of the automaton. Finally, the work describes the implementation of a program that performs theoretically described activities. The functionality of the program was verified on examples, whose inputs and outputs are also part of the text of the work.
|
|
|
Deep Pushdown Automata of Finite Index
Poncová, Vendula ; Horáček, Petr (referee) ; Meduna, Alexandr (advisor)
This thesis introduces several modifications of deep pushdown automata considering the reduced number of states or non-input symbols. It is shown that the power of deep pushdown automata of finite index is not affected by a limitation of non-input symbols to one, thus these automata characterize an infinite hierarchy of language families resulting from programmed grammars of finite index. Based on a principle of these automata, it is established the normal form of deep pushdown automata. Finally, I introduce generalized deep pushdown automata. They expand the topmost possible non-input symbol in the pushdown. These automata and their reduced forms are equivalent to state grammars.
|
|
|
Semi-Parallel Deep Pushdown Automata
Ševčík, Miroslav ; Zámečníková, Eva (referee) ; Meduna, Alexandr (advisor)
This work introduces semi-parallel deep pushdown automata as an extension of sequential deep pushdown automata. Unlike the sequential automaton, a semi-parallel one is able to make expansions of n nonterminal symbols on the pushdown top simultaneously. These automata, same as sequential deep pushdown automata, define the family of languages generated by n-limited state grammars. The advantage of semi-parallel deep pushdown automata lies in higher speed. This work also describes the implementation of an aplication that simulates operation of these automata.
|
|
|
Parsing Based on State Grammars
Paulík, Miroslav ; Solár, Peter (referee) ; Meduna, Alexandr (advisor)
This work describes the characteristics of state grammars and n-limited state grammars with a focus on non-determinism in a parsing proccess based on such grammars. In particular, it focuses on the problems caused by enabling erasing productions or by possible occur of recursion. This work also describes possible solutions to non-deterministic problems, which are used in the design of a parallel parsing method. This method is significantly faster than sequence analysis based on backtracking.
|
|
|
Parsing Based on State Grammars
Svatý, Lukáš ; Vrábel, Lukáš (referee) ; Solár, Peter (advisor)
Syntax-directed translation based on state grammars is introduced in this bachelor's thesis. Theoretical section of this thesis is focused on the introduction of theoretical models that are necessary for understanding syntax analysis based on state grammars. The most important theoretical formal models in this thesis include deep pushdown transducer and translation grammar based on state grammar, which can be used in syntax analysis. Practical section of this thesis is focused on bottom-up syntax analysis using state grammar and its implementation.
|
|
|
Parsing Based on Modified Pushdown Automata
Pluháček, David ; Lukáš, Roman (referee) ; Meduna, Alexandr (advisor)
The thesis introduces new models for formal languages, the m-limited state grammar and the deep pushdown automaton. Their basic definitions are presented, so is their mutual equivalence and the characteristics of the language family they describe. Following, a parsing method based on these models is presented. The method is an extension of a similar method used for context-free languages, the table driven parsing. The final part of the thesis describes the implementation of a parser based on the method.
|
|
|
Canonical Derivations in Programmed Grammars
Zemek, Petr ; Masopust, Tomáš (referee) ; Meduna, Alexandr (advisor)
This work studies canonical derivations (with focus on leftmost derivations) in programmed grammars and left restriction range. It is shown that if we introduce n-limited derivations in programmed grammars as they were defined for state grammars, we get an infinite hierarchy of language families resulting from n-limited programmed grammars, so the left restriction range affects the generative power of n-limited programmed grammars. This result is significant for syntactical analysis based on programmed grammars.
|
|
|
Semi-Parallel Deep Pushdown Transducers and Their Applications
Putala, Marek ; Dolejška, Daniel (referee) ; Meduna, Alexandr (advisor)
The goal of this work was to become familiar with deep stack automata and, based on the acquired knowledge, to further design, formally define and implement a partially parallel deep stack transducer. It is an extension of deep stack transducer that is capable of accessing non-terminal symbols simultaneously on the stack in one step. With a suitably chosen configuration in the form of rules, they can process the input string with fewer transitions and therefore have a higher speed compared to deep stack transducer.
|
|
|
Parsing Based on Automata with Deep Pushdowns
Pločicová, Dominika ; Dvořák, Tomáš (referee) ; Meduna, Alexandr (advisor)
Language is a basic means of communication. Formal languages provide the basis for human-computer communication. The aim of this work is to contribute to this area and analyze the possibility of processing the context-sensitive elements of formal languages. The work includes the theoretical description of state grammar and deep pushdown automaton, which is a model of a parser for languages including context-sensitive elements. It describes an algorithm that can convert the state grammar to the said deep pushdown automaton. The work further describes parsing, its methods and the use of the created automaton in performing the syntax analysis. For a better understanding, the work also includes examples of the creation and operation of the automaton. Finally, the work describes the implementation of a program that performs theoretically described activities. The functionality of the program was verified on examples, whose inputs and outputs are also part of the text of the work.
|
|
|
Canonical Derivations in Programmed Grammars
Zemek, Petr ; Masopust, Tomáš (referee) ; Meduna, Alexandr (advisor)
This work studies canonical derivations (with focus on leftmost derivations) in programmed grammars and left restriction range. It is shown that if we introduce n-limited derivations in programmed grammars as they were defined for state grammars, we get an infinite hierarchy of language families resulting from n-limited programmed grammars, so the left restriction range affects the generative power of n-limited programmed grammars. This result is significant for syntactical analysis based on programmed grammars.
|
guest ::
