A Deterministic Finite Automaton (DFA) is used by the engine's tokenizer to read the source string and break it into individual tokens. When a grammar is analyzed, conflicts can occur when two or more terminal definitions can accept the same text.
The DFA State Browser functions much like a common Internet web browser. If you double click on any of the "Goto" links, the window will automatically advance to that state. At the bottom of the window, there are a number of simple controls that allow you to jump to any state in table or return to the last state you were examining.
The "Back" and "Forward" buttons function exactly like those found on an Internet web browser. To the right of these buttons, a series of controls allow you jump to any state in the table.
