This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: ﬁrst gave some example applications. We looked at manually-written scanner code, trying to extract the “what” (declarations) from the “how” (plumbing code). We saw that we were actually implementing a ﬁnite automaton. OK, so how do we specify a ﬁnite automaton? Regular expressions! I introduced the ﬁrst syntax and semantics of a language here, the language of regular expressions. We then introduced the notions of deterministic and nondeterministic automata. NFA, DFA, and regular expressions have the same expressive power. (What does that mean, and how do you prove it?) We will now continue with real-world string manipulation languages. 2...
View Full Document
- Spring '09
- Regular expression, regular expressions