|
|
Detection and Error Recovery for Syntactic Analysis
Sák, Vladimír ; Dolíhal, Luděk (referee) ; Zámečníková, Eva (advisor)
Bachelor's thesis deals with error detection and recovery for syntactic analysis. The main goal of work was to design and implement a method for error detection and recovery. The proposed method is based on the Hartmann method for error detection and error recovery. The user interface, using cross-platform framework Qt was also implemented. As a result, the application prints all of the information about errors while parsing the source code.
|
|
|
Parsing Based on Tree-Controled Grammars
Granát, Štěpán ; Martiško, Jakub (referee) ; Meduna, Alexandr (advisor)
The goal of this thesis is to design and implement the parser of grammars, whose derivation tree is limited by inspection of levels. Common parsing procedures are studied in detail and then it is discussed, how they could be extended by inspection of derivation tree. The most important part of the thesis is a draft of continuous inspection of the derivation tree simultaneously with its construction, which allows close cooperation between these two processes. This approach enables significant increasing of the parser power.
|
|
|
New Versions of Jumping Automata
Ošmera, Lubomír ; Kocman, Radim (referee) ; Meduna, Alexandr (advisor)
The main goal of this thesis is introduction and investigation of extended version of jumping automata. These versions are specified by strictly size and direction of jump. This thesis examine their power and perform comparison with other automata types. Also there are shown equivalent grammar models. Main motivation for this thesis are research and effort to improve some features of general jumping finite automata. This work consider using this automata types for specific language families and syntactic analysis process.
|
|
|
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.
|
|
|
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.
|
|
|
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.
|
|
|
Jumping Language Models
Ošmera, Lubomír ; Kocman, Radim (referee) ; Meduna, Alexandr (advisor)
The main goal of this master thesis is introduction and investigation of extended version of jumping automata and grammars. New versions are primarily focused on bioinformatic applications - DNA computing. This thesis examine their power and other properties of new models and makes comparison with existing computer science models. Then thesis demontrates practical applications, specifically amino acid and protein detections inside DNA sequence and makes comparision with existing tools in DNA computing for example Mark´s probabilistic models.
|
|
|
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.
|
|
|
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.
|
|
|
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.
|
guest ::
