|
|
Multi-Dimensional Languages and Their Automata
Dibďák, Lukáš ; Martiško, Jakub (referee) ; Meduna, Alexandr (advisor)
The Bachelor's Thesis introduces the theory of formal languages and finite automata. It describes generalisation of one-dimensional theory into two dimensions. It introduces basic types of two-dimensional automata, especially on-line tessellation automata. This paper offers algorithms for the process of determinization of on-line tessellation automata. One of the algorithms is used in enclosed application.
|
|
|
Grammar Systems Applied to Parsing
Martiško, Jakub ; Kolář, Dušan (referee) ; Meduna, Alexandr (advisor)
This paper deals with different variants of grammar systems. Grammar systems combine the simplicity of Context Free Grammars with the generative power of more complex gammars. There are two main variants of grammar systems described in this paper: PC grammar systems and CD grammar systems. New type of grammar system, which is a modification of the CD grammar systems, is also described in the paper. New method of parsing, based on this new grammar system is proposed in the paper. This new parser consists of several smaller parsers, which work in both top down and bottom up way.
|
|
|
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.
|
|
|
Parser Systems
Hrstka, Jan ; Martiško, Jakub (referee) ; Meduna, Alexandr (advisor)
This thesis provides a summary of knowledge of grammar systems. The thesis proposes modifications of parallel oriented grammar systems to be usable in sequential parsing. Concept of grammar systems is extended to level of entire parsers, that are grouped into parsing system. Then the properties of these systems are examined. The aim of thesis is to introduce approaches to syntactic analysis based on grammar systems. Thesis is based on context-free methods of syntactic analysis, extending them and connecting them together. Great attention is dedicated to increase generative capacity of LL and LR parsing. There were created context-free 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 generic concept of parsing, that enlarge generative power of conventional parsing methods. Using presented techniques it is possible to extend many of often used languages with context-sensitive elements, especially elements contradicting with pumping lemma.
|
|
|
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.
|
|
|
Graphical Viewer and Simple Editor of ELF File
Omacht, Martin ; Martiško, Jakub (referee) ; Křivka, Zbyněk (advisor)
The goal of this thesis is to create an application with graphical user interface that provides graphical overview of internal structure for binary files in ELF format while also allowing simple editing. The application handles corrupted files and supports Windows and Linux operating systems. It is implemented in C++ with graphical interface created using Qt library. To picture the internal structure of the given ELF file, a custom diagram was designed and implemented.
|
|
|
Demonstration of Selected Graph Algorithms
Galanská, Katarína ; Martiško, Jakub (referee) ; Křivka, Zbyněk (advisor)
This thesis deals with re-architecture of an existing application for the demonstration and visualization of selected graph algorithms. The goal of this thesis is to convert the application into multiple modules and make it easier to extend. OSGi technology helps to achieve the modularity. Its principles are explained and used to design and implementation of modules. With new architecture is also implemented the support for multilingual user interface using Eclipse Plugin internationalization. Graph algorithms represented as modules use OSGi Services. Dynamicity is ensured by installing the module and registering its service during the program's run time. The implementation also includes the creation of new modules for Prim's, Kruskal's, Edmond Karp's and modified Hierholzer's algorithm.
|
|
|
Language for High-Level Description of User Interface Requirements
Rašovský, Martin ; Martiško, Jakub (referee) ; Krčmář, Radim (advisor)
Diplomová práce se zabývá problematikou návrhu vysokoúrovňového jazyka pro popis grafického uživatelského rozhraní. Teoretická část rozebírá současné technologie uživatelských rozhraní zejména pro stanovení požadavků na nový jazyk. Z těchto poznatků násladně jsou shrnuty zásadní požadavky, které se nutně musí zakomponovat při návrhu samotného jazyka. Jsou zde zmíněny i požadavky z pohledu osob se specifickými vzdělávacími potřebami dle tzv. návrhových principů \textit{počítačové terapie}. Následně práce dle analyzovaných požadavků navrhuje jazyk pro vysokoúrovňový popis uživatelského rozraní. Součástí návrhu jazyka je také popis algoritmu pro kompozici jednotlivých komponent definovaných v jazyce do výsledného uživatelského prostředí. Navržený jazyk je implementován v programovacím jazyce C\#. Implementace je demonstrována na reprezentativních příkladech. Nakonec se práce věnuje dalším možným rozšířením jazyka.
|
|
|
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.
|
|
|
Graphical Viewer and Simple Editor of ELF File
Veškrna, Tomáš ; Martiško, Jakub (referee) ; Křivka, Zbyněk (advisor)
This thesis specify, design and develop graphial viewer and editor of ELF binary files. The goal of this thesis is to provide easier manipulation with ELF files, although they were corrupted by wrong editing. The final software must be multiplatform, so Qt library is used for the implementation of its graphical user interface. For manipulation with ELF files is uses elf.h library. The application is implemented in C++. The realized tool can be used on both Linux operation system and Microsoft Windows.
|
guest ::
