next up previous
Next: NFA -> DFA Up: Lexical Analysis Previous: Finite Automata

RE -> NFA

Figure 3.40: NFA for union of regular expressions
Figure 3.41: NFA for concatenation of regular expressions
Figure 3.42: NFA for closure of regular expression
Figure 3.43: Parse tree for (a|b)*abb
Figure 3.44: NFA for $R_3$
Figure 3.45: NFA for $R_5$
Figure 3.46: NFA for $R_7$
Figure 3.34: NFA for (a|b)*abb



CS 631 Class Account 2009-10-13