Compilers (CS362 2004S)

Class 07: Regular Expressions, Continued

Back to Introduction to Lexical Analysis and Regular Expressions. On to Finite Automata.

Held: Wednesday, 4 February 2004

Summary: Today we continue our investigation of regular expressions.

Related Pages:

Overview:

Simplifying Regular Expressions

Regular Expression Shorthands

Sample Regular Expressions

Limitations

Using Regular Expressions for Lexical Analysis

Back to Introduction to Lexical Analysis and Regular Expressions. On to Finite Automata.

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 May 5 11:46:58 2004.
The source to the document was last modified on Tue Jan 20 23:06:45 2004.
This document may be found at http://www.cs.grinnell.edu/~rebelsky/Courses/CS362/2004S/Outlines/outline.07.html.

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

Samuel A. Rebelsky, rebelsky@grinnell.edu