JFlex
public final class DFA extends Object
Field Summary | |
---|---|
static int | NO_TARGET
The code for "no target state" in the transition table. |
Constructor Summary | |
---|---|
DFA(int numEntryStates, int numInp, int numLexStates) |
Method Summary | |
---|---|
void | addTransition(int start, char input, int dest) |
void | checkActions(LexScan scanner, LexParse parser)
Check that all actions can actually be matched in this DFA. |
String | dotFormat() |
void | minimize()
Implementation of Hopcroft's O(n log n) minimization algorithm, follows
description by D. |
boolean[][] | old_minimize()
Much simpler, but slower and less memory efficient minimization algorithm.
|
void | printBlocks(int[] b, int[] b_f, int[] b_b, int last) |
void | printInvDelta(int[][] inv_delta, int[] inv_delta_set) |
void | printL(int[] l_f, int[] l_b, int anchor) |
void | printTable(boolean[][] equiv) |
void | setAction(int state, Action stateAction) |
void | setEntryState(int eState, int trueState) |
void | setFinal(int state, boolean isFinalState) |
String | toString() |
String | toString(int[] a) |
void | writeDot(File file) |
Returns: the equivalence relation on states.