|
|
Combined Parsing Based on Several Methods
Dolíhal, Luděk ; Masopust, Tomáš (referee) ; Meduna, Alexandr (advisor)
The main goal of this work is to analyze the creation of the composite parser. Composite syntactic parser is in this case a parser, which consists of more cooperating parts. In my case two parts. The work is focused on the construction of the parsers parts, on its cooperation and comunication. 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.
|
|
|
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.
|
|
|
Application of OLAP in an e-Shop
Lysý, Jan ; Dolíhal, Luděk (referee) ; Jirák, Ota (advisor)
The aim of this thesis is to design an e-shop that uses OLAP database. Multidimensional scheme was assembled for the database. Using Business Intelligence tool that is part of SQL Server 2008 Enterprise the database was realized according to the scheme. Data from the OLAP system are accessible through administrator interface implemented with ASP.NET in the form of graph or table.
|
|
|
Modification of a Syntax Analysis
Macek, Roman ; Jirák, Ota (referee) ; Dolíhal, Luděk (advisor)
Bachelor's thesis deals with modification of syntax analysis, specifically method called recursive descent. The main goal of this work is to increase the power of this method. The improvement is designed in order the method is able to analyse ambiguous grammars. In the project, there is also designed a language and its grammar. On the basis of the grammar, implementation of the demonstration application is done. Application does lexical and syntax analysis of the given source code and the output are several lists of rules which can be used to parse the input.
|
|
|
Scriptable Fight System for Turn-Based Computer Game
Kanich, Ondřej ; Dolíhal, Luděk (referee) ; Husár, Adam (advisor)
This bachelor's thesis deals with creation of fight system and artificial intelligence for it. The goal of this project is to give an opportunity for low-experienced programmers to design and implement their own artificial intelligence. The Project DrdSim is used as a platform for this thesis. Extended fight system of the Dragon's lair (Czech version of D&D) is employed as a model for created system. Artificial intelligence is implemented by DSL, special language of DrdSim platform. An approach of reactive agents is used for artificial intelligence.
|
|
|
Compiler for EdkDSP Platform
Baručák, Robert ; Dolíhal, Luděk (referee) ; Masařík, Karel (advisor)
Goal of this bachelor's thesis was to create a compiler system for EdkDSP platform. Two different approaches to construction of compiler system for multiprocessor platform are presented. Compiler is based on LLVM compiler infrastructure. As a result, two versions of compiler system utilising hardware capabilities of EdkDSP were created. Developed solutions have a few constraints which are discussed in this paper.
|
|
|
Software Execution Acceleration Using Automatic Instruction Set Extensions
Melo, Stanislav ; Dolíhal, Luděk (referee) ; Masařík, Karel (advisor)
One of the important feature of application specific processors is performance. To maximize it, the processor must adapt to needs of application that it is going to perform. One of the ways to do that is to search for appropriate instructions that can be joined into one special instruction. This instruction is then implemented in hardware as a single function block. This bachelor's thesis describes problem of finding and selecting suitable candidates for instruction-set extension. It also provides brief overview of the few best known algorithms that solve this problem. Moreover the thesis deals with the single-cut algorithm and its implementation in more detail.
|
|
|
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.
|
|
|
Retargetable Source-Level Debugger
Korvas, Pavol ; Dolíhal, Luděk (referee) ; Křoustek, Jakub (advisor)
This mater's thesis deals with introducing principles of debugging and debuggers. The thesis examines in detail format of debugging information and it describes the design of debugger created within the project Lissom. Furthermore, the thesis also contains implementation of each designed part, which the debugger consists of. Last part of this thesis deals with testing of the implemented solution with two types of processor architectures and it also contains the conclusion of the results.
|
|
|
Instruction Set Completness Detection for Retargetable C Compiler Generation
Nagy, Michal ; Dolíhal, Luděk (referee) ; Hruška, Tomáš (advisor)
This thesis concerns the issue of completness detection of instruction set description for the LLVM compiler, or the ability of a compiler to generate target program for every valid source program in the appropriate high-level programming language. On the basis of regular tree grammar theory and several scietific theses that also concern this issue, formal tool for inclusion checking of two grammars. Furthermore a method for automatic extraction of the two grammars from the instruction set description has been devised, as a result of which the tool can be used for checking completeness of instruction selection. In combination with checking completeness of the legalization process of the LLVM compiler, which preceeds the instruction selection, it should be feaseable to check completeness of most compiler parts dependent on the target architecture.
|
guest ::
