|
|
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.
|
|
|
Parsing Based on Modified Pushdown Automata
Pluháček, David ; Lukáš, Roman (referee) ; Meduna, Alexandr (advisor)
The thesis introduces new models for formal languages, the m-limited state grammar and the deep pushdown automaton. Their basic definitions are presented, so is their mutual equivalence and the characteristics of the language family they describe. Following, a parsing method based on these models is presented. The method is an extension of a similar method used for context-free languages, the table driven parsing. The final part of the thesis describes the implementation of a parser based on the method.
|
|
|
Scientific Web Portal Generator
Růžička, Štěpán ; Vyskočil, Michal (referee) ; Smrž, Pavel (advisor)
In this document I am talking about dynamic web application, which I am making via Ruby on Rails, XML, MySQL and AJAX technology. Introduce describes, why I have chosen this job, and what you can find in this document. Next part is about Ruby on Rails and XML, where I am describing how to use REXML library and what it offers to you. There are some examples to better understanding that. Continuing with describing libraries, which can offer dynamic, sound and some other effects. Prototype and script.aculo.us are described there and some examples as well. Semifinal chapter is about Web portal generator in general at first and next about single steps when I was working on my application. In last one chapter I am trying to look on my application from user's point of view. I am describing the way, how I tried to make application better for usual user. I joined some reactions from persons who had the opportunity to work with my application. Document terminates by resume of gained experiences.
|
|
|
Parallel Multigenerative Cocke-Younger-Kasami-Based Parsing
Sopuch, Zbyněk ; Burgetová, Ivana (referee) ; Meduna, Alexandr (advisor)
We deal with text processing, pattern matching and syntax analysis every day, and new areas emerging. We can consider programming languages, communication protocols or a simple text as well-know examples. Therefore, we need new effective methods which fit into these areas. In this work, we explore the topics of parallel grammars, E0L-systems and multigenerative grammar systems. The goal is to improve the Cocke-Younger-Kasami algorithm and present a stronger algorithm of analysis.
|
|
|
Parsing Based on State Grammars
Novotný, Miroslav ; Kocman, Radim (referee) ; Meduna, Alexandr (advisor)
This thesis's main focus is parsing, based on state grammars. The goal is to create a program, that will be able to load the grammar from input file. Based on a loaded grammar, the program will create an LL table and parse an input file using this table. The next goal is to study properties of parsing, based on state grammars, while using a created program as a stand point. Part of the testing will also be grammar structures which are not context-free.
|
|
|
Parsing Based on Grammar and Automata Systems
Šoustar, Jakub ; Kocman, Radim (referee) ; Meduna, Alexandr (advisor)
This thesis is concerning with parsing using parallel communicating pushdown automata systems. Focusing especially on impacts of nondeterminism in individual components on the whole system. Also it introduces a proposal of algorithm for converting some parallel communicating grammar systems to parallel communicating pushdown automata systems. The gained knowledge is used to design and implement parsing method.
|
|
|
Parsing Based on Regulated Grammars
Vaníček, Luboš ; Kučera, Jiří (referee) ; Meduna, Alexandr (advisor)
This thesis deals with regulated grammars. It describes their behavior and it compares them using different examples of context-sensitive languages. The thesis focuses mostly on programmed grammars. It modifies the methods of parsing and it uses them for programmed grammars. This thesis applies the developed method of parsing on context-sensitive languages and examines their power.
|
|
|
XML Data Compression
Jelen, Michal ; Polák, Josef (referee) ; Kováč, Dominik (advisor)
This master’s thesis is dealing with problems of XML data compression. It describes a characterization and important concepts of XML language as well as AIXM as XML data format. It documents contemporary compression methods of XML and divides them into appropriate groups. Thereinafter a testing of XML data compression using mentioned methods and evaluation of results is implemented. With a consideration of processed data there is created and presented an application which enables lossy and lossless compression of AIXM with the help of particular elements data analysis. All of it with user selection options of AIXM objects and way of resultant compression.
|
|
|
Possibilities of generation and usage of AST in PHP programming language
Kočárek, Michal ; Kosek, Jiří (advisor) ; Tichý, Jan (referee)
The thesis provides theoretical base for development of the DoXRef. DoXRef is a tool for generating the "x-ref" documentation from PHP source codes. As part of the thesis the tool has been developed and shows the conclusions from this work in practice. There is described the reason of choosing this topic and the arguments for the development of the DoXRef in the introduction. Theoretical part describes structures for analysis and modification of the source code. Thesis extends the abstract syntax tree structure by removing some of its drawbacks. In the chapters about parsing, the Pratt's algorithm is noted, which itself is simple to understand but still very effective. This algorithm is used in the project's parser as well. The practical part describes structure and features of the DoXRef tool and includes screenshots from the generated documentation as well. The source code and usage examples are provided as a part of this thesis. The contribution from this thesis is primarily the DoXRef tool. The tool can be extended into usable form and its parts can be reused in other applications. The source code is published under open-source license.
|
|
|
Lexical specificities of French legal language in the field of civil justice and the problematic of their translation into Czech language
BALÁŽOVÁ, Tereza
Bachelor thesis covers the parsing and translation issues of lexical specifics of french legal language, concretely in the area of civil justice. Its purpose is to map given problematics both theoretically and practically. The thesis is composed of two major parts. The first one, theoretical, uses the expert sources to define basic terms and deal with parsing, attributes and lexical characteristic of legal language. Theoretical part also specifies translations?methods used in translations of juristic texts. Practical part utilizes content analysis method to describe the most interesting terms employed in civil justice. Supplement to this part is a resumé in French and French-Czech glossary.
|
guest ::
