CS 4240
|
Date | Topic | Reading | Remark |
---|---|---|---|
1/10 | Compiler Structure, Intermediate Representations |
|
|
1/12 | Control Flow Graphs, Reaching Definitions |
|
|
1/17 | No class (school holiday) | ||
1/19 | Reaching Definitions, Data Flow Analysis |
|
|
1/24 | Redundancy Elimination, Value Numbering, Dominator |
|
|
1/26 | Lazy Code Motion, Available Expression Analysis |
|
|
1/31 | Available Expression Analysis, Constant Propagation |
|
|
2/2 | Project 1 & Tiger IR Help Session |
|
|
2/7 | Copy Propagation, Constant Propagation Revisited |
|
|
2/9 | Instruction Selection |
|
|
2/14 | Peephole Matching, Register Allocation |
|
|
2/16 | Register Allocation (contd) |
|
|
2/21 | Instruction Scheduling |
|
|
2/23 | MIPS Processor Architecture, SPIM simulator |
|
|
2/28 | Procedure Abstraction, MIPS Calling Convention |
|
|
3/2 | Global Instruction Scheduling, Software Pipelining |
|
|
3/7 | Static Single Assignment Form |
|
|
3/9 | Midterm Review (Part 1) | ||
3/14 | Midterm Review (Part 2) |
|
|
3/16 | Mid Term | ||
3/21 | No class (school break) | ||
3/23 | No class (school break) | ||
3/28 | Lexical Analysis, Introduction to Parsing |
|
|
3/30 | Context Free Grammars, Top Down Parsing |
|
|
4/4 | LL(1) Parsing |
|
|
4/6 | Finite State Automata |
|
|
4/11 | Attribute Grammars, Type Checking |
|
|
4/13 | ANTLR Overview and Demonstration | ||
4/18 | Course Review | ||
4/20 | Homework 3 Help Session |
|