Compiler Design I (Kompilatorteknik I)

News

Course Information

Schedule by Date, Reading Suggestions and Lecture Slides

• The schedule of the course is also available here.
• Below you can access the slides of the lectures (in one or four slides per PDF page), which you should definitely read for the assignments and the exam, and supplementary reading suggestions from books.
• The reading suggestions prefixed with D: below correspond to the 2nd Edition of the Compilers: Principles, Techniques, and Tools book by Aho, Lam, Sethi, and Ullman.

Day		Time	Room	Type	Topics Covered	Reading Suggestions	Slides
Mon	Oct 29	13–15	1111	lecture 1	Introduction to compilation	D: 1.1–1.6
Wed	Oct 31	13–15	1211	lecture 2	Introduction to lexical analysis	D: 2.6, 3.1, 3.3
Thu	Nov 1	10–12	1111	lecture 3	Implementation of lexical analysis	D: 3.6–3.8
Tue	Nov 6	15–17	1111	lesson 1	Exercises on lexical analysis	Assignment 1 of 2011
Thu	Nov 8	10–12	1111	lecture 4	Introduction to parsing	D: 4.1–4.3
Fri	Nov 9	13–15	1111	lecture 5	Abstract syntax trees & Top-down parsing	D: 4.4
Tue	Nov 13	10–12	1111	lecture 6	Bottom-up parsing	D: 4.5
Wed	Nov 14	13–15	1311	lesson 2	Exercises on grammars and top-down parsing	Assignment 2 of 2011
Thu	Nov 15	13–15	1111	lecture 7	LR-parsing		See lecture 6
Fri	Nov 16	13–15	1111	lecture 8	Construction of LR parsers & LALR parser generators	D: 4.7, 4.8
Mon	Nov 19	10–12	1111	lecture 9	Introduction to semantic analysis
Wed	Nov 21	13–15	1311	lecture 10	Symbol tables & scope checking
Thu	Nov 22	10–12	1111
Fri	Nov 23	13–15	1111	lesson 3	Exercises on bottom-up parsing	Assignment 2 of 2011
Mon	Nov 26	10–12	1111	lecture 11	Type checking
Tue	Nov 27	10–12	1111	lecture 12	Runtime enviroments
Thu	Nov 29	13–15	1311	lecture 13	Code generation
Fri	Nov 30	8–10	1111
Mon	Dec 3	13–15	1311	lecture 14	Code generation & Parameter passing
Wed	Dec 5	13–15	1111	lecture 15	Intermediate code & Local optimizations	D: 9.4, 9.9, 10.1-10.3
Thu	Dec 6	13–15	1111
Fri	Dec 7	10–12	1311	lesson 4	Exercises on runtime organization and code generation	Assignment 3 of 2011
Tue	Dec 11	15–17	1111	lecture 16	Global optimization	D: 9.1.1–9.1.6, 9.2, 9.4
Wed	Dec 12	10–12	1111	lecture 17	Global register allocation	D: 8.8
Thu	Dec 13	13–15	1111	lesson 5	Exercises on global optimization and register allocation	Assignment 3 of 2011
Fri	Jan 11	8–13	Hus 5	Examination

Assignments

• Assignment 1
  • Announced: 1/11/2012, 17:00
  • Due date: 16/11/2012, 17:00
  • Late deadline: The deadline of the second assignment
  • More information
    • Assignment 1 of previous year
    • Solutions
    • Note that the solutions contain a clarifying sentence (in Exercise 5) compared to what was presented in lesson 1.
• Assignment 2
  • Announced: 12/11/2012, 23:42
  • Due date: 30/11/2012, 17:00
  • Late deadline: The deadline of the third assignment
  • More information
    • Assignment 2 of previous year
    • Solutions
• Assignment 3
  • Announced: 1/12/2012, 18:42
  • Due date: 14/12/2012, 17:00
  • Late deadline: The deadline of the January exam
  • Note: There has been a small correction on Exercise 4 compared to the original version of the assignment:
    • Old Text: ... the variables that are live ... are v and z.
    • New Text: ... the only variable that is live ... is f.
  • More information
    • Assignment 3 of previous year
    • Solutions

Examinations

• All examinations are going to be closed book, but you are allowed to bring with you a handwritten A4 page with your notes.
• The first examination of the course is scheduled for January 11th, 2013 and will take place in BMC A3:2. The time is 8–13.
• Last year's examination.