COS 320, Spring 2001 : Schedule

b COS 320, Spring 2001 : Schedule

Computer Science 320
Compiling Techniques

Professor David August

Schedule and Readings

Date	Topic	Reading	Due
2/5-2/7	Introduction; ML language	Ullman 1-3, Appel 1
	Regular expressions	Appel 2.1, 2.2
	Finite automata	Appel 2.3,2.4
2/12-2/14	ML-Lex	Appel 2.5, ML-Lex manual
	More on ML	Ullman 4-9
	Context-free grammars	Appel 3.1
2/15			Interpreter due
2/19-2/21	Parsing	Appel 3.2,3.3
	ML-Yacc	Appel 3.4; ML-Yacc manual
	LL parser generation	Appel 3.2
	LR parser generation	Appel 3.3
2/22			Lexer due
2/26-2/28	Parser error recovery	Appel 3.5
	Tiger language; abstract syntax	Appel Appendix, 4
3/5-3/7	Symbol tables, declarations, type checking	Appel 5
3/8			Parser due
3/12	Stack frames	Appel 6
3/12			Abstract Syntax due
3/14	MIDTERM EXAM	covers thru 3/8
3/16-3/24	Spring Break
3/27			Type Checker due
3/26-3/28	Intermediate Representation trees	Appel 7
	Canonical Trees	Appel 8
	Instruction selection	Appel 9
4/2-4/4	Control Flow Analysis	Appel 18
	Liveness analysis	Appel 10
4/10			Fake Output due
4/9-4/11	Dataflow analysis	Appel 17
	Loop Optimizations	Appel 18
4/17			Mostly correct module due
4/16-4/18
	Static Single Assignment Form	Appel 19
4/24			Warranted correct module due
4/23-4/25	Predication
	Instruction Scheduling
5/1			Documented module due
5/2	Wrap-up
5/14			Compiler due
5/14			Special Projects due/Dean's Date
5/21	FINAL EXAM 1:30PM. Room CS103