CS164: Materials from the TAs
Discussion handouts:
(1/27) lexical analysis and regular expressions (
solutions
).
(2/3) finite automaton (
solutions
).
(2/10) top down parsing (
solutions
).
(2/17) LL(1) parsing, factoring rules (
solutions
).
(2/23) Shift-Reduce (LR(1)) parsing (
solutions
).
(3/3) Earley's algorithm, LR conflicts review (
solutions
).
(3/10) Midterm 1 review (
solutions
).
(3/17) Prolog and type inference (
solutions
).
(4/7) Types and Machine code (
solutions
).
(4/14) Midterm 2 review (
solutions
).
(4/21) Inheritance and OOP (
notes
,
solutions
).
(4/28) Exceptions and Code Generation (
solutions
).
Page was last modified on Wed Jan 28 12:35:29 2015.
Address comments and questions to
cs164@imail.eecs.berkeley.edu