|
|
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.
|
|
|
Demonstration Program of LL Table Construction
Choleva, Ondřej ; Křivka, Zbyněk (referee) ; Zámečníková, Eva (advisor)
This work deals with desing and subsequent implementation of educational application for construction of LL table on given grammar basis. This table is used by predictive LL parser. A part of this application is also a demonstration of parsing using table driven parser. Application off ers possibility of stepping of all partial algorithms and their visualization in a graphical user interface. By development of application the request for portability was satisfied by choosing an appropriate multiplatform library.
|
|
|
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.
|
|
|
Resolution Method Visualisation
Smetka, Tomáš ; Orság, Filip (referee) ; Rozman, Jaroslav (advisor)
This bachelor’s thesis deals with problems in the area of automated reasoning in propositional and predicate logic. In the theoretical part the propositional and predicate logic is described in connection with the system of its automatic proving with help of resolution method. Further there is described draft and implementation of a program which consists of a terminal and server part. The program looks for a proof if the given formula is impossible to be solved and visualizes every single step which leads to finding of the solution. In conclusion the implementation of solution and the thesis as a whole is evaluated and there are also described additional possibilities of extension.
|
|
|
Language Version of Web
Laga, Ondřej ; Stryka, Lukáš (referee) ; Marušinec, Jaromír (advisor)
This thesis concerns a dilemma of multi-lingual web applications. The document describes some general solutions while suggesting such applications, however first of all it is aimed for information system VUT and its enlargement for translation administration. The text contains structural description of this system and instruments used during its development, but especially it defines system requirements of programming engineers and translators, describes and evaluates new language versions solution and there are possibilities of contingent extensions considered at the conclusion of my thesis.
|
|
|
Demonstration of Tree Controlled Grammars Properties
Kunštátský, Martin ; Čermák, Martin (referee) ; Koutný, Jiří (advisor)
Tree controlled grammars are grammars regulated by restriction placed on its derivation trees. It is simple and natural extension of context-free grammars. There are several types of derivation tree control, two principles are mentioned in this work: horizontal and vertical control. Application demonstrating tree controlled grammars properties, implemented in Python programming language, is also part of this work.
|
|
|
Script Language for Image Processing
Zuzaňák, Jiří ; Herout, Adam (referee) ; Zemčík, Pavel (advisor)
This thesis deals with design of scripting language, especially specified for effective image processing. Introduction of this thesis is focused on studying and also appropriation of methodology of compilers and interpreters design, include their following application in design of the scripting language and as well its interpreter. Another point of my work is showing the methods of design and implementation of the interpreter including automated methods used in the design of the implemented program. Next part deals with description of structure and implementation of the designed program, intended for generating compiler of any language which is described in input of this program. The conclusion of this work is more detailing description of the scripting language design; its implementation is based on the methods mentioned before.
|
|
|
Translation of ASP into ASP.NET
Vilímek, Jan ; Ryšavý, Ondřej (referee) ; Kašpárek, Tomáš (advisor)
The goal of this dissertation is to implement an application for ASP to ASPX conversion. The ASP pages should be written in the VBScript language, the target language for ASPX will be C#. The application is developed on the .NET platform. The conversion process should be automatic. There should be no need to alter the converted files by a programmer. The first part of this dissertation introduces the whole problematic. It shows also current solutions. The next part is the analysis and the design of the application itself. The main part of this dissertation is the VBScript grammar conversion, problems while conversion and its solving.
|
|
|
Structural Methods of Objects Identification for Industrial Robot Operation
Minařík, Martin ; Šlapal, Josef (referee) ; Konečný, Vladimír (referee) ; Šťastný, Jiří (advisor)
This PhD thesis deals with the use of structural methods of objects identification for industrial robots operation. First, the present state of knowledge in the field is described, i.e. the whole process of objects recognition with the aid of common methods of the syntactic analysis. The main disadvantage of these methods is that is impossible to recognize objects whose digitalized image is corrupted in some ways (due to excessive noise or image disturbances), objects are therefore deformed. Further, other methods for the recognition of deformed objects are described. These methods use structural description of objects for object recognition, i.e. methods which determine the distance between attribute descriptions of images. The core part of this PhD thesis begins in Chapter 5, where deformation grammars, capable of description of all possible object deformations, are described. The only complication in the analysis is the ambiguity of the deformation grammar, which lowers the effectiveness of the analysis. Further, PhD thesis deals with the selection and modification of a proper parser, which is able to analyze a deformation grammar effectively. Three parsers are described: the modified Earley parser, the modified Tomita parser and the modified hybrid LRE(k) parser. As for the modified Earley’s parser, ways of its effective implementation are described. One of the necessary parts of the object recognition is providing the invariances, which this PhD thesis covers in detail, too. Finally, the results of described algorithms are mentioned (successfulness and speed of deformed objects recognition) and suggested testing environment and implemented algorithms are described. In conclusion, all determined possibilities of deformation grammars and their results are summarized.
|
guest ::
