|
|
Machine Understanding for Text Messages Used in Aviation
Lieskovský, Pavol ; Rajnoha, Martin (referee) ; Povoda, Lukáš (advisor)
This work deals with problems of NOTAM in text format, which is used in aeronautics. It documents the difference between text and digital format of NOTAM, special types of NOTAM messages and items from which the NOTAM consist of. It describes syntax and the functions of program, which was made within the frame of this thesis. The program is fully capable of correct parsing and processing of the NOTAM. The program can display each area of processed NOTAM messages in map and also provides detection of collision between these areas and flight plan
|
|
|
Parallel Versions of General Parsing
Mikita, Tibor ; Kučera, Jiří (referee) ; Meduna, Alexandr (advisor)
This thesis deals with general parsing methods. The author studies the Cocke-Younger-Kasami algorithm and comes up with a design of a parallel version. The motivation of~the author is the acceleration of parsing based on this algorithm. The result is a console application that can determine whether an input string belongs to a language generated by the input grammar or not on the basis of the designed parallel algorithm. For the programming language, C++ was chosen. To achieve parallelism the work of the algorithm was divided among several threads.
|
|
|
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.
|
|
|
New Versions of Automata and Grammar Systems
Lichota, Lukáš ; Kocman, Radim (referee) ; Meduna, Alexandr (advisor)
This work deals with the modification of classical grammar systems with context-free base and defines new, modified linear grammar systems with linear grammar base. Also it deals with modification in automata systems, where each automaton is generative as strong as linear grammar, which is satisfied with the usage of one-turn push-down automata. This thesis also contains view on program realisation of theoretical models, which were described in theoretical part and introduces two programs for syntax analysis built based on it.
|
|
|
Parsing Based on Automata with Deep Pushdowns
Rusek, David ; Kocman, Radim (referee) ; Meduna, Alexandr (advisor)
This paper addresses the issue of design and implementation of syntactic analysis based on the context sensitive languages, respectively, grammars that contains constructs, which isn't possible to analyze with the help of the standard parsers based on the context free grammars. More specifically, this paper deals with the possibility of adding context sensitive support to the classic LL-analysis by replacing the standard pushdown automata (PDA) with deep pushdown automata (DP), which were introduced and published by prof. Alexander Meduna.
|
|
|
User tools to support automated functional testing of prototypes in product development
Grabovský, Štěpán ; Macháček, Jiří (referee) ; Svoboda, Radomír (advisor)
This work deals with develop of PC application to support automated testing of prototypes, which are developing in Honeywell International, Inc., ACS division in Brno. There was created a PC software witch executes testing process based on input script files. For select script files and specify other necessary information was designed a graphic user interface. Testing information are being presented in a program information control in real-time as the same as results of tests. The application also allow to users save the log file. The program has been realized in C# programing language.
|
|
| |
|
|
Data Acquisition from HTML Sites
Komenda, Tomáš ; Šimek, Václav (referee) ; Straka, Martin (advisor)
This work describes scope of creating application for extraction and following data from HTML sites. This work engages in lexical analyze and parsing HTML. This work describes filtration of data from HTML sites. This work describes saving of data in database and XML documents, creating of dynamic HTMP pages, timer cron, GNU utility wget, sending of SMS, sending email and extraction of date from internet. Final chapters describe two web applications. These applications follow data from HTML sites and inform users about changes.
|
|
|
Parsing Based on Scattered Context Grammars
Horníček, Ondřej ; Solár, Peter (referee) ; Zámečníková, Eva (advisor)
This work deals with new possibilities in parsing based on advanced formal models, specifically using scattered context grammars in syntactic analysis. Context-sensitive language was created for comparing different methods of syntactic analysis, where these grammars are used. In conclusion is discussed possible use in practise, paralell parsing, pros and cons and further investigation.
|
|
|
Parsing Based on Random Context Grammars
Mikita, Martin ; Solár, Peter (referee) ; Vrábel, Lukáš (advisor)
This thesis describes a random context grammar and the implementation of an application which will convert this grammar (respecting the LL condition) to an equivalent context-free grammar (also satisfying the LL condition). The resulting grammar can be used in the existing parser generator that accepts a yacc-compatible format. This thesis uses the GNU Bison generator, for which the encapsulated script was introduced. The potential advantage of random context grammar consists in the proven efficient description compared to context-free grammar for some languages.
|
guest ::
