NFA Contd
NFA Contd
of E to the constructed final state. Finally add an
epsilon transition from the final state of E to the
start state of E.
This gives an algorithm to construct the transition
graph from a regular expression.
e.g.. identifier, comments, floating constants.