COMS W4115
Programming Languages and Translators
Lecture 7: Implementing a Lexical Analyzer
February 13, 2008

Lecture Outline

  1. Review
  2. Finite automata
  3. Converting a regular expression to an NFA
  4. Converting an NFA to a DFA
  5. Simulating an NFA

1. Review

2. Finite Automata

3. Converting a Regular Expression to an NFA

4. Converting an NFA to a DFA

5. Simulating an NFA

6. Reading Assignment



aho@cs.columbia.edu