Programming Languages and Compilers
- Enrollement in the course requires an assessment of the following courses:
- Automata and Grammars (BIE-AAG)
- Jan Janoušek (guarantor)
- Jan Janoušek (guarantor), Tomáš Pecka, Štěpán Plachý
- Department of Theoretical Computer Science
Students master basic methods of implementation of common high-level programming languages. They get experience with the design and implementation of individual compiler parts for a simple programming language: data types, subroutines, and data abstractions. Students are able to formally specify a translation of a text that has a certain syntax into a target form and write a compiler based on such a specification. The notion of compiler in this context is not limited to compilers of programming languages, but extends to all other programs for parsing and processing text in a language defined by a LL(1) grammar.
Knowledge of algorithmics, programming in a high-level language, grammars.
- Syllabus of lectures:
1. Overview of programming languages, programming paradigms. Compiler structure, virtual machine.
2. Design and implementation of a lexer (lexical analyser).
3. LL(1) grammars, context-free to LL(1) transformation.
4. Implementation of syntax parsing by recursive descent.
5. Translation grammars, pushdown translation automata.
6. Attribute translation grammars.
7. Internal forms of programs, compiling and evaluating expressions.
8. Compiling to a language of a stack machine.
9. Compiling to a syntax tree.
10. Specification and implementation of data types.
11. Compiling typical language constructs.
12. Specification and implementation of subroutines.
13. Specification and implementation of data abstractions.
- Syllabus of tutorials:
1. Lexer design and implementation.
2. Parser implementation using recursive descent.
3. Attribute translation grammars.
4. Compiling to a language of a stack machine.
5. Compiling to a syntax tree.
6.  Project consultations.
- Study Objective:
The module contains an overview of generic aspects of programming languages and explanation of basic methods of their implementation. Design and program realization are supported with the basic theory of grammars and automatons. For illustration purposes, a simple programming language is defined and its compiler is designed and implemented. There are also explained basic methods of implementation of data types, subroutines and data abstrations.
- Study materials:
1. Grune, D., Bal, H., Jacobs, C., Langendoen, K. ''Modern Compiler Design''. Wiley, 2000. ISBN 0471976970.
- Further information:
- No time-table has been prepared for this course
- The course is a part of the following study plans:
- Bachelor branch Security and Information Technology, in English, 2015-2020 (elective course)
- Bachelor branch Web and Software Engineering, spec. Software Engineering, in English, 2015-2020 (elective course)
- Bachelor branch Computer Science, in English, 2015-2020 (compulsory course of the specialization)
- Bachelor specialization, Computer Engineering, 2021 (compulsory elective course, elective course)
- Bachelor specialization, Information Security, 2021 (elective course)
- Bachelor specialization, Software Engineering, 2021 (elective course)
- Bachelor specialization Computer Systems and Virtualization, 2021 (elective course)
- Bachelor branch Computer Science, in English, 2015-2020 original version (compulsory course of the specialization)