Simulation of NFA
Simulation of NFA
An epsilon closure of a state x is the set of states that
can be reached (including itself) by making just transition
labeled with epsilon.
We want to get the next token from the input stream.
Properties:
1. The longest sequence of characters starting at the
current position that matches a regular exp. for a token.
2. Input buffer is repositioned to the first character
following the token.
3. Nothing gets read after the end-of-file.