Week

Date

Topic

Reading

Tentatave

Due dates

1

8/21

Overview; compilation steps

Ch. 1

8/23

Course project; Lexical analysis intro, regular expressions

Ch. 2

2

8/28

FSAs and subset construction

8/30

Thompson's constr.; Building lex.-anal. by hand

3

9/4

Labor Day Holiday                                     

9/6

Grammars; BNF; Parse trees; derivations

3.1

HW 1

4

9/11

Bottom-Up Parsing; LR parsing alg.; S-R and R-R conflicts 

4.1

9/13

LR parsing alg.; Semantic actions and ASTs 

5.1 – 5.3

PA 1 (9/14)

5

9/18

bison / ASTs

9/20

bison / ASTs (cont.)

6

9/25

Constructing an SLR parser             

4.3-4.3.3

9/27

Constructing an SLR parser (cont.)

4.3.6, 4.4

HW 2 (9/29)

7

10/2

Summary of LR parse; Semantic analysis, scopes

10/4

Symbol tables

8.1

PA 2 (10/5)

8

10/9

review for midterm

5.7

10/11

********** MIDTERM EXAM *****************

9

10/16

Type checking

10/18

Top-down parsing: recursive descent 

3.2-3.4.1

10

10/23

Top-down parsing: recursive descent (cont.)

3.4.2-3.5

10/25

Top-down parsing: table-driven

HW 3 (10/27)

11

10/30

Run-time envnts: scoping and storage alloc, params.

Ch. 8

PA 3 (10/31)

11/1

Run-time envnts (cont); Code generation with stack machine

12

11/6

Code generation with stack machine (cont)

11/8

Stack machine (cont); Code generation for OO languages

13

11/13

catch-up

11/15

Intermediate code gen; gen code for arrays; parameter passing

HW 4

14

11/20

Machine-independent optimizations

6.1

PA4 (early bonus)

11/22

Final code generation 

7.1

15

11/27

Final code generation (cont.)

PA 4 (11/28)

11/29

Register allocation by graph coloring 

HW 5 (12/1)

   Mon 12/4     Review session 11am – 1pm    

   Wed  12/6          **********  FINAL EXAM 11am – 1pm  **********