CS362 2011F Compilers

Class 10: From Specification to Optimal DFA (2)

Back to From Specification to Optimal DFA (1). On to Lex and Flex.

This outline is also available in PDF.

Held: Friday, 16 September 2011

Summary: Today we continue our consideration of how to move from the readable but declarative regular expression notation to the executable but sometimes obtuse finite automaton notation.

Related Pages:

Notes:

Overview:

Examples

From NFA to DFA

From DFA to Optimal DFA

From Token Definitions to DFA

Tokenizing with Finite Automata

Limitations of Regular Expressions, DFAs, and the Ilk

Back to From Specification to Optimal DFA (1). On to Lex and Flex.

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

This document was generated by Siteweaver on Wed Dec 7 10:26:32 2011.
The source to the document was last modified on Fri Aug 26 13:03:12 2011.
This document may be found at http://www.cs.grinnell.edu/~rebelsky/Courses/CS362/2011F/Outlines/outline.10.html.

Samuel A. Rebelsky, rebelsky@grinnell.edu