15-212: Principles of Programming

Lecture 10: Regular Expressions

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

Sample Code

Sample Evaluation


On-line Notes by Robert Harper

Suggested Reading in Programming in Standard ML:

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

Michael Erdmann