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
Regular expression pattern matching has a simple and elegant implementation in SML using continuation passing.
[ CS 15-212 Home page | schedule | language | assignments | handouts ]