Main page | Study Branches/Specializations | Groups of Courses | All Courses | Roles                Instructions

A course is the basic teaching unit, it's design as a medium for a student to acquire comprehensive knowledge and skills indispensable in the given field. A course guarantor is responsible for the factual content of the course.
For each course, there is a department responsible for the course organisation. A person responsible for timetabling for a given department sets a time schedule of teaching and for each class, s/he assigns an instructor and/or an examiner.
Expected time consumption of the course is expressed by a course attribute extent of teaching. For example, extent = 2 +2 indicates two teaching hours of lectures and two teaching hours of seminar (lab) per week.
At the end of each semester, the course instructor has to evaluate the extent to which a student has acquired the expected knowledge and skills. The type of this evaluation is indicated by the attribute completion. So, a course can be completed by just an assessment ('pouze zápočet'), by a graded assessment ('klasifikovaný zápočet'), or by just an examination ('pouze zkouška') or by an assessment and examination ('zápočet a zkouška') .
The difficulty of a given course is evaluated by the amount of ECTS credits.
The course is in session (cf. teaching is going on) during a semester. Each course is offered either in the winter ('zimní') or summer ('letní') semester of an academic year. Exceptionally, a course might be offered in both semesters.
The subject matter of a course is described in various texts.

BIE-PJP.21 Programming Languages and Compilers Extent of teaching: 2P+1C
Instructor: Janoušek J. Completion: Z,ZK
Department: 18101 Credits: 5 Semester: L

Annotation:
Students learn basic compiling methods of programming languages. They are introduced to intermediate representations used in current compilers GNU and LLVM. They learn to create a specification of a translation of a text that conforms a given syntax, to a target code and also to create a compiler based on the specification. The compiler can translate not only a programming language but any text in a language generated by a given LL input grammar.

Lecture syllabus:
1. Structure of a compiler, lexical analysis.
2. Deterministic top-down parsing: LL parsing.
3. [2] Implementing LL parsing, properties of LL grammars.
5. Transformations to LL(1) grammars, error recovery during LL parsing.
6. Formalisms for syntax-directed translation and semantics: translation and attributed grammar.
7. One-pass attributed translation directed by LL parsing, L-attributed grammars, examples of simple translations.
8. Data structures of a compiler, intermediate representations.
9. Abstract syntax tree, three address code - intermediate representations of GNU compiler.
10. Intermediate representations of the LLVM compiler.
11. An example of a simple compiler.
12. Local code optimization.
13. Other variants of LL parsing.

Seminar syllabus:
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. [2] Project consultations.

Literature:
1. Aho A.V., Lam M.S., Sethi R., Ullman J.D. : Compilers: Principles, Techniques, and Tools (2nd Edition). Addison Wesley, 2006. ISBN 978-0321486813.
2. Crespi Reghizzi S., Breveglieri L., Morzenti A. : Formal Languages and Compilation (3rd Edition). Springer, 2019. ISBN 978-3-030-04878-5.
3. Scott M. L. : Programming Language Pragmatics (3rd Edition). Morgan Kaufmann, 2009. ISBN 978-8131222560.
4. Wilhelm R., Seidl H., Hack S. : Compiler Design - Syntactic and Semantic Analysis. Springer, 2013. ISBN 978-3642175398.
5. Fischer C. N., Cytron R. C., LeBlanc R. J. : Crafting A Compiler. Addison-Wesley, 2009. ISBN 978-0136067054.

Requirements:
The theory of automata and grammars, basic knowledge of programming (C and C++). Theory of automata and grammars in the scope of BIE-AAG.21, basic knowledge of programming (C and C++). It is a prerequisite for enrolling in the course BIE-PJP.21 that the student has successfully completed BIE-AAG.21 in a previous semester.

https://courses.fit.cvut.cz/BI-PJP/

The course is also part of the following Study plans:
Study Plan Study Branch/Specialization Role Recommended semester
BIE-PS.21 Computer Networks and Internet 2021 VO 4
BIE-TI.21 Computer Science 2021 PS 4


Page updated 18. 4. 2024, semester: L/2020-1, L/2023-4, L/2019-20, Z/2021-2, L/2022-3, Z/2023-4, Z/2019-20, Z/2022-3, L/2021-2, Z/2024-5, Z/2020-1, Send comments to the content presented here to Administrator of study plans Design and implementation: J. Novák, I. Halaška