Schedule

This is a preliminary schedule, which still needs updating. It might change before or during the course.

Date	Lecture	Lecture Notes	Exercises
17 Nov	Introduction	1-2.1	2.1-3
19 Nov	Grammars and Parsing	2.2-2.4, 2.6-2.8	2.5-10, 2.13-14, 2.21, 2.44
24 Nov	Parser Combinators	2.5, 3 until 3.4.1	3.5-6, 3.9, 3.15-16, 3.21-22, 3.24-25
26 Nov	Parser design	3.4.2 - 3.5, 4 (3.6-7 for the interested)	4.1
1 Dec	Compositionality	5 until 5.3	5.1-4
3 Dec	Compositional interpreters for expressions; Computing with parsers	5.4-5 6	5.5, 5.6, 5.13
8 Dec	Folds versus explicit recursion, Finite state machines	7.1-2	7.1-2, 7.7-8, 7.12-14
10 Dec	LR parsing	10.2-3	10.1-6
15 Dec	A stack machine, midterm preparation	The SSM manual
17 Dec	Midterm exam	1 - 7.3, 10.2-3, Slides lecture 1 - 11
5 Jan
7 Jan	Regular expressions	7.2-3 (and more)	regextutorials.com/excercise.html exercises [123]|5|7|1[0236]
12 Jan	Analysis	No notes	See demos 0, 1, 2, 3
14 Jan	Architecture
19 Jan	LL(1) parsing, Expressive power of regular languages	8.1-2, 9.1, 10.1	8.1-4, 9.1-6
21 Jan	Expressive power of context-free languages, A (slightly personal) history of languages and compilers	8.3	8.5-8
26 Jan	Final exam preparation	See old exams page, extra materials
28 Jan	Guest lecture
4 Feb	Final exam	All material covered in the course. The majority of the questions will be about topics disussed in the second half of the course, but we can ask questions about all topics that have been discussed in the course.