These notes are not intended to be a substitute for taking notes in class.

Date	Contents
9/5/2007	Programming Languages: Why? dotstar.cpp
9/7/2007	Overview of Compilers
9/10/2007	Regular Expressions
9/12/2007	Context Free Grammars and Parse Trees
9/14/2007	Finite Automata
9/17/2007	RE -> NFA -> DFA
9/19/2007	Minimizing DFAs
9/21/2007	Top-down vs. bottom-up parsing
9/24/2007	Pointers to Functions in C First and Follow sets
9/26/2007	Building a Top-Down Parser Top-Down Parser Code
9/28/2007	Computing First and Follow Sets
10/1/2007	Table-Driven Top-Down Parsing
10/3/2007	Review
10/8/2007	LR Item Sets
10/10/2007	Table-Driven LR Parsing
10/15/2007	Java Reflection
10/17/2007	Bindings
10/19/2007	Scope
10/22/2007	Nesting
10/24/2007	Dynamic Scope
10/26/2007	Attribute Grammars
10/29/2007	Actions for an LL(1) Parser LL(1) Parser Code w/Attributes
10/31/2007	IA-32 Instruction Set IA-32 Arithmetic
11/2/2007	Calling Sequence and Control Structures Code
11/5/2007	Calling C++ From Assembly
11/7/2007	Calling Virtual Functions Code
11/12/2007	Control Flow Structures for Selection Code generation and improvement
11/14/2007	Enumeration-Controlled Loops, Iterators
11/16/2007	Scheme
11/19/2007	Scopes and Data Structures in Scheme
11/26/2007	Expressions and Functions in ML
11/28/2007	Primes and Optimize in ML
12/3/2007	Introduction to Prolog Primes Mergesort (incomplete)