Bachelor theses
Web user interface for project Grades
Author
Marek Mouček
Year
2019
Type
Bachelor thesis
Supervisor
Ing. Štěpán Plachý
Reviewers
Ing. David Bernhauer
Department
Summary
This bachelor thesis deals with redisign and rewrite of the Grades web application (frontend) into latest technologies with support of offline functionality and optimalizations for mobile devices screen. The new web application communicates with the existing Grades API. It allows students to view all classifications of their subjects. It also allows teachers to assess students. The application is programmed in the Angular framework and the architecture is chosen to be as modular and maintainable as possible.
Range restriction of expression in AST from a domain of variables
Author
Jan Pokorný
Year
2020
Type
Bachelor thesis
Supervisor
Ing. Štěpán Plachý
Reviewers
doc. Ing. Jan Janoušek, Ph.D.
Department
Summary
Aim of this bachelor thesis is to restrict possible values of an expression represented by abstract syntax tree and based on restrictions of input variables. Expressions can contain values of different data types. This thesis introduces abstract syntax tree traversal, which results contain all values that could be acquired by evaluating expression with any of the variable values satisfying restrictions. The thesis discusses necessary data structures and the evaluation of selected functions. Designed traversal is implemented in expression evaluator in electronic classification application Grades, which supports data types number, string, and boolean. The extension of the expression evaluator will enable the addition of functionality to the Grades application for the identification of all possible classifications in individual subjects and also for the automated verification of the subject definition.
Implementation of parallel algorithm for run of k-local tree automata
Author
Milan Borový
Year
2021
Type
Bachelor thesis
Supervisor
Ing. Štěpán Plachý
Reviewers
Ing. Claudio Kozický
Department
Summary
This thesis deals with k-local deterministic finite tree automata (DFTA) which are important for tree pattern matching. There exists a work-optimal parallel algorithm for a run of k-local DFTA on EREW PRAM. This algorithm will be implemented, experimentally measured and compared with the sequential algorithm in this thesis.
Design of templating language and implementation of compiler
Author
Adam Plodek
Year
2022
Type
Bachelor thesis
Supervisor
Ing. Štěpán Plachý
Reviewers
Ing. Jakub Jirůtka
Department
Summary
Goals of my thesis are design and implementation of templating language, for creating HTML
templates, which focuses on support for functional programing, which could improve properties
of templating languages. Essential features of designed language are support for higher order
functions, anonymous functions and strong typing system. For templating language was created
formal grammar and implementation of compiler was done in Haskell programing language.
Compiler of kontrol language into SQL
Author
Otto Šleger
Year
2024
Type
Bachelor thesis
Supervisor
Ing. Štěpán Plachý
Reviewers
Ing. Tomáš Pecka
Department
Summary
This bachelor thesis deals with the analysis, design and implementation of compiler for control
language designed by the Czech National Bank. This compiler allows the translation of the
control language into the SQL language, which can then be run directly over the database server
where the data that the control language validates is located. Within the scope of this work, an
analysis of the individual parts of this language and their possibilities for compilation for several
types of relational databases is performed. A concrete proposal of the structure of the compiler
and its individual parts is developed, based on which the compiler is implemented using PHP
programing language.
Parsing of General Expressions and Describing Programming Language Syntax using Expressions
Author
Aleksandr Levin
Year
2024
Type
Bachelor thesis
Supervisor
Ing. Štěpán Plachý
Reviewers
Ing. Tomáš Pecka
Department
Summary
This thesis provides an LL(1) parser for general expressions. Given correct operator priority table, the parser is able to parse given input string and, if successful, provide AST representation of the input. The thesis also provides Pascal syntax grammar in the form of operators priority table to discuss and develop the idea of describing programming language syntax using expressions. The thesis is supported by a number of Pascal code examples, processed by the developed parser, used together with the provided syntax table.
Master theses
Paralelní běh k-lokálních stromových automatů na GPU
Author
Milan Borový
Year
2024
Type
Master thesis
Supervisor
Ing. Štěpán Plachý
Reviewers
doc. Ing. Ivan Šimeček, Ph.D.
Department
Summary
Tato práce implementuje vyhledávání vzorů ve stromech za použití
deterministických konečných stromových automatů. Existuje popis a implementace pracovně
optimálního algoritmu pro EREW PRAM. Tento algoritmus bude optimalizován pro APRAM a portován
na SIMT. Poté budou tyto dvě nové implementace experimentálně změřeny a porovnány.