Compilers (CS362 2001S)

Class 09: Introduction to Grammars and Parsing

Back to From NFA to Optimal DFA. On to Ambiguous Grammars.

Held Friday, February 9, 2001

Summary

Today we move from lexing to parsing.

Notes

Overview

Limits of Regular Expressions and Finite Automata

An Introduction to Grammars

BNF grammars

Context-Free Grammars

 

History

Monday, 22 January 2001

Friday, 9 February 2001

 

Back to From NFA to Optimal DFA. On to Ambiguous Grammars.

Disclaimer: I usually create these pages on the fly. This means that they are rarely proofread and may contain bad grammar and incorrect details. It also means that I may update them regularly (see the history for more details). Feel free to contact me with any suggestions for changes.

This page was generated by Siteweaver on Mon Apr 30 10:51:49 2001.
This page may be found at http://www.cs.grinnell.edu/~rebelsky/Courses/CS362/2001S/outline.09.html.
You may validate this page's HTML.
The source was last modified Fri Feb 9 10:42:50 2001.