CS 4240
|
| Date | Topic | Reading | Remark |
|---|---|---|---|
| 1/18 | No class (school holiday) | ||
| 1/20 | Compiler Structure, Intermediate Representations |
|
|
| 1/25 | Control Flow Graphs, Reaching Definitions |
|
|
| 1/27 | Reaching Definitions, Data Flow Analysis |
|
|
| 2/1 | Redundancy Elimination, Value Numbering, Dominator |
|
|
| 2/3 | Lazy Code Motion, Available Expression Analysis |
|
|
| 2/8 | Available Expression Analysis, Constant Propagation |
|
|
| 2/10 | Project 1 & Tiger IR Help Session |
|
|
| 2/15 | Copy Propagation, Constant Propagation Revisited |
|
|
| 2/17 | Instruction Selection |
|
|
| 2/22 | Peephole Matching, Register Allocation |
|
|
| 2/24 | Register Allocation (contd) |
|
|
| 3/1 | Instruction Scheduling |
|
|
| 3/3 | MIPS Processor Architecture, SPIM simulator |
|
|
| 3/8 | Procedure Abstraction, MIPS Calling Convention |
|
|
| 3/10 | Global Instruction Scheduling, Software Pipelining |
|
|
| 3/15 | Static Single Assignment Form |
|
|
| 3/17 | Midterm Review (Part 1) | ||
| 3/22 | Midterm Review (Part 2) |
|
|
| 3/24 | No class (school break) | ||
| 3/29 | Mid Term | ||
| 3/31 | Lexical Analysis, Introduction to Parsing |
|
|
| 4/5 | Context Free Grammars, Top Down Parsing |
|
|
| 4/7 | LL(1) Parsing |
|
|
| 4/12 | Finite State Automata |
|
|
| 4/14 | Attribute Grammars, Type Checking |
|
|
| 4/19 | ANTLR Overview and Demonstration | ||
| 4/21 | Course Review | ||
| 4/26 | Homework 3 Help Session |
|
|
* This is a hybrid course. Check with the instructor before coming to the classroom.