15-212: Principles of Programming

Regular expressions--and their underlying finite-state automata--are useful in many different applications, and are central to text processing languages and tools such as awk, Perl, emacs and grep.

Regular expression pattern matching has a simple and elegant implementation in SML using continuation passing.

Key Concepts

• Formal language
• Finite-state automaton
• Regular expression
• Continuation passing
• Proof-directed debugging

Sample Code

Sample Evaluation

Handouts

• Some notes on regular expressions

On-line Notes by Robert Harper

• Proof-Directed Debugging

Suggested Reading in Programming in Standard ML:

• Chapter 27: Proof-Directed Debugging

[ CS 15-212 Home page | schedule | language | assignments | handouts ]

Michael Erdmann