|
Compiler generator based on restarting automata
Procházka, Jan ; Plátek, Martin (referee) ; Mráz, František (advisor)
Restarting automata, in their most general form, represent a very strong theoretical model recognizing much wider class of languages than the class of context-free ones. Hence, our goal was to design a tool which for a given restarting automaton (in human-readable format) generates a program computing the meaning of an input text. In order to enable that, this thesis extends the model of restarting automata by adding semantics to its meta-instruction. The resulting program is a compiler-compiler (CCRA) inspired by the tools such as flex or bison. However, the CCRA uses restarting automaton instead of a context-free grammar. The implementation as well as the output are realized in C++ which ensures the compatibility with both Windows and Linux systems.
|
|
Visualization in vector spaces
Klímek, Jakub ; Hladík, Milan (referee) ; Fiala, Jiří (advisor)
The goal was to create a set of Java applets, which would serve as an addition to the teaching of Linear algebra. These applets make possible to compute with rational numbers, real numbers, complex numbers and Zp - integers modulo prime p using addition, subtraction, multiplication and division. It is also possible to compute with vectors of elements of those spaces using addition and subtraction of vectors and multiplication and division by scalar. In addition, the vector calculator can figure coordinates of a vector, determine a linearly independent subset of vectors and, when in standard scalar product space, figure an orthogonal projection onto a subspace generated by a set of vectors. The advantage of these applets is their ease of use simulating a classical handheld calculator.
|
guest ::
