| |
|
|
||
| |
|
|
|
Overview |
| |
|
|
|
Scanners, Regular Expressions, Finite State Machines, flex |
| |
|
|
|
Context-Free Grammars, Shift-Reduce Parsing |
| |
|
|
|
Parsing, Syntax-Directed Translation, bison, LL(1) grammars |
| |
|
|
|
Recursive-Descent Parsing; Abstract Syntax Tree |
| |
|
|
|
Predict Sets; make grammars LL(1); Table-driven Parsing; Type checking |
| |
|
|
|
Type checking |
| |
|
10/24 Exam 1 | |
|
| |
|
|
|
Run-Time Environment; Naive Code Generation |
| |
|
|
|
Naive Code Generation ; Control-Flow ; Sethi-Ullman |
| |
|
|
|
nested functions; LR(0), SLR(1) grammars |
| |
|
|
|
SLR(1) grammars; non-SLR(1) grammar |
| |
|
|
|
Intermediate Representations, Optimizations, Control Flow Graph |
| |
|
|
|
JVM, jasmin, Pcode machine; Error recovery |
| |
|
12/12 Exam 2 | |
hash = S * L
S = Sum of the 6 high-order digits in your student id
L = length of your Last name
Example: Name = Gordie Howe; Student Id = 0123456
hash = (0+1+2+3+4+5)*4 = 15*4 = 60
hash e2
252 ......101
175 ...... 96
161 ...... 94
70 ...... 92
198 ...... 89
286 ...... 87
120 ...... 82
91 ...... 79
147 ...... 75
196 ...... 63
median 88
mean 86
A
A
A
A
A
B
B
BC
C
C
[UpLink]   | |   [CS Department Home Page]