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 Programming Languages and Compilers Extent of teaching: 2P+1C Instructor: Completion: Z,ZK Department: 18101 Credits: 5 Semester: L Annotation:
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.
Lecture syllabus:
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. 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. Grune, D., Bal, H., Jacobs, C., Langendoen, K. ''Modern Compiler Design''. Wiley, 2000. ISBN 0471976970. Requirements:
Knowledge of algorithmics, programming in a high-level language, grammars.
Information about the course and courseware are available at https://courses.fit.cvut.cz/BI-PJP/ The course is also part of the following Study plans:
Page updated 19. 4. 2024, semester: L/2020-1, L/2021-2, Z/2023-4, Z/2024-5, Z/2019-20, Z/2022-3, L/2019-20, L/2022-3, Z/2020-1, Z/2021-2, L/2023-4, Send comments to the content presented here to Administrator of study plans Design and implementation: J. Novák, I. Halaška