|
|
Multiple Document Type Diff
Zemko, Michal ; Mlích, Jozef (referee) ; Chmelař, Petr (advisor)
This thesis deals with comparing different types of files, especially source codes. It describes the problem of comparing source code and different ways of solving this problem, from simple line comparison, to AST comparison. Chosen method was comparison based on lexical analysis. This is also described in the work with instruments of its automation. The goal of this thesis is to design and implement modular application, which compares different types of files. The implemented module compares source code in programming languages C/C++, Java a Python. This module is easily extendable for comparisons with other languages.
|
|
|
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.
|
|
|
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.
|
|
|
General System for Testing of Interprets
Drahošová, Michaela ; Koutný, Jiří (referee) ; Lukáš, Roman (advisor)
This work deals with concept and implementation of General system for testing of interprets. Testing of interprets is based on the principle of comparation of results of the interpretation carried out by the testing with reference results. The set of testing programmes is acquired by translating testing programmes, in the reference language to programmes in the language of tested interpret. The testing system enables generation of a testing set of programmes for an interpret according input and reference result after a preceding analysis of a file consisting of description of the syntax and semantics of the interpret's language. These actions result is translation of a more complex programming language to another.
|
|
|
Parsing Based on Several Methods
Dolíhal, Luděk ; Goldefus, Filip (referee) ; Meduna, Alexandr (advisor)
p, li { white-space: pre-wrap; } The main goal of this work is to analyze the creation of the composite compiler. Composite compiler is in this case a szstem, which consists of more cooperating parts. My compiler is special, because its syntactic analyser consists of two parts. The work is focused on the construction of the parsers parts, on its cooperation and comunication. I will trys to scatch the teoretical backgroun of this solution. This is to be done by gramatical systems. Then I~will try to justify whether or not it is neccesary and suitable to create such a kind of parser. Last but not least I~will analyse the language, whose syntactic analyser is to be implemented by the chosen method.
|
|
|
C Language Interactive Interpreter
Blažek, Martin ; Peringer, Petr (referee) ; Martinek, David (advisor)
This master's thesis deals with implementation of ISO C99 language interpreter. The goal of this thesis is to provide support of education in C language programming and fast algorithm prototyping. It enables students to create own C programs and to experiment with language constructions without compiling. User interface includes editor and simple debugger. The interpreter is implemented in a novel grammar development environment written in Java language - ANTLRWorks which includes ANTLR language tool.
|
|
|
Multi-Level Automata and Their Applications
Pšenák, Kamil ; Tomko, Martin (referee) ; Meduna, Alexandr (advisor)
In this thesis, we will add to already known fnite automata paradigm. We start with basic defnitions used in theoretical informatics. Afterwards we defne multi-level fnite automata, which is the base of this thesis. Then we move on to the compilation process and construction of a compiler. With that we defne lexical analysis as our example for multi-level fnite automata implementation. Once we implement the concept, we compare the new and the old way. Then we dig deeper into theoretical informatics to defne parallel right-linear grammars and languages. To prove a concept we create another concept with implementation strategy, using multi-level framework. Lastly, we mention some other areas in informatics, where this multi-level concept could be useful.
|
|
|
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.
|
|
|
Advanced Parser Generators
Havranek, Daniel ; Kövári, Adam (referee) ; Křivka, Zbyněk (advisor)
This bachelor thesis deals with parser generation by tools that use advanced parsing techniques. These techniques are compared from both theoretical and practical point of view. The GNU Bison tool, which uses the LALR(1) method and Generalized LR method, and the ANTLR tool, which uses the more modern ALL(*) method, are examined in detail. To compare the effectiveness of these tools, a parser for a fictional programming language is implemented using them to demonstrate the strengths and weaknesses of each approach. As the results, GNU Bison is much more powerful, but the ANTLR outweighs it in terms of implementation friendliness and functionality. The results of this thesis can help deciding which approach or tool to choose when implementing a parser.
|
|
|
Blender Add-on for Generation of 3D Mathematical Equations
Strenková, Katarína ; Milet, Tomáš (referee) ; Chlubna, Tomáš (advisor)
This bachelor's thesis aims to create a Blender add-on, which makes the creation of 3D mathematical equations easier for users. Unlike alternative solutions, equations consist of individual editable text objects. The input data are entered in the mathematical notation of the Latex language. They are later analyzed using lexical and syntax analysis. When no faults are found, the specified mathematical equation is generated in a 3D environment. The final add-on is functional with the support of main Latex commands and is intended for public use.
|
guest ::
