Thomson's Construction (cont.) For regular expression ri r2 N(r2) Final state of N(r2)become final state of N(r r2) NFA for rr2 For regular expression r* N(r) NFA for r CS308 Compiler Theory 16Thomson’s Construction (cont.) • For regular expression r1 r 2 i f N(r2 N(r ) 1) Final state of N(r 2) become final state of N(r1r 2 ) NFA for r1 r 2 • For re gular ex pression r * g p i N(r) f ε ε ε NFA for r * ε CS308 Compiler Theory 16