|
|
Syntactic Analysis Based on Matrix Grammar
Brindza, Dominik ; Horáček, Petr (referee) ; Zámečníková, Eva (advisor)
The subject of this thesis is to develop a method of syntactic analysis based on matrix grammar s. In its theoretical part we provide various analytical aspects for this type of regulated grammar in order to reveal the common background as well as search for similarities with the classical context-free grammars which we will then be able to benefit from in the practical part. Our goal is to extend the well-known predictive method of syntactic analysis to further accept a wider spectrum of formal languages - some of the context-sensitive ones which we are able to generate using our matrix grammars. Besides this main effort we also present some experimental algorithms and suggestions hich could be used in further research of this project.
|
|
|
Checkers - like Network Game
Semerád, Lukáš ; Horáček, Petr (referee) ; Čermák, Martin (advisor)
This bachelor thesis is concerned with board game checkers. It summarizes the history and previous games. The thesis discusses the various versions of the rules that are played around the world. It also deals with the analysis of algorithms for a computer game. The result of this work is a program that allows the game two players, game via network and play against the computer. Also allows different setting default rules.
|
|
|
Compiler Warnings Filter
Krajčovičová, Mária ; Horáček, Petr (referee) ; Zemek, Petr (advisor)
Goal of this bachelor's thesis was design and implementation of program which filtrate warnings from compiler output without hitting the source codes. The bachelor's thesis describes compilers as GCC, Clang, Javac and GHC. It describes also their functionality and types of warnings from their outputs. Result of the bachelor's thesis is an application which is able warning filltration for mentioned compilers.
|
|
|
Deep Pushdown Automata of Finite Index
Poncová, Vendula ; Horáček, Petr (referee) ; Meduna, Alexandr (advisor)
This thesis introduces several modifications of deep pushdown automata considering the reduced number of states or non-input symbols. It is shown that the power of deep pushdown automata of finite index is not affected by a limitation of non-input symbols to one, thus these automata characterize an infinite hierarchy of language families resulting from programmed grammars of finite index. Based on a principle of these automata, it is established the normal form of deep pushdown automata. Finally, I introduce generalized deep pushdown automata. They expand the topmost possible non-input symbol in the pushdown. These automata and their reduced forms are equivalent to state grammars.
|
|
|
Modified Deep Pushdown Automata
Škvařilová, Radka ; Horáček, Petr (referee) ; Meduna, Alexandr (advisor)
This thesis introduce two new modifications of deep pushdown automata - stateless deep pushdown automata and parallel deep pushdown automata. In theoretical part of this thesis is formal definition and research into power of these modification. Practical part consists of an implementation of simple automata program.
|
|
|
Compiler of Language of Mathematical Function
Junek, Lukáš ; Horáček, Petr (referee) ; Čermák, Martin (advisor)
In this thesis, we are dealing with construction of Interpreter of Language of Mathematical function. We constructed all parts of interpreter, which involved processing and execution of source code. The main part of my thesis is implementation of computer operations with matrices using SSE instructions. For this purpose, we used interface by Intel. There in a special header file are defined the functions corresponding to each instruction. However, functions not only to calculate, but perform support operations, which eliminate some annoying features of assembler.
|
|
|
A Combination of Automata and Grammars
Kučera, Jiří ; Horáček, Petr (referee) ; Meduna, Alexandr (advisor)
V této práci byly zavedeny a studovány nové systémy formálních modelů, zvané stavově synchronizované automatové systémy stupně n . Výpočet je v těchto prezentovaných systémech řízen pomocí slov patřících do konečného řídícího jazyka, kde každé slovo z tohoto jazyka je složeno ze stavů komponent systému. Dále byla v této práci studována výpočetní síla zavedených systémů. Praktické použití zavedených systémů bylo demonstrováno na příkladu z oblasti překladu přirozených jazyků a dále na příkladu z oblasti paralelního překladu.
|
|
|
Application for Visualization of Finite Automaton Structure
Polcer, Ondřej ; Horáček, Petr (referee) ; Zámečníková, Eva (advisor)
The goal of this thesis is to create an application that converts text form of a finite state machine to a state diagram. First, the code form of finite state machine syntax is transformed into the object form and complemented by additional data. The algorithm of finding appropriate placement for individual state of structure follows to make their transition clear and understandable with considering the complexity of a given finite state machine. The application creates a set of equivalent views in various form and delivers the appropriate information for easy interpretation of results.
|
|
|
Support for Form Filling in Web Browser
Čekan, Ondřej ; Horáček, Petr (referee) ; Křivka, Zbyněk (advisor)
This thesis deals with the creation of an extension for the selected web browser, which should make working with web forms much easier for the user. The document describes ways how to automatically fill in data forms and principles of their storage. It also deals with tools for writing SMS messages, such as text compression, removal of diacritics, spell check. In thesis also discusses the often repeated filling in data forms. In conclusion, there are mentioned results of the thesis with possible future expansion proposals in the document.
|
|
| |
guest ::
RSS feed.