|
|
Novel Methods of Control Systems Design with MATLAB/Simulink
Válek, Vít ; Kozovský, Matúš (referee) ; Blaha, Petr (advisor)
The content of this thesis is to introduce the tools of MATLAB/Simulink, which allow to generate the source code in C language. It will be demonstrated how to combine the source code written in C with Simulink model and MATLAB code. The code will be generated for the selected functions and compared with RTCESL library functions. In the last part of this thesis the principle of FOC will be briefly described. For a simplified loop of FOC, the code will be generated and then compared with handwritten code. For comparison, the microcontroller KV46F256 from NXP Semiconductors is used.
|
|
|
Information System Generator
Falhar, Radek ; Hanáček, Petr (referee) ; Jurnečka, Peter (advisor)
Goal of this work is to design and implement too for passive code generation for specific information system framework. This framework is ZeroFramework that is targeted at client-server development of applications running on .NET platform. For code generation, T4 Scaffolding library is used, which allows to divide code generation logic into separate parts (scaffolders). This work is mainly concerned with design and implementation of those scaffolders and their linking with T4Scaffolding library. Results of this work are templates and logic for generation of files and classes, which implement logic needed for display, adding, modification and deletion of specific database entity.
|
|
|
C Compiler in Python
Fiedor, Tomáš ; Bidlo, Michal (referee) ; Vašíček, Zdeněk (advisor)
There is currently no big link between creation of compilers and processor design and their instruction sets in courses. The goal of this work is to create easily extensible and modular compiler, which will enable experiments with instruction sets of used target processor. Compiler implements several optimization techniques. Their impact is more closely discussed. One of the advanced used techniques is context generation of output code. This technique generates less code than common blind generation.
|
|
|
Octave to C++ Source-to-Source Compiler
Ševčík, Václav ; Křivka, Zbyněk (referee) ; Kolář, Martin (advisor)
It is difficult to use programs developed in the interactive programming environment Matlab for low-memory devices and for integration into projects without the language support. Therefore, the programs are converted into C++. In practice, manual transfer is used which significantly prolongs the time of the developing program. The work focuses on the automation of translation from Octave/Matlab to C++ using the Eigen library to enable matrix and vector operations. The translator allows 39 basic operations and 13 functions of the Octave language. Experiments show that this translation will reduce memory requirements of up to 99%
|
|
|
Generated Peephole Optimizations in LLVM Compiler
Melo, Stanislav ; Podivínský, Jakub (referee) ; Hruška, Tomáš (advisor)
One of the important feature of application specific processors is performance. To maximize it, the compiler must adapt to needs of processor that it is going to compile for and it must generate the most efficient code. One of the ways to do that is to search for appropriate instructions that can be implemented as one instruction with multiple outputs. Afterwards the generated code can be parsed through peephole optimizations that search for instruction patterns and replace them with other instructions to make code more effective. This paper describes the problem of finding and selecting suitable candidates for multiple output instructions. It also provides a brief overview of the few best known algorithms that solve this problem. Eventually it examines possibilities of incorporating this optimizations to LLVM compiler.
|
|
| |
|
|
Demonstration Program of Convertion of Finite Automata
Štorek, Vojtěch ; Novotný, Tomáš (referee) ; Lukáš, Roman (advisor)
The main goal of practical part of this work is to create a program, which applies finite automata theory in practice and makes this theory easier to understand. Program is capable to easily create finite automata and make didactic demostration of basic theoretical knowledges such as coversion to special types of finite automata, function illustration or representation of finite automata in form of C language source code. In this technical report I will try to describe, how are individual key parts of the application implemented.
|
|
|
Code Generation from Object Oriented Petri Nets
Hanák, Martin ; Janoušek, Vladimír (referee) ; Kočí, Radek (advisor)
This thesis describes opinions about generating code from PNtalk language into more standard object orinted languages, such as C++ or Java. Goal is to construct model of the formalism of Object Oriented Petri Nets (OOPN), represented in PNtalk languege in mentioned languages. This model should be simlpier and more effective than actual implementation in Smalltalk language. Thesis also contains ideas about abstactization the code generator to be able to generate code in various languages.
|
|
|
Generating Code from Textual Description of Functionality
Šamánek, Jan ; Fajčík, Martin (referee) ; Smrž, Pavel (advisor)
S pokračujícím nástupem strojového učení a stále větších modelů neuronových sítí, roste i potřeba GPU akcelerovaných zdrojů a algoritmů pro podporu těchto modelů. Vzhledem k tomu, že velké jazykové modely jsou již dnes využívány jako asistenti při programování v moderních programovacích jazycích, mohli by s tímto problémem pomoci. Pokud se tyto modely dokáží naučit i méně známá paradigmata, jako je CUDA, mohly by pomoci s vývojem a udržování těchto systémů. Tato práce zkoumá schopnosti moderních jazykových modelů pro učení se CUDA jako programovacího paradigmatu a také vytvoření nové trenovací sady, určené pro tyto účely.
|
|
|
Pattern matching in compilers
Bílka, Ondřej ; Hubička, Jan (advisor) ; Mareš, Martin (referee)
Title: Pattern matching in compilers Author: Ondřej Bílka Department: Department of Applied Mathematics Supervisor: Jan Hubička, Department of Applied Mathematics Abstract: In this thesis we develop tools for effective and flexible pattern matching. We introduce a new pattern matching system called amethyst. Amethyst is not only a generator of parsers of programming languages, but can also serve as an alternative to tools for matching regular expressions. Our framework also produces dynamic parsers. Its intended use is in the context of IDE (accurate syntax highlighting and error detection on the fly). Amethyst offers pattern matching of general data structures. This makes it a useful tool for implement- ing compiler optimizations such as constant folding, instruction scheduling, and dataflow analysis in general. The parsers produced are essentially top-down parsers. Linear time complexity is obtained by introducing the novel notion of structured grammars and reg- ularized regular expressions. Amethyst uses techniques known from compiler optimizations to produce effective parsers. Keywords: Packrat parsing, dynamic parsing, structured grammars, functional programming 1
|
guest ::
