Course description

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.

BI-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. 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. Trávníček, J. - Janoušek, J. (25%) - Melichar, B. - Cleophas, L.: On modifcation of Boyer-Moore-Horspool's algorithm for tree pattern matching in linearised trees. Theoretical Computer Science, 830: 60{90, 2020.

2. Plachý, Š. - Janoušek, J. (50%): On Synchronizing Tree Automata and Their Work-Optimal Parallel Run, Usable for Parallel Tree Pattern Matching. In SOFSEM 2020: Theory and Practice of Computer Science, Springer, pp. 576{586, 2020. ISBN 978-3-030-38918-5.

3. Šestáková, E. - Janoušek, J. (50%): Automata Approach to XML Data Indexing. Information, 9(1): 12{12, 2018.

4. Šestáková, E. - Melichar, B. - Janoušek, J. (33%): Constrained Approximate Subtree Matching by Finite Automata. In Proceedings of the Prague Stringology Conference 2018, CVUT v Praze, 2018, pp. 79{90. ISBN 978-80-01-06484-9.

5. Polách, R. - Trávníček, J. - Janoušek, J. (25%) - Melichar, B.: Ecient Determinisation of Visibly and Height-Deterministic Pushdown Automata. Computer Languages, Systems and Structures, 46: 91{105, 2016.

Requirements:

Informace o předmětu a výukové materiály naleznete na 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

BI-ISM.2015 Information Systems and Management V 4

BI-WSI-PG.2015 Web and Software Engineering V 4

BI-BIT.2015 Computer Security and Information technology V 4

BI-WSI-SI.2015 Web and Software Engineering V 4

BI-WSI-WI.2015 Web and Software Engineering V 4

BI-PI.2015 Computer engineering V 4

BI-TI.2015 Computer Science PO 4

BI-ZI.2018 Knowledge Engineering V 4

BI-SPOL.2015 Unspecified Branch/Specialisation of Study VO 4

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

BI-PJP	Programming Languages and Compilers			Extent of teaching:	2P+1C
Instructor:				Completion:	Z,ZK
Department:	18101	Credits:	5	Semester:	L

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.

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.

1.		Trávníček, J. - Janoušek, J. (25%) - Melichar, B. - Cleophas, L.: On modifcation of Boyer-Moore-Horspool's algorithm for tree pattern matching in linearised trees. Theoretical Computer Science, 830: 60{90, 2020.
2.		Plachý, Š. - Janoušek, J. (50%): On Synchronizing Tree Automata and Their Work-Optimal Parallel Run, Usable for Parallel Tree Pattern Matching. In SOFSEM 2020: Theory and Practice of Computer Science, Springer, pp. 576{586, 2020. ISBN 978-3-030-38918-5.
3.		Šestáková, E. - Janoušek, J. (50%): Automata Approach to XML Data Indexing. Information, 9(1): 12{12, 2018.
4.		Šestáková, E. - Melichar, B. - Janoušek, J. (33%): Constrained Approximate Subtree Matching by Finite Automata. In Proceedings of the Prague Stringology Conference 2018, CVUT v Praze, 2018, pp. 79{90. ISBN 978-80-01-06484-9.
5.		Polách, R. - Trávníček, J. - Janoušek, J. (25%) - Melichar, B.: Ecient Determinisation of Visibly and Height-Deterministic Pushdown Automata. Computer Languages, Systems and Structures, 46: 91{105, 2016.