|
|
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.
|
|
|
Grammar Systems and Syntax-Directed Translation Based on Them
Handlíř, Jaroslav ; Martiško, Jakub (referee) ; Meduna, Alexandr (advisor)
The thesis examines the theory of formal languages in the field of context-free grammars. It focuses mainly on the possibilities and models of collaborating grammars to solve a common problem. In this context, it presents grammatical systems that have been designed as a formal means for describing distributed and parallel processing. After introducing to the problematics, the thesis focuses on the practical use of these mechanisms in the translation controlled syntax, and therefore the second part of the thesis deals with the implementation of a dynamic syntactic analyzer that uses more grammars during the analysis. With respect to the greatest user friendliness and the possible didactic use, the application is implemented using modern web technologies HTML5, JavaScript, AngularJS, CSS3, LESS and more.
|
|
|
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.
|
|
|
Parsing Based on Tree-Controled Grammars
Granát, Štěpán ; Martiško, Jakub (referee) ; Meduna, Alexandr (advisor)
The goal of this thesis is to design and implement the parser of grammars, whose derivation tree is limited by inspection of levels. Common parsing procedures are studied in detail and then it is discussed, how they could be extended by inspection of derivation tree. The most important part of the thesis is a draft of continuous inspection of the derivation tree simultaneously with its construction, which allows close cooperation between these two processes. This approach enables significant increasing of the parser power.
|
|
|
Parsing Based on Regulated Automata
Genčúrová, Ľubica ; Martiško, Jakub (referee) ; Meduna, Alexandr (advisor)
This work deals with the design, applicability and the implementation of parsing methods based on pushdown automata that regulate the use of their rules by linear control languages. These automata are more powerful than ordinary automata and they are as powerful as Turing machine. The pushdown automata regulated by linear control languages characterize the family of recursively enumerable languages.
|
|
| |
|
|
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.
|
guest ::
