Converting A Regular Expression into A NFA (Thomson's Construction) This is one way to convert a regular expression into a NFA. There can be other ways(much efficient)for the conversion. Thomson's Construction is simple and systematic method. It guarantees that the resulting NFA will have exactly one final state, and one start state. Construction starts from simplest parts(alphabet symbols). To create a NFA for a complex regular expression,NFAs of its sub-expressions are combined to create its NFA, CS308 Compiler Theory 14Converting A Regular Expression into A NFA (Thomson’s Construction) (Thomson’s Construction) • This is one way to convert a regular expression into a NFA. • There can be other ways (much efficient) for the conversion. • Thomson’s Construction is simple and systematic method. It guarantees that the resulting NFA will have exactly one final state, and one start state. • C t ti t t f i l t t ( l h b t b l ) Cons truction s tar ts from s imp les t par ts ( a l p h a b e t sym b o l s ). To create a NFA for a complex regular expression, NFAs of its sub -expressions are combined to create its NFA expressions are combined to create its NFA, CS308 Compiler Theory 14