Programming Languages and Compilers

Lecturer:

Jan Janoušek (gar.)

Tutor:

Radomír Polách, Jan Trávníček

Supervisor:

Department of Computer Science

Synopsis:

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.

Requirements:

Syllabus of lectures:

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.

Syllabus of tutorials:

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.

Study Objective:

After completing the course, students will be able to formally specify a translation of a text that has a certain syntax into the target form and write a compiler based on such 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.

Study materials:

1. Grune, D., Bal, H., Jacobs, C., Langendoen, K. Modern Compiler Design. Wiley, 2000. ISBN 0471976970.

2.

Note:

Time-table for winter semester 2011/2012:

Time-table is not available yet

Time-table for summer semester 2011/2012:

	06:00–08:0008:00–10:0010:00–12:0012:00–14:0014:00–16:0016:00–18:0018:00–20:0020:00–22:0022:00–24:00
Mon
Tue	roomT9:349 Janoušek J. 12:45–14:15 (lecture parallel1) Dejvice NBFIT místnost
Fri
Thu	roomT9:347 Trávníček J. 09:15–10:45 ODD WEEK (lecture parallel1 parallel nr.101) Dejvice NBFIT učebnaroomT9:347 Trávníček J. 11:00–12:30 ODD WEEK (lecture parallel1 parallel nr.103) Dejvice NBFIT učebna roomT9:347 Trávníček J. 09:15–10:45 EVEN WEEK (lecture parallel1 parallel nr.102) Dejvice NBFIT učebna
Fri

The course is a part of the following study plans:

• Computer Science, Version for Students who Enrolled in 2009 and 2010, Presented in Czech (compulsory course of the specialization)
• Information Systems and Management, Version for Students who Enrolled in 2009 and 2010, in Czech (VO)
• Informatics, Version for Students who Enrolled in 2009 and 2010, Presented in Czech (VO)
• Informatics (Bachelor)- Version for those who Enrolled in 2011 and 2012 (in Czech) (VO)
• Information Systems and Management - Version for those who Enrolled in 2011 and 2012 (in Czech) (VO)
• Computer Science - Version for those who Enrolled in 2011 and 2012 (in Czech) (compulsory course of the specialization)