Building a recognizer
Building a recognizer
A General Approach
- Build Nondeterministic Finite Automaton (NFA) from Regular Expression E.
- Simulate execution of NFA to determine whether an input string belongs to L(E).
- The simulation can be much simplified if
- you convert your NFA to Deterministic Finite Automaton (DFA).