Compiler Construction (in English)
VYPa Acad. year 2020/2021 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.
Language of instruction
Course Web Pages
Subject specific learning outcomes and competences
Ability of an advanced compiler construction including parallel compiler. Deep familiarity with the theory and practice of programming language translation.
Generic learning outcomes and competences
General knowledge of formal models for translation and their applications.
Thorough grasp of compiler construction, including modern parallel compiler construction. Deep familiarity with the theory behind the translation of programming languages.
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 kwnowledge and skills
Basic knowledge of discrete mathematics.
- Češka, M., Ježek, K., Melichar, B., Richta, K.: Konstrukce překladačů, Praha, CZ, ČVUT, 1999, 636 p., ISBN 80-01-02028-2 (in Czech)
- Grune, D.: Modern Compiler Design, 2nd Edition, Springer, 2016, 846 p., ISBN 9781493944729
- Cooper, K.D.: Engineering a Compiler, San Francisco, Morgan Kaufmann, 2004, 879 p., ISBN 155860698X
- Wilhelm, R., Seidl, H.: Compiler Design: Virtual Machines, Springer, 2010, 187 p., ISBN 978-3-642-14908-5
Syllabus of lectures
- Introduction: compiler structure.
- Deterministic bottom-up syntax analysis: LR table construction.
- Deterministic bottom-up syntax analysis: general precedence analysis.
- General syntax analysis: important backtrack parsing methods.
- Advanced optimization.
- Parallel compilers: parallel compiler structure.
- Parallel syntax analysis: principles.
- Deterministic methods of parallel top-down syntax analysis.
- Deterministic methods of parallel bottom-up syntax analysis.
- Parallel code generation.
- Modern formal tools for language specification: regulated and parallel models.
- Formal tools for language translation: transducers and translation grammars.
- Expected future trends; summary; conclusion.
Syllabus - others, projects and individual work of students
- Making an advanced compiler.
- Preparation and presentation of a selected topic about compilers.
- Mid-term written examination - 15 point
- 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||lecture||lectures||A112||11:00||13:50||1EIT 1MIT 2EIT 2MIT INTE||NMAT xx|
|Mon||lecture||3., 4., 5., 6., 7., 8., 9., 10., 11., 12. of lectures||A112v||11:00||13:50||YT, ZP|
|Mon||exam||2021-01-04||A112||14:00||15:50||1EIT 1MIT 2EIT 2MIT INTE||1st term|
|Wed||exam||2021-01-20||E112||09:00||10:50||1EIT 1MIT 2EIT 2MIT INTE||2nd term|
|Wed||exam||2021-01-27||E105||09:00||10:50||1EIT 1MIT 2EIT 2MIT INTE||3rd term|
Course inclusion in study plans
- Programme IT-MSC-2, field MBI, MBS, MGM, MIN, MMI, MPV, MSK, any year of study, Elective
- Programme IT-MSC-2, field MGMe, any year of study, Compulsory-Elective group I
- Programme IT-MSC-2, field MIS, any year of study, Compulsory-Elective group F
- Programme IT-MSC-2, field MMM, any year of study, Compulsory
- Programme MITAI, specialisation NADE, NBIO, NCPS, NEMB, NGRI, NHPC, NIDE, NISD, NISY, NMAL, NNET, NSEC, NSEN, NSPE, NVER, NVIZ, any year of study, Elective
- Programme MITAI, specialisation NMAT, any year of study, Compulsory