CPS 140, Spring 1999, Lecture Notes

Notes for all lectures may not be available.

Lecture notes will be available in either postscript or pdf format.

• For files that are in postscript format, you need a postscript previewer. You should be able to view them on the SparcStations. If you want to print them, while viewing them, select "save" and save as a file with a ".ps" extension, for example: lect1.ps

  You can then send the file to the printer by typing: lpr lect1.ps

• To read PDF files you can download the free Adobe Acrobat Reader.

Lecture Notes

• Overview (ps and pdf ) Jan. 14 and 19
• Finite Automata (ps and pdf ) Jan. 21 and 26
• Regular Expressions and Regular Grammars (ps and pdf ) Feb. 2 and Feb. 4
• Pumping Lemma (ps and pdf ) Feb. 4 and 9
• Minimizing DFA (ps and pdf ) Feb. 11
• Context-free grammars(ps and pdf ) Feb. 16 and 25
• Transforming Grammars (ps and pdf ) Feb. 25 and March 2
• Pushdown Automata (ps and pdf ) March 2 and March 4
• Parsing (ps and pdf ) Mar. 4 and March 9
• LR Parsing (ps and pdf ) Mar. 11 and 23
• Properties of CFL (ps and pdf ) Mar. 25
• LL Parsing (ps and pdf ) Mar. 30
• L-Systems (ps and pdf ) April 1
• Turing Machines (ps and pdf ) April 13
• Turing Machines as Building Blocks (ps and pdf ) April 15
• Turing Machines (ps and pdf ) April 20 and April 22
• Recursively Enumerable (ps and pdf ) April 27
• Compilers (ps and pdf ) April 27