next up previous
Next: RE -> NFA Up: Lexical Analysis Previous: Regular Expressions

Finite Automata

Figure 3.10: Grammar for if statements
Figure 3.11: Token definitions
Figure 3.12: Tokens and attributes
Figure 3.18: Psuedocode for relop token

NFAs

Figure 3.24: NFA for (a|b)*abb
Figure 3.25: Transition table for NFA 3.24

DFAs

Figure 3.27: DFA simulator
Figure 3.28: DFA for (a|b)*abb



CS 631 Class Account 2009-10-13