| Week | Date | Topic/Read Before Class | Assignment |
| 1 | M, 01/12 | Course information, go over the syllabus,
Section 1.1 Set Theory |
|
| W, 01/14 | Section 1.1 Set Theory (cont'd) | Homework 1 (pdf) | |
|   | F, 01/16 | Section 1.1 Set Theory (cont'd) | |
| 2 | M, 01/19 | no class -- Martin Luther King, Jr. Day recess | |
| W, 01/21 | Homework 2 (pdf) | ||
|   | F, 01/23 | ||
| 3 | M, 01/26 | ||
| W, 01/28 | Homework 3 (pdf) | ||
|   | F, 01/30 | ||
| 4 | M, 02/02 | ||
| W, 01/04 | Review homework 3 | Homework 4 (pdf) | |
|   | F, 02/06 | no class -- Winter Carnival recess | |
| 5 | M, 02/09 | Section 2.3 Regular Sets and Expressions | |
| W, 02/11 | Review homework 4 Section 3.1 Context-Free Grammars and Languages |
Homework 5 (pdf) | |
|   | F, 02/13 | Midterm exam 1 (covers Chapters 1 and 2) Sections covered: 1.1, 1.2, 1.3, 1.4, 1.6, 1.7, 2.1, 2.2, 2.3 Sections NOT covered: 1.5, 1.8, 2.4 |
|
| 6 | M, 02/16 | Section 3.1 Context-Free Grammars and Languages Section 3.2 Examples of Grammars and Languages |
|
| W, 02/18 | Review homework 5 Section 3.2 Examples of Grammars and Languages |
Homework 6 (pdf) | |
|   | F, 02/20 | Section 3.3 Regular grammars Section 3.5 Leftmost derivations and ambiguity |
|
| 7 | M, 02/23 | Section 4.1 Grammar transformations Section 4.2 Elimination of λ-rules |
|
| W, 02/25 | Review homework 6 Section 4.1 Grammar transformations Section 4.2 Elimination of λ-rules |
Homework 7 (pdf) | |
|   | F, 02/27 | Section 4.3 Elimination of Chain Rules (handout in pdf) |
|
| 8 | M, 03/02 | Section 4.4 Useless symbols | |
| W, 03/04 | Review homework 7 Section 4.4 Useless symbols Review the four algorithms (handout) |
||
|   | F, 03/06 | Midterm exam 2 (covers Chapter 3 and part of Chapter 4) Sections covered: 3.1, 3.2, 3.3, 3.5, 4.1, 4.2, 4.3 Sections NOT covered: 3.4, 3.6 (Note that sections 4.4 and later will be on the next exam) |
|
| -- | M, 03/09 | no class -- Spring recess | |
| W, 03/11 | no class -- Spring recess | ||
|   | F, 03/13 | no class -- Spring recess | |
| 9 | M, 03/16 | Section 4.4 Useless symbols Section 4.5 Chomsky Normal Form |
|
| W, 03/18 | Section 4.6 The CYK algorithm (handout in pdf) | Homework 8 (pdf) | |
|   | F, 03/20 | Section 4.7 Removal of Direct Left Recursion Section 4.8 Greibach Normal Form |
|
| 10 | M, 03/23 | Section 4.8 Greibach Normal Form Section 18.1 The Graph of a Grammar Section 18.2 A Top-Down Parser Section 19.1 Lookahead in Context-Free Grammars |
|
| W, 03/25 |
Review homework 8 Section 19.1 Lookahead in Context-Free Grammars Section 19.2 FIRST, FOLLOW, and Lookahead Sets |
Homework 9 (pdf) | |
|   | F, 03/27 | Section 19.4 Construction of FIRSTk sets (Handouts: The Algorithm A trace of the algorithm) |
|
| 11 | M, 03/30 | Section 19.5 Construction of FOLLOWk sets (Handouts: The Algorithm A trace of the algorithm) |
|
| W, 04/01 |
Review homework 9 Section 19.5 Construction of FOLLOWk sets Construction of LOOKAHEADk sets Section 5.1 A Finite State Machine |
Homework 10 (pdf) | |
|   | F, 04/03 | Midterm exam 3 Sections covered: 4.4, 4.5, 4.6, 4.7, 4.8, 18.1, 18.2, 19.1, 19.2 Sections NOT covered: 18.3, 18.4, 18.5, Computation of FIRST and FOLLOW sets in Section 19.2 |
|
| 12 | M, 04/06 |
Section 5.2 Deterministic Finite Automata Section 5.3 State Diagrams and Examples |
|
| W, 04/08 |
Review homework 10 Section 5.4 Nondeterministic Finite Automata Section 5.5 λ-transitions |
Homework 11 (pdf) | |
|   | F, 04/10 | Section 5.5 λ-transitions | |
| 13 | M, 04/13 | Section 5.6 Removing Nondeterminism | |
| W, 04/15 | Review homework 11 Section 5.6 Removing Nondeterminism |
Homework 12 (pdf) | |
|   | F, 04/17 | Section 7.1 Pushdown Automata | |
| 14 | M, 04/20 | Section 7.1 Pushdown Automata | |
| W, 04/22 | Section 8.1 The Standard Turing Machine Section 8.2 Turing Machines as Language Acceptors |
||
|   | F, 04/24 | Review homework 12 | |
| Finals | M, 04/27 |
Final Exam on Monday (04/27) at 10:15am Place: Rekhi 214 (the regular classroom) Sections covered: 1.7 (Proof by induction) Algorithm 19.4.1 (Construction of FIRSTk sets) Algorithm 19.5.1 (Construction of FOLLOWk sets) 5.1, 5.2, 5.3, 5.4, 5.5, 5.6 6.1 7.1 8.1, 8.2 (Definition 8.2.1 for TMs) Sections NOT covered: 5.7, 6.2 -- 6.7, 7.2 -- 7.5, Definition 8.1.1 for TMs ( OSSR's schedule ) |
Good luck! |
Note: A week-long homework is assigned almost every Wednesday.