|
|
Languages and Compilers in Computer Games
Hranáč, Jan ; Zuzaňák, Jiří (referee) ; Zemčík, Pavel (advisor)
This project deals with usage of programming languages and compilers in computer games. Purpose of this project is to give young people motivation for programming, which isn't always done by usual work in Pascal at high school. This idea was applied on a developed computer game with has a few integrated languages which can be used for creation of the game's content (adventures, campaigns and objects in them). This computer game was based on a RPG desk game Dragon's Lair (a Czech equivalent of D&D) from ALTAR(TM) publishing company.
|
|
|
Automated Methods of Finding Bugs in Compilers
Müller, Petr ; Smrčka, Aleš (referee) ; Vojnar, Tomáš (advisor)
This thesis discusses an application of the fuzz testing method for testing compilers and interpreters. In the first part, it deals with compilers, optimizations, and bugs typical for an optimizing compiler. It analyzes applicability of static and dynamic analysis methods for searching such bugs and proposes dynamic fuzz testing as suitable for this task. A compiler testing tool suite using this method was implemented within this thesis and applied on several real compilers, including GCC, in which the tool revealed a series of bugs.
|
|
|
Translation Grammars: Properties and Applications
Vít, Radek ; Krčmář, Radim (referee) ; Meduna, Alexandr (advisor)
The goal of this thesis is to discuss translation grammars and their use in syntax-driven translation. It provides an example of the use of translation grammars in predictive top-down translation and provides formal devices for language accepting and translation output generation. It examines the descriptional complexity of tranlation grammars as language generating devices. An implementation of a translation framework using these devices is described and a simple compiler is designed and implemented using this framework. This compiler translates a new language REON designed in this paper to Python 3.
|
|
| |
|
|
Online machine translation of technical texts
Juřík, Michal ; Smutný, Milan (referee) ; Šťastná, Dagmar (advisor)
This bachelor thesis discusses and then tests the methods of evaluating two machine translators, namely from Google and Microsoft. Based on established criteria, from data received each translator is assigned their error rate. When evaluating translators, the work focuses not only on whether the translator was able to translate a set of texts correctly (spelling, stylistics), but also whether the professional terminology together with the idea behind the sentence corresponds to the original text. In conclusion, the obtained error rate data enable to assess the given translators for suitability in terms of their usage.
|
|
|
Online machine translation of technical texts
Juřík, Michal ; Smutný, Milan (referee) ; Šťastná, Dagmar (advisor)
This bachelor thesis discusses and then tests the methods of evaluating two machine translators, namely from Google and Microsoft. Based on established criteria, from data received each translator is assigned their error rate. When evaluating translators, the work focuses not only on whether the translator was able to translate a set of texts correctly (spelling, stylistics), but also whether the professional terminology together with the idea behind the sentence corresponds to the original text. In conclusion, the obtained error rate data enable to assess the given translators for suitability in terms of their usage.
|
|
|
Systems of Transducers: Definition, Properties, and Applications
Řezáč, Michal ; Kövári, Adam (referee) ; Meduna, Alexandr (advisor)
Currently, finite and pushdown automata are used to describe programming language compilers as two separate parts. This thesis aims to define a system of transducers that allows to describe a compiler by one aggregate system, instead of two independent transducers. The system of transducers presented in this paper is based on finite and pushdown transducers. It is a simple model without internal communication. Because of this property, it is not suitable for compiler formalization but because of its simplicity, the system is easily extensible with new features and can thus serve as a basis for further research.
|
|
|
Type inference and polymorphism for C
Klepl, Jiří ; Kratochvíl, Miroslav (advisor) ; Šefl, Vít (referee)
The C language, despite its age, is one of the main languages in systems development. It is valued for giving the user almost complete control over the memory management and the computations the program written in it performs. However, a large portion of criticism of C arises from the lack of generic programming features. C compensates that by utilizing preprocessor macros, which are prone to user errors. This problem has been addressed in the early stages of the development of the C++ language, but many systems developers refuse C++ because of its complexity and non-transparency of the code. We propose a simpler solution by applying the Hindley-Milner type sys- tem extended by Haskell type classes and type constructors. We will show that this approach is viable even with minimal changes to the syntax of C, but giving it much higher expressiveness. 1
|
|
|
Prekladač jednoduchých algoritmov
Gonšenicová, Patrícia
The main goal of this bachelor thesis is to create web application, which will be used for transformation of simple algorithms written in Pascal to another pro-gramming language. Purpose of this application is to improve learning process of course Algorithm Development, taught at Faculty of Business and Economics on Mendel University in Brno. Translation is implemented using lexer and parser generated by ANTLR from Pascal grammar. To complete transformation of the code, is applied Listener. Thesis is describing all parts of application development, such as theoretical basics, analysis of solution and existing alternatives of application, design and implementation, and testing of the application.
|
|
|
Decompilation of Specialized and Advanced Instruction Sets
Holub, Juraj ; Kolář, Dušan (referee) ; Křivka, Zbyněk (advisor)
V dnešnej dobe je proces analýzy nebezpečného softvéru dôležitou súčasťou informačných technológií. Jedna z kľúčových techník je spätný preklad škodlivých binárnych programov. Spätný preklad je komplexný proces, ktorý rieši niekoľko projektov. Projekt RetDec sa zameriava na flexibilný návrh a riešenie spätného prekladača s možnosťou znovupoužiteľnosti. Cieľom tejto práce je zlepšenie spätného prekladu pokročilých inštrukčných sád pre architektúru x86. Bola navrhnutá nová optimalizácia pre FPU registrový zásobník. Bola rozšírená podpora prekladu inštrukčných sád jednotiek FPU a SSE. Nové rozšírenia boli implementované a otestované z hľadiska efektivity a kvality spätného prekladu.
|
guest ::
