| Topic |
Chapter |
| Organization. Overview of Compilation.
l1 |
1, 2 |
| Lexical Analysis: Regular Expression & Definitions
l3,
l4 |
3.1-3.3 |
| Lexical Analysis: RE<->NFA<->DFA
l4,
l5, Javacc
1
2
3
4
5
6
7
8
9
10 |
3.4-3.6 |
| Grammars, Recursive Descent Parsing.
l6,
l7 |
4.4 |
| LL Parsing.
l8,
l9 |
4.4 |
| Bottom-up Parsing,
l10 |
4.5 |
| LR Parsers,
l11 |
4.7 |
| Item set construction,
1
2
3
4 SLR, LR, LALR,
l12 |
4.7 |
| Attributes,
l16,
l17 |
4.9 |
| Syntax-Directed Translation,
l15,
att |
5.1 |
| Symbol Tables,
l13,
st |
7.6 |
| Name Resolution,
l14,
l15 |
|
| Abstract Syntax Trees
l18,
ast |
5.2 |
| Mid-Term Exam. Previous:
00e,
00a;
98e,
98a;
97e,
97a,
| |
| Types: type checking expressions and operations
l19 |
6.1, 6.2 |
| Types & Equivalences
l20
TypeChecking.ppt |
6.3, 6.4 |
| Types in OO-languages: method resolution
l21 |
6.5 |
| Intermediate code generation: languages, expressions
l22,
l24 |
8.1-8.4 |
| Runtime storage organization
l23,
pCall |
7.2, 7.3 |
| Intermediate code generation: statements. Optimizations
l25,
l26 |
8.4-8.7, 9.4 |
| Control-Flow Analysis CFA): blocks, flow-graphs, loops
l27.5-9.ppt, |
9.4,10.1,10.4 |
| CFA:
l28.15-24.ppt |
|
| Data-Flow Analysis (DFA):
l29.25-34.ppt |
|
| DFA: dags, bbOpt. Global DFA:paths, reaching defs, struct Progs,
p35-47.ppt |
|
| Final (05:15-07:45pm) Previous:
98e
,98a;
97e,
97a |
|
