Modifier and Type | Field and Description |
---|---|
java.util.Map<java.lang.Class<?>,monq.jfa.Statistics.Int> |
charTransTypes
type and number of CharTrans implementations used
|
int |
longestPathlen
longest loop free path to a stop state
|
int |
nfaStates
number of states with at least one epsilon move.
|
int |
numStates
the number of states in the FA
|
int |
shortestPathlen
shortest path to a stop state
|
int |
stopStates
number of stop states found
|
Modifier and Type | Method and Description |
---|---|
static Statistics |
getStatistics(Dfa dfa,
java.io.Writer w)
same as
getStatistics(Nfa,Writer) but for a Dfa . |
static Statistics |
getStatistics(Nfa nfa,
java.io.Writer w)
compute statistical data for a
Nfa . |
void |
print(java.io.PrintWriter pw)
dumps the object's contents.
|
public int numStates
public int nfaStates
public int stopStates
public int shortestPathlen
public int longestPathlen
public java.util.Map<java.lang.Class<?>,monq.jfa.Statistics.Int> charTransTypes
public void print(java.io.PrintWriter pw)
public static Statistics getStatistics(Nfa nfa, java.io.Writer w) throws java.io.IOException
Nfa
. If the given
Writer
is not null
, regular expressions
describing the shortest path to stop states are printed.java.io.IOException
public static Statistics getStatistics(Dfa dfa, java.io.Writer w) throws java.io.IOException
getStatistics(Nfa,Writer)
but for a Dfa
.java.io.IOException