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.

MI-GEN Code Generators Extent of teaching: 2P+1C

Instructor: Completion: Z,ZK

Department: 18101 Credits: 4 Semester: L

Annotation:
Students will become acquainted with both theoretical and practical aspects of back-end of an optimizing programming language compiler.

Lecture syllabus:

1. Overview of constructs of programming languages.

2. Basic notions: types, variables, type compatibility and dynamic data structures.

3. Basic notions: activation record, calling conventions.

4. Internal forms.

5. Direct code generation, AST $\to$ DAG $\to$ BB.

6. DAG analysis, BB, dependencies and antidependencies.

7. Register allocation, memory allocation (static, on the stack).

8. Intermediate code optimization.

9. Code generator, instruction selection.

10. Translation of a stack-based language into the native HW, HW dependent optimizations.

11. Modules and separate compilation.

12. Support for debugging.

13. Code generators for object-oriented programming languages.

Seminar syllabus:

1. Revision - basic data types.

2. Revision - intermediate code and translation of basic program structures I.

3. Revision - intermediate code and translation of basic program structures II.

4. Assignment of semestral works.

5. AST -> DAG -> BB.

6. Intermediate code optimization.

7. Register allocation.

8. Instruction selection I.

9. Instruction selection II.

10. Further optimizations.

11. Consultations on semestral works.

12. Instruction scheduling and pipeling.

13. Checking semestral works.

Literature:

1. Wirth, N. ''Compiler Construction''. Addison-Wesley, 1996. ISBN 0201403536.

2. Aho, A. V., Lam, M. S., Sethi, R., Ullman, J. D. ''Compilers: Principles, Techniques, and Tools (2nd Edition)''. Addison Wesley, 2006. ISBN 0321486811.

Requirements:
Principles of parsing and translation, graph algorithms.

Informace o předmětu a výukové materiály naleznete na https://courses.fit.cvut.cz/MI-GEN/

The course is also part of the following Study plans:

Study Plan Study Branch/Specialization Role Recommended semester

MI-WSI-WI.2016 Web and Software Engineering V 2

MI-SP-TI.2016 System Programming V 2

MI-WSI-ISM.2016 Web and Software Engineering V 2

MI-PSS.2016 Computer Systems and Networks V 2

MI-NPVS.2016 Design and Programming of Embedded Systems V 2

NI-TI.2018 Computer Science V 2

MI-ZI.2016 Knowledge Engineering V 2

MI-ZI.2018 Knowledge Engineering V 2

MI-WSI-ISM.2016 Web and Software Engineering V 2

MI-WSI-SI.2016 Web and Software Engineering V 2

MI-PB.2016 Computer Security V 2

MI-SP-SP.2016 System Programming PZ 2

MI-SPOL.2016 Unspecified Branch/Specialisation of Study VO 2

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

MI-GEN	Code Generators			Extent of teaching:	2P+1C
Instructor:				Completion:	Z,ZK
Department:	18101	Credits:	4	Semester:	L

1.		Overview of constructs of programming languages.
2.		Basic notions: types, variables, type compatibility and dynamic data structures.
3.		Basic notions: activation record, calling conventions.
4.		Internal forms.
5.		Direct code generation, AST $\to$ DAG $\to$ BB.
6.		DAG analysis, BB, dependencies and antidependencies.
7.		Register allocation, memory allocation (static, on the stack).
8.		Intermediate code optimization.
9.		Code generator, instruction selection.
10.		Translation of a stack-based language into the native HW, HW dependent optimizations.
11.		Modules and separate compilation.
12.		Support for debugging.
13.		Code generators for object-oriented programming languages.

1.		Revision - basic data types.
2.		Revision - intermediate code and translation of basic program structures I.
3.		Revision - intermediate code and translation of basic program structures II.
4.		Assignment of semestral works.
5.		AST -> DAG -> BB.
6.		Intermediate code optimization.
7.		Register allocation.
8.		Instruction selection I.
9.		Instruction selection II.
10.		Further optimizations.
11.		Consultations on semestral works.
12.		Instruction scheduling and pipeling.
13.		Checking semestral works.

1.		Wirth, N. ''Compiler Construction''. Addison-Wesley, 1996. ISBN 0201403536.
2.		Aho, A. V., Lam, M. S., Sethi, R., Ullman, J. D. ''Compilers: Principles, Techniques, and Tools (2nd Edition)''. Addison Wesley, 2006. ISBN 0321486811.