|
|
Management of Exhibition Sites for a Festival
Duchoň, Radek ; Klobučníková, Dominika (referee) ; Křivka, Zbyněk (advisor)
The aim of this work is to create a new information system for the management of exhibition spaces at the festival called Animefest. The web application is implemented in Python using the Django application framework. The system uses a vector map in SVG format for the definition and representation of spaces. The created solution also provides its own system for recording the history of changes in the database. The system will allow festival organizers to catalog spaces and preserve the history of cooperation with various partners.
|
|
|
Sequential and Parallel Grammars: Properties and Applications
Klobučníková, Dominika ; Martiško, Jakub (referee) ; Meduna, Alexandr (advisor)
This thesis deals with the topic of sequential and parallel grammars. Both of these groups cover a large number of grammar families, most of which, however, are not widely used because of the difficulties related to their processing. The thesis examines some of these grammar types, such as scattered-context grammars, multigenerative systems, and interactive L-systems, with focus on their normal forms. Subsequently, it introduces a set of algorithms utilising properties of the discussed grammar types as well as their normal forms. These algorithms are based on the Cocke-Younger-Kasami algorithm for context-free grammars, and are capable of parsing any grammar in the corresponding normal form. Finally, a program implementing the proposed algorithms is presented.
|
|
|
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.
|
|
|
General Grammars: Normal Forms with Applications
Klobučníková, Dominika ; Krčmář, Radim (referee) ; Meduna, Alexandr (advisor)
This thesis deals with the topic of unrestricted grammars, normal forms, and their applications. It focuses on context-sensitive grammars as their special cases. Based on the analysis of the set, an algorithm was designed using the principles of the Cocke-Younger-Kasami algorithm to make a decision of whether an input string is a sentence of a context-sensitivegrammar. The final application, which implements this algorithm, works with context-sensitive grammars in the Penttonen normal form.
|
|
|
Grammar Systems Applied to Compilation
Reš, Jakub ; Klobučníková, Dominika (referee) ; Meduna, Alexandr (advisor)
The main goal of this work is to design a method of constructing a compiler based on grammar systems that allows it's user to by able to combine any existing construction methods. Solution of this problem lies in utilization of cooperating distributed grammar systems. The principle of dividing compiler into sequentially cooperating components was used by this thesis. So we have a construction of smaller, narrowly specified units that are able to pass control to each other and together analyze complex languages. Each of these components is using one of the existing methods of analysis and any way of it's implementation. Benefit of this thesis is the design of construction method using principle of grammar systems, that allows us to use combination of any existing methods and brings overall higher generative power, and showing a possible way of using this method.
|
|
|
Demonstration of Scattered Context Grammars with Single Context-Sensitive Rule
Holas, David ; Klobučníková, Dominika (referee) ; Křivka, Zbyněk (advisor)
The goal is to create an application that constructs scattered context grammars with single context-sensitive rule from queue grammars, and derives strings using them. The application presents the whole process to user in form of plain text or HTML. In order to derive strings, the heuristic is used to reduce the number of applicable rules in each sentential form. Applicable rules can be selected manually by the user in order to alter derivation process. Two errors were discovered in underlying theory of thesis. Specifically in transformation of queue grammars into first normal form and the construction of scattered context grammars with single context-sensitive rule. A partial solution to the second error was found and is implemented in application.
|
|
|
New Versions of Translation Automata
Baláž, Miroslav ; Klobučníková, Dominika (referee) ; Meduna, Alexandr (advisor)
This thesis does research on new version of translation automata. It takes closer look at existing pushdown transcuders and regulated grammar. Combining these two concepts together which creates new regulated pushdown transcuder as a new form of translation automata. Examine computational power of regulated grammar and tests its usage combined with transcuder and test usablity of this new defined regulated transcuder in implementation for translating input source code.
|
|
|
Parsing Based on Grammar Systems
Sedmík, Adam ; Klobučníková, Dominika (referee) ; Meduna, Alexandr (advisor)
This thesis is focused on grammar systems and syntax analysis. Thesis introduces cooperating distributed and parallel communicating grammar systems. Based on knowledge of grammar systems, new grammar system is introduced. This grammar system focuses on modularization of syntax analysis. Shown are two methods of syntax analysis, recursive descent parsing and precedence parsing. Grammar systems introduced are demonstrated on syntax analysis of custom programming language.
|
|
|
Parsing for ET0L Systems
Kožár, Tomáš ; Klobučníková, Dominika (referee) ; Meduna, Alexandr (advisor)
This thesis focuses on deciding the membership of strings in languages generated by ET0L systems. It is achieved by designing two algorithms. The first one is a modification of the existing algorithm Cocke-Younger-Kasami for syntax analysis of context-free grammars in Chomsky normal form. This modification takes into account different properties of ET0L systems compared to context-free grammars. Specifically, the parallel application of production rules and multiple tables of these production rules. Also, used normal form is different from Chomsky normal form since CNF is unfit for ET0L systems. The second designed algorithm works in a top-down manner and gradually generates all valid strings. The resulting algorithms are tested, demonstrated, and fully functional. The contributions of this thesis are two new algorithms for syntax analysis of ET0L systems.
|
|
| |
guest ::
