Lectures

The following schedule is tentative. As the course progresses, the (broken) hyperlinks will point to the lecture notes.  Only the darker (orange) part of the table is valid.  The rest of the table forecasts what’s coming up in the semester.


The slides on this page were created by Alex Aiken, George Necula, and also by Aman Amarasinghe, Evelyn Duesterwald, Susan Horwitz, Dave Mandelin, Manu Sridharam, and Ras Bodik.

 

week

Lecture

Date

Topic

Reading

Assigned

Due

1

1

Aug 26

Course overview (PPT, PDF)

Ch. 1 (optional: John Backus short paper on Speedcoding)

PA1

 

2

Jan. 28

Lexical Analysis I
(PPT, PDF)

 [ASU]: 3.1 - 3.5

 [FLC]: 3.1 - 3.4

   

 

2

3

Sep 2

Lexical Analysis II
(PPT, PDF)

[ASU]: 3.6 - 3.7

 [FLC]: 3.5 - 3.6

 

 

4

Sep 4

Intro to Parsing.   (PPT, PDF)

[ASU]: 4.1 - 4.3
 [FLC]: 4.1 - 4.4

 

 

 

3

 

5

Sep 9

Ambiguity.Top-Down Parsing  (PPT, PDF)

[ASU] 5.1-5.2.

[FLC] 5.1-5.7

WA1,

PA1

6

Sep 11

continued...
supplement (PPT, PDF)

[ASU] 4.4. 

[FLC] 4.5

PA2

 

4

7

Sep 16

Bottom-Up Parsing (PPT, PDF) 

[ASU] 4.5, 4.7-4.9
[FLC] 6.1-6.4 

WA2

WA 1

8

Sep 18

LR Parsing  (same lecture notes as in lecture 7)

 

 

 

 

5

9

Sep 23

Syntax-directed translation (PPT, PDF)

 [ASU] 5.1-5.6

 [FLC] 7.1-7.5

WA3

WA 2

10

Sep 25

Midterm I review (PPT, PDF)

 

 

PA2

6

 

Sep 30

Midterm I

 

PA3

 WA3

11

Oct 2

Semantic Analysis I (PPT, PDF)

6.1 - 6.5. (Optional: Luca Cardelli, "Type Systems" (PS, PDF), Sections 1,2 and 4)

 

 

7

12

Oct 7

More Type Checking  (PPT, PDF)

[FLC] Chapters 8-10.

WA 4

 

13

Oct 9

Runtime Organization. (PPT, PDF) 

[ASU] 7.1-7.5,7.7-7.8.
[FLC] Chapter  11

 

 

8

14

Oct 14

Simple Code Generation (PPT, PDF) 

[ASU] Ch 8

[FLC] Ch 12, 13

 

WA 4

15

Oct 16

OO Code Organization. (same slides as in lecture 14).

 

WA 5

 

9

 

16

Oct 21

Intermediate Languages (PPT, PDF) 

[ASU] 9.4,9;10.1-5

WA 6
PA 4

WA 5

17

Oct 23

Finish Local Optimization (slides from prev. lecture). Start Global Optimization  (PPT, PDF) 

[ASU] 10.5-6

 

 

10

 

18

Oct 28

Finish global optimization.

 

WA 7

WA 6

19

Oct 30

Register Allocation (PPT, PDF) 

[ASU] 9.7

 

 

11

20

Nov 4

Garbage Collection (PPT, PDF)  

 

WA 8

WA 7

21

Nov 6

Midterm review.

 

 

PA 4

12

 

Nov 11

No lecture. Veterans Day Holiday.

 

 

 

 

Nov 13

Midterm II

 

 

 

13

22

Nov 18

GC cot.

9.1

 

 

23

Nov 20

Dynamic Binary Translation (PPT, PDF)

 

WA 9

 

14

24

Nov 25

Exceptions (PPT, PDF)

 

 

WA 9

 

Nov 27

No lecture.  Thanksgiving Holiday.

 

 

 

Thanksgiving.

15

25

Dec 2

CS164 in Practice (PPT) (Dave Mandelin)

 

 

 

26

Dec 4

Language Security (PPT) (Manu Sridharan)

Smashing the Stack for Fun and Profit; Using Memory Errors to Attack a Virtual Machine

 

PA5

16

 

 

 

 

 

 

 

 

 

 

 

 

17

 

Dec 17 (Wed)
12:30-3:30

Final Exam 

 

 

 

PA = programming assignment. WA = written assignment  

[ASU]: "the Dragon book" by Aho, Stehi, Ullman.  [FLC]: "Crafting a Compiler" by Fisher, LeBlanc, Cytron.

Note that some of the lectures contained in Powerpoint format use symbols and features of the TexPoint package. You do not need that package if you read the PDF or PS versions of the slides.

Last modified on 09/25/2003