|
|
Multi-Level Automata and Their Applications
Pšenák, Kamil ; Tomko, Martin (referee) ; Meduna, Alexandr (advisor)
In this thesis, we will add to already known fnite automata paradigm. We start with basic defnitions used in theoretical informatics. Afterwards we defne multi-level fnite automata, which is the base of this thesis. Then we move on to the compilation process and construction of a compiler. With that we defne lexical analysis as our example for multi-level fnite automata implementation. Once we implement the concept, we compare the new and the old way. Then we dig deeper into theoretical informatics to defne parallel right-linear grammars and languages. To prove a concept we create another concept with implementation strategy, using multi-level framework. Lastly, we mention some other areas in informatics, where this multi-level concept could be useful.
|
|
|
Script Language for Image Processing
Zuzaňák, Jiří ; Herout, Adam (referee) ; Zemčík, Pavel (advisor)
This thesis deals with design of scripting language, especially specified for effective image processing. Introduction of this thesis is focused on studying and also appropriation of methodology of compilers and interpreters design, include their following application in design of the scripting language and as well its interpreter. Another point of my work is showing the methods of design and implementation of the interpreter including automated methods used in the design of the implemented program. Next part deals with description of structure and implementation of the designed program, intended for generating compiler of any language which is described in input of this program. The conclusion of this work is more detailing description of the scripting language design; its implementation is based on the methods mentioned before.
|
|
|
Advanced Parser Generators
Havranek, Daniel ; Kövári, Adam (referee) ; Křivka, Zbyněk (advisor)
This bachelor thesis deals with parser generation by tools that use advanced parsing techniques. These techniques are compared from both theoretical and practical point of view. The GNU Bison tool, which uses the LALR(1) method and Generalized LR method, and the ANTLR tool, which uses the more modern ALL(*) method, are examined in detail. To compare the effectiveness of these tools, a parser for a fictional programming language is implemented using them to demonstrate the strengths and weaknesses of each approach. As the results, GNU Bison is much more powerful, but the ANTLR outweighs it in terms of implementation friendliness and functionality. The results of this thesis can help deciding which approach or tool to choose when implementing a parser.
|
|
|
Blender Add-on for Generation of 3D Mathematical Equations
Strenková, Katarína ; Milet, Tomáš (referee) ; Chlubna, Tomáš (advisor)
This bachelor's thesis aims to create a Blender add-on, which makes the creation of 3D mathematical equations easier for users. Unlike alternative solutions, equations consist of individual editable text objects. The input data are entered in the mathematical notation of the Latex language. They are later analyzed using lexical and syntax analysis. When no faults are found, the specified mathematical equation is generated in a 3D environment. The final add-on is functional with the support of main Latex commands and is intended for public use.
|
|
|
Incremental Parsing for YARA Language
Dvořák, Vojtěch ; Kolář, Dušan (referee) ; Regéciová, Dominika (advisor)
The main goal of this bachelor thesis is to design and implement a program library that enables incremental static analysis of the YARA language. One of the main purposes of this new library is to integrate with the open-source Yara Language Server project developed by Avast. Compared to the existing solution, which uses a non-incremental approach to analysis, the machine time requirements should be reduced. In addition to information about the software solution, this thesis also includes a summary of the theory focusing on static analysis and its incremental variant, essential information about the YARA tool, and an introduction to the existing solution, the Yaramod-v3 library. The thesis also contains a comparison of the new library with the current solution, in which the achieved results are presented. The experiments performed showed that the new library is able to perform incremental analysis of a modified rule set approximately 20× – 2000× faster depending on the particular set.
|
|
| |
|
|
Discourse analysis of language of tabloids
Gazdošová, Sára ; Walek, Agata (referee) ; Langerová, Petra (advisor)
Tato práce obsahuje popis jazykové analýzy textů z hlediska lexikálního, gramatického a stylistického. Dále jsou probírány termíny jako koheze, koherence a kontext. Tato práce je rozdělena do dvou částí. První část se zabývá teorií a obecnými informacemi o diskurzní analýze a obsahuje obecné příklady. Tyto informace jsou důležité pro pozdější pochopení analýzy jazyka bulváru. Je zde také zmíněna historie a základní typy masmédií. Druhá část se zabývá analýzou praktických příkladů z online verzí bulvárních deníků Daily Mail a The Sun. Je zde krátce popsán vzhled a rozložení stránek těchto deníků. Vybrané prvky analýzy jazyka jsou aplikovány na příklady z těchto bulvárních novin.
|
|
|
Advanced Parser Generators
Havranek, Daniel ; Kövári, Adam (referee) ; Křivka, Zbyněk (advisor)
This bachelor thesis deals with parser generation by tools that use advanced parsing techniques. These techniques are compared from both theoretical and practical point of view. The GNU Bison tool, which uses the LALR(1) method and Generalized LR method, and the ANTLR tool, which uses the more modern ALL(*) method, are examined in detail. To compare the effectiveness of these tools, a parser for a fictional programming language is implemented using them to demonstrate the strengths and weaknesses of each approach. As the results, GNU Bison is much more powerful, but the ANTLR outweighs it in terms of implementation friendliness and functionality. The results of this thesis can help deciding which approach or tool to choose when implementing a parser.
|
|
|
Pattern matching in compilers
Bílka, Ondřej ; Hubička, Jan (advisor) ; Mareš, Martin (referee)
Title: Pattern matching in compilers Author: Ondřej Bílka Department: Department of Applied Mathematics Supervisor: Jan Hubička, Department of Applied Mathematics Abstract: In this thesis we develop tools for effective and flexible pattern matching. We introduce a new pattern matching system called amethyst. Amethyst is not only a generator of parsers of programming languages, but can also serve as an alternative to tools for matching regular expressions. Our framework also produces dynamic parsers. Its intended use is in the context of IDE (accurate syntax highlighting and error detection on the fly). Amethyst offers pattern matching of general data structures. This makes it a useful tool for implement- ing compiler optimizations such as constant folding, instruction scheduling, and dataflow analysis in general. The parsers produced are essentially top-down parsers. Linear time complexity is obtained by introducing the novel notion of structured grammars and reg- ularized regular expressions. Amethyst uses techniques known from compiler optimizations to produce effective parsers. Keywords: Packrat parsing, dynamic parsing, structured grammars, functional programming 1
|
|
|
Linguistic characteristics of the present comics
Hradečný, Aleš ; Palkosková, Olga (advisor) ; Chejnová, Pavla (referee)
The thesis is focused on comics and mainly its lingustic aspect. The first part introduces comics as a cultural phenomenon and its various definitions from which the best possible is chosen. After that it deals with brief history of comics and its development from different geographic points of view. The attention is given to the language of comics and mainly to its specific, unique cooperation between words and images. In the second part analysis of two comic books, Anča a Pepík from 1990 and Na odstřel from 2014, from Lucie Lomová is realized. The results are compared with each other and conclusions are drawn. The common features of comics language are introduced on the bacground of the analyses.
|
guest ::
