Compilers (CS362 2002F)

Class 07: From Specification to Optimal DFA, Continued

Back to From Specification to Optimal DFA. On to Introduction to Grammars and Parsing.

Held Friday, September 13, 2002

Summary

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

Notes

Overview

A Different Exampe

From DFA to Optimal DFA

From Token Definitions to DFA

Tokenizing with Finite Automata

 

History

Thursday, 29 August 2002

 

Back to From Specification to Optimal DFA. On to Introduction to Grammars and Parsing.

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 Fri Dec 6 10:37:58 2002.
The source to the document was last modified on Wed Sep 4 10:08:34 2002.
This document may be found at http://www.cs.grinnell.edu/~rebelsky/Courses/CS362/2002F/Outlines/outline.07.html.

You may wish to validate this document's HTML ; Valid CSS! ; Check with Bobby

Glimmer Labs: The Grinnell Laboratory for Interactive Multimedia Experimentation & Research
glimmer@grinnell.edu