|
|
Parsing Based on Multigeneration
Kleiner, Miloš ; Čermák, Martin (referee) ; Meduna, Alexandr (advisor)
Multygeneratic system is based on cooperation action of infinity count of context-free grammars. All this context free-grammars parallel and synchronous derivate individual sentential form. During generation came in each specific derivation step to checking of correction of each generated sentential forms. This checking can be made by different ways. Solution is then so-called multistring (vector of strings), so by the help of this is defined generated language.
|
|
|
Card Game Tarot For Mobile Devices
Sykala, Vít ; Čermák, Martin (referee) ; Křivka, Zbyněk (advisor)
This thesis describes development of the Tarot game for mobile devices. The game is developed in Java - J2ME. The application allows to play Tarot to one through four people. The player intelligence represented by the mobile device is implemented as an expert system. The expert system rules can be changed without necessity to recompile the application. Designed and implemented expert system uses a lightweight version of Prolog language as a knowledge base. The system requires the rules of precisely defined form specified in this thesis.
|
|
|
LaTeX and Microsoft Power Point Presentations Convertor
Černý, Lukáš ; Čermák, Martin (referee) ; Křivka, Zbyněk (advisor)
This work deals with theoretical and practical basis for the creation of converter between LaTeX and Microsoft PowerPoint presentations. It discusses the use of LaTeX and the Beamer class for presentations, programmatic creation of PowerPoint documents using PowerPoint Primary Interop Assemblies and PresentationML. It outlines the use of the scanners and parsers generators GPLEX and GPPG respectively. It deals with the characteristics of today's tools for document conversion. And finally deals with the particular pitfalls of the design, implementation and testing of the application for conversion of documents between LaTeX platform and Microsoft PowerPoint.
|
|
|
Parsing of Regulated Grammars
Šrajer, Roman ; Čermák, Martin (referee) ; Křivka, Zbyněk (advisor)
This thesis studies regulated grammars, their fundamentals and expressing power regarding Chomsky hierarchy of languages. Programmed grammars are investigated in more depth considering a few types of leftmost derivations. A variant of deterministic syntax analysis of programmed grammars is introduced. This analysis works similarly as LL(k) parsing. Transformations of matrix grammars into programmed grammars without changing their expressing power are introduced. The syntax analysis by regularly controlled grammars partly using programmed grammars are presented. In the end, cooperating distributed grammars with left permitting grammars as components are mentioned. Their deterministic syntax analysis uses predictive table or exhaustive exploration of the whole state space.
|
|
|
Comparing GUI Implementation in Different Libraries in OS Linux
Šelepa, Jan ; Beran, Vítězslav (referee) ; Čermák, Martin (advisor)
This thesis presents the elemental properties and principles in graphical user interface. It then shows how one can work with a graphical user interface on GNU/Linux operating system and gives some examples of toolkits used for this purpose. The next part shows the design of an aplication based on an existing anti-virus program. The last part shows the dierences between the two implementations of the designed application.
|
|
|
Parallel Syntax Analysis
Otáhal, Jiří ; Koutný, Jiří (referee) ; Čermák, Martin (advisor)
This thesis focuses on modern methods of language description. It introduces several controlled grammars, describing in detail the tree controlled grammar. The thesis is based on relatively new technique of syntax analysis using tree controlled grammars. The process of this analysis is described in detail, followed by a design of parallel-processing of this analysis. We managed to succesfully implement this design, speed up the syntax analysis and therefore achieve the main goal of the thesis.
|
|
|
Systems of Formal Models with Applications
Čermák, Martin ; Lukáš, Roman (referee) ; Meduna, Alexandr (advisor)
This paper introduces and discusses automata systems as a new way for formal languages processing. In the text there are four models described. The first model works on sequential mode. At one computation step only one of components works. The second one works on semi-parallel mode. At the one computation step either one or all the components of the automata system work. In the last two models each component of the automata system has its own input string. The computation step of each component is influenced by their states, or used rules. The state, or used rule of the components of automata system can block or unblock some or all automata of the system.
|
|
|
Lexical Analyzer for Multiprocesor Computers
Otáhal, Jiří ; Goldefus, Filip (referee) ; Čermák, Martin (advisor)
Aim of this thesis is to invent method, which should accelerate speed of the analysis of source texts with multiprocessor computers. For this purpose application runs multiple process in Unix system. Each undergoing process analyzes exact partition in source file and then closes itself. Outcome of this process are internal structures, which presents exact partition. Inter-code is sequentially built from the structures which are subsequently interpreted. This kind of parallel analysis achieves acceleration of speed on the contrary of typical sequential analysis.
|
|
|
Graphical Simulation of Finite Automata
Šrajer, Roman ; Goldefus, Filip (referee) ; Čermák, Martin (advisor)
This Bachelor's Thesis is about the theory of converting regular expression to finate state machine and vice versa. The goal of practical part is to make web application that performs these coversions and do simulation for input string. For converting automata into regular expression it is used the algebraic method which is based on making an equation system to be solved. I have chosen Java as programming language and Java Applet and Java Web Start as technologies that make possible to access the application through the web page. The possibilities like working with three types of automata views, saving atomatons into XML and intuitively creating own automatons are the important part of the application.
|
|
| |
guest ::
