|
|
Systems of Translation Automata and Their Applications
Žitňanská, Lívia ; Klobučníková, Dominika (referee) ; Meduna, Alexandr (advisor)
The goal of this thesis is to define uniform unit for lexical and syntactic analysis. This unit is called lexical-syntactic transducer LST and it is composed of finite and pushdown transducer and communication (or query) symbols. Their definition and description are based on communication symbols introduced in parallel communicating grammar systems. Their purpose is to secure communication between those transducers. Thesis also deals with implementation of this unit, contains description of the implementation and comparison of attributes with the already existing systems. The resulting unit translates new language AIDA, which is based on Python 3 with elements from language C, to intermediate code.
|
|
|
Systems of Transducers: Definition, Properties, and Applications
Řezáč, Michal ; Kövári, Adam (referee) ; Meduna, Alexandr (advisor)
Currently, finite and pushdown automata are used to describe programming language compilers as two separate parts. This thesis aims to define a system of transducers that allows to describe a compiler by one aggregate system, instead of two independent transducers. The system of transducers presented in this paper is based on finite and pushdown transducers. It is a simple model without internal communication. Because of this property, it is not suitable for compiler formalization but because of its simplicity, the system is easily extensible with new features and can thus serve as a basis for further research.
|
|
|
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.
|
|
|
Systems of Transducers: Definition, Properties, and Applications
Řezáč, Michal ; Kövári, Adam (referee) ; Meduna, Alexandr (advisor)
Currently, finite and pushdown automata are used to describe programming language compilers as two separate parts. This thesis aims to define a system of transducers that allows to describe a compiler by one aggregate system, instead of two independent transducers. The system of transducers presented in this paper is based on finite and pushdown transducers. It is a simple model without internal communication. Because of this property, it is not suitable for compiler formalization but because of its simplicity, the system is easily extensible with new features and can thus serve as a basis for further research.
|
|
|
Systems of Translation Automata and Their Applications
Žitňanská, Lívia ; Klobučníková, Dominika (referee) ; Meduna, Alexandr (advisor)
The goal of this thesis is to define uniform unit for lexical and syntactic analysis. This unit is called lexical-syntactic transducer LST and it is composed of finite and pushdown transducer and communication (or query) symbols. Their definition and description are based on communication symbols introduced in parallel communicating grammar systems. Their purpose is to secure communication between those transducers. Thesis also deals with implementation of this unit, contains description of the implementation and comparison of attributes with the already existing systems. The resulting unit translates new language AIDA, which is based on Python 3 with elements from language C, to intermediate code.
|
guest ::
