DFA representation in JFlex.
Contains minimization algorithm.
addTransition
public void addTransition(int start,
char input,
int dest)
dotFormat
public String dotFormat()
minimize
public void minimize()
Implementation of Hopcroft's O(n log n) minimization algorithm, follows
description by D. Gries.
Time: O(n log n)
Space: O(c n), size <324*(5*c*n + 13*n + 3*c) byte
old_minimize
public boolean[][] old_minimize()
printBlocks
public void printBlocks(int[] b,
int[] b_f,
int[] b_b,
int last)
printInvDelta
public void printInvDelta(int[][] inv_delta,
int[] inv_delta_set)
printL
public void printL(int[] l_f,
int[] l_b,
int anchor)
printTable
public void printTable(boolean[][] equiv)
setAction
public void setAction(int state,
Action stateAction)
setFinal
public void setFinal(int state,
boolean isFinalState)
setLexState
public void setLexState(int lState,
int trueState)
setPushback
public void setPushback(int state,
boolean isPushbackState)
toString
public String toString()
toString
public String toString(int[] a)
writeDot
public void writeDot(File file)