DFA representation in JFlex.
Contains minimization algorithm.
addTransition
public void addTransition(int start,
char input,
int dest)
checkActions
public void checkActions(LexScan scanner,
LexParse parser)
Check that all actions can actually be matched in this DFA.
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()
Much simpler, but slower and less memory efficient minimization algorithm.
- the equivalence relation on states.
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)
setEntryState
public void setEntryState(int eState,
int trueState)
setFinal
public void setFinal(int state,
boolean isFinalState)
toString
public String toString()
toString
public String toString(int[] a)
writeDot
public void writeDot(File file)