Course details

Compiler Construction (in English)

VYPa Acad. year 2023/2024 Winter semester 5 credits

This course discusses the construction of compilers in detail. This discussion concentrates on the following three topics: (I) Advanced topics of classical compilers: LR-table construction, general precedence analysis, general methods of syntax analysis, advanced methods of optimization. (II) Principles of parallel compilers: parallel compiler structure, fundamental methods of parallel syntax analysis, basic models of parallel translation. (III) Formal translation models and their properties: transducers, translation grammars, properties of syntax directed translation, formal language properties relevant to compilers, modern translation models.


Course coordinator

Language of instruction



Examination (written)

Time span

  • 39 hrs lectures
  • 13 hrs projects

Assessment points

  • 55 pts final exam (written part)
  • 15 pts mid-term test (written part)
  • 30 pts projects




Course Web Pages

Learning objectives

Thorough grasp of compiler construction, including modern parallel compiler construction. Deep familiarity with the theory behind the translation of programming languages.
Ability of an advanced compiler construction including parallel compiler. Deep familiarity with the theory and practice of programming language translation.
General knowledge of formal models for translation and their applications.

Why is the course taught

Maintaining a balance between a theoretical and practical approach to this important subject, VYPa represents a master-level class about compiler writing. From a theoretical viewpoint, it introduces mathematical models, such as automata and grammars, which underlie compilation and its phases. Based on these models, the class details the concepts, methods, and techniques employed in compiler design in a clear and easy-to-follow way.

From a practical point of view, the class describes how compilation techniques are implemented.  While discussing various compilation techniques, the class demonstrates their implementation in a step-by-step way. In addition, the class presents many detailed examples and computer programs to emphasize the applications of the compiler algorithms.

After taking this class, students should understand the compilation process, be able to write a real compiler, and easily follow advanced books on the subject.

Prerequisite knowledge and skills

Basic knowledge of discrete mathematics.

Study literature

  • D. Grune: Modern Compiler Design, 2nd edition. Springer, 2016.
  • R. Wilhelm, H. Seidl: Compiler Design: Virtual Machines. Springer, 2010.
  • C.L. Jeffery: Build Your Own Programming Language: A programmer's guide to designing compilers, interpreters, and DSLs for solving modern computing problems. Packt Publishing, 2021.
  • J. I. Moore: Introduction to Compiler Design: An Object-Oriented Approach Using Java, 2nd edition. SoftMoore Consulting, 2020.
  • D. Thain: Introduction to Compilers and Language Design, 2nd edition. Independently published, 2020.
  • T.Æ. Mogensen: Introduction to Compiler Design, 2nd edition. ‎ Springer, 2017.
  • D. Watson: A Practical Approach to Compiler Construction. Springer, 2017.
  • A. Meduna, P. Zemek: Regulated Grammars and Automata. Springer, 2014.

Fundamental literature

  • A. Meduna: Elements of Compiler Design. Taylor & Francis, 2008.
  • K.D. Cooper, L. Torczon: Engineering a Compiler, 3rd edition. Morgan Kaufmann, 2022.
  • A.V. Aho, M.S. Lam, R. Sethi, J.D. Ullman: Compilers: Principles, Techniques, and Tools, 2nd edition. Pearson Education, 2006.

Syllabus of lectures

  1. Introduction: compiler structure.
  2. Deterministic bottom-up syntax analysis: LR table construction.
  3. Deterministic bottom-up syntax analysis: general precedence analysis.
  4. General syntax analysis: important backtrack parsing methods.
  5. Advanced optimization.
  6. Parallel compilers: parallel compiler structure.
  7. Parallel syntax analysis: principles.
  8. Deterministic methods of parallel top-down syntax analysis.
  9. Deterministic methods of parallel bottom-up syntax analysis.
  10. Parallel code generation.
  11. Modern formal tools for language specification: regulated and parallel models.
  12. Formal tools for language translation: transducers and translation grammars.
  13. Expected future trends; summary; conclusion.

Syllabus - others, projects and individual work of students

  1. Making an advanced compiler.
  2. Preparation and presentation of a selected topic about compilers.

Progress assessment

  • Mid-term exam in written form - 15 points
  • Evaluated project(s) - 30 points
  • Final written examination - 55 points

In case of illness or another serious obstacle, the student should inform the faculty about that and subsequently provide the evidence of such an obstacle. Then, it can be taken into account within evaluation:

  • The student can ask the responsible teacher to extend the time for the project assignment.
  • If a student cannot attend the mid-term exam, (s)he can ask to derive points from the evaluation of his/her first attempt of the final exam.
  • If a student cannot attend the defense of the project and the other team members agree with that (s)he can earn the same points from the project defence as for present members.


Mon exam 2024-01-15 G202 11:0012:50 VYPa: Second Term
Mon exam 2024-01-29 E104 11:0012:50 VYPa: Third termín
Tue exam 2024-01-02 E104 16:0017:50 VYPa: First Term
Thu exam 2023-11-23 M103 M104 M105 11:0013:00 VYPa: Midterm test
Thu lecture 1., 3., 4., 6., 7., 8., 9., 11., 12., 13. of lectures M104 M105 11:0013:5041 1EIT 1MIT 2EIT 2MIT INTE MITP-EN NMAT xx Meduna
Thu lecture 5., 10. of lectures M104 M105 11:0013:5041 1EIT 1MIT 2EIT 2MIT INTE MITP-EN NMAT xx Křivka
Thu other 2023-12-14 M104 M105 14:0014:5041 1MIT 2EIT 2MIT INTE MGMe xx Křivka Presentation Project - Oral presentation
Thu exam 2023-12-14 M103 17:0018:50 VYPa: Early Term

Course inclusion in study plans

Back to top