COS 320 - Schedule and Readings

Schedule

DateTopicReadingDue
2/1 Introduction; ML language Ullman 1-9, Appel 1
2/3 Regular expressions Appel 2.1, 2.2
2/5 Finite automata Appel 2.3,2.4
2/8 ML-Lex Appel 2.5, ML-Lex manual
Interpreter due
2/10 More on ML Ullman 10-17
2/12 Context-free grammars Appel 3.1
2/15 Parsing Appel 3.2,3.3
Lexer due
2/17 ML-Yacc Appel 3.4; ML-Yacc manual
2/19 Tiger language; abstract syntax Appel Appendix, 4
2/22 Symbol tables, declarations Appel 5.1,5.2
Parser due
2/24 Type checking Appel 5.3,5.4
2/26 Stack frames Appel 6
3/1 LL parser generation Appel 3.2
Abstract Syntax due
3/3 LR parser generation Appel 3.3
3/5 More semantic analysis Appel 5,6
3/8 Parser error recovery Appel 3.5
3/10 MIDTERM EXAM covers thru March 5
3/12 Midterm solutions
3/13-3/21Spring Break
3/22 Intermediate trees Appel 7.1
3/23 Type Checker due
3/24 Expressions --> trees Appel 7.2
3/26 Declarations --> trees Appel 7.3
3/29 Instruction selection Appel 9
3/30 Fake Output due
3/31 Liveness analysis Appel 10
4/2 Garbage collection Appel 13
4/5 Register allocation Appel 11
4/6 Mostly correct module due
4/7 Object-oriented languages Appel 14
4/9 Guest lecture - Instruction scheduling
4/12 Dataflow analysis Appel 17
4/13 Warranted correct module due
4/14 Dataflow analysis Appel 17
4/16 Loop optimizations Appel 18
4/19 Loop optimizations Appel 18
4/20 Documented module due
4/21 Loop optimizations Appel 18
4/23 Static Single Assignment form Appel 19
4/26 SSA optimizations Appel 19
4/27 Compiler due
4/28 Memory optimization for DSPs PLDI '95 & DAC '97 papers
4/30 Wrap-up
5/11 Project due
5/14FINAL EXAM.
Back to COS 320 front page | Assignments | Course Newsgroup | Links | What's New?