CS362 2011F Compilers

Class 07: Regular Expressions

Back to A Hand-Coded Lexical Analyzer. On to Finite Automata.

This outline is also available in PDF.

Held: Friday, 9 September 2011

Summary: We consider regular expressions, a popular mechanism for describing sets of strings. Regular expressions are often used to define the tokens in a language.

Related Pages:

Notes:

Overview:

Regular Expressions

Simplifying Regular Expressions

Regular Expression Shorthands

Sample Regular Expressions

Limitations

Using Regular Expressions for Lexical Analysis

Lab on Regular Expressions

Back to A Hand-Coded Lexical Analyzer. 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 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.07.html.

Samuel A. Rebelsky, rebelsky@grinnell.edu