|
|
Generator of 3D Objects Based on L-Systems
Kvita, Jakub ; Solár, Peter (referee) ; Vrábel, Lukáš (advisor)
The aim of this bachelor thesis was to create an interactive system for generating 3D models. The generator is based on L-systems as a kind of formal grammars and turtle graphics for 3D modeling. The application was created in Java SE using JOGL library as access point for OpenGL and rendering. The thesis analyze the theoretical basis of L-systems, turtle graphics and rendering 3D objects and then describes creation of application using the acquired knowledge.
|
|
|
Parsing Based on State Grammars
Svatý, Lukáš ; Vrábel, Lukáš (referee) ; Solár, Peter (advisor)
Syntax-directed translation based on state grammars is introduced in this bachelor's thesis. Theoretical section of this thesis is focused on the introduction of theoretical models that are necessary for understanding syntax analysis based on state grammars. The most important theoretical formal models in this thesis include deep pushdown transducer and translation grammar based on state grammar, which can be used in syntax analysis. Practical section of this thesis is focused on bottom-up syntax analysis using state grammar and its implementation.
|
|
|
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.
|
|
| |
|
|
Enterprise Economic System
Squerzi, Ondřej ; Solár, Peter (referee) ; Ruttkay, Ladislav (advisor)
The aim of this work is to implement an economic system for small businesses as a Web application that will deal with purchase and sale of goods and services, keeping tax records. It will further enable to record bussines and catalog products, print invoices, and other tax documents. The application is implemented using technology. NET Framework in C # language with the design of object-oriented programming methodology.
|
|
|
Regulated Parsing
Wolf, Dominik ; Solár, Peter (referee) ; Meduna, Alexandr (advisor)
This work deals with advanced models of context-free grammars and explores the possibilities of adaptation and usefulness for deterministic parsing of non-context-free sructures by deep parsing method. It introduces adapted model of context-free grammar named LL programmed grammar and adapted deep pushdown automaton that makes deterministic parsing of non-context-free structures possible.
|
|
|
Syntax-Direxted Translation Based on Deep Pushdown Automata
Solár, Peter ; Lukáš, Roman (referee) ; Meduna, Alexandr (advisor)
This thesis introduces syntax-directed translation based on deep pushdown automata. Necessary theoretical models are introduced in the theoretical part. The most important model, introduced in this thesis, is a deep pushdown transducer. The transducer should be used in syntax analysis, significant part of translation. Practical part consists of an implementation of simple-language interpret based on these models.
|
|
|
GTD Project Management for Windows Mobile
Weigl, Libor ; Koutný, Jiří (referee) ; Solár, Peter (advisor)
This work deals with the GTD method and application, to facilitate its development agenda. The method allows us to become familiar with the organization of projects. It describes the Windows Mobile platform, under which applications will run, and outlines the tools used to develop this application.
|
|
| |
|
|
Combined Parsing Based on Grammar Systems
Caha, Petr ; Solár, Peter (referee) ; Meduna, Alexandr (advisor)
This thesis deals with a combined parsing based on grammar systems. Introduces modified method of classical grammar systems. At first they will be theoretically described and in the next part they will be implemented for parsing. The basis for the parser is a cooperating distributed grammar system. Implementation uses recursive method and case analysis. The parser is universal, applicable to any grammar systems based on context-free and some not context-free.
|
guest ::
RSS feed.