closure(NFAState, int, NFAContext, SemanticContext, DFAState, boolean) |  | 0% |  | 0% | 25 | 25 | 62 | 62 | 1 | 1 |
getPredicatesPerNonDeterministicAlt(DFAState, Set) |  | 0% |  | 0% | 18 | 18 | 46 | 46 | 1 | 1 |
tryToResolveWithSemanticPredicates(DFAState, Set) |  | 0% |  | 0% | 14 | 14 | 42 | 42 | 1 | 1 |
findNewDFAStatesAndAddDFATransitions(DFAState) |  | 0% |  | 0% | 13 | 13 | 33 | 33 | 1 | 1 |
resolveNonDeterminisms(DFAState) |  | 0% |  | 0% | 14 | 14 | 29 | 29 | 1 | 1 |
addPredicateTransitions(DFAState) |  | 0% |  | 0% | 6 | 6 | 22 | 22 | 1 | 1 |
computeStartState() |  | 0% |  | 0% | 5 | 5 | 26 | 26 | 1 | 1 |
reach(DFAState, Label) |  | 0% |  | 0% | 10 | 10 | 20 | 20 | 1 | 1 |
convert() |  | 0% |  | 0% | 7 | 7 | 18 | 18 | 1 | 1 |
addTransition(DFAState, Label, DFAState, Map) |  | 0% |  | 0% | 5 | 5 | 18 | 18 | 1 | 1 |
convertToEOTAcceptState(DFAState) |  | 0% |  | 0% | 5 | 5 | 15 | 15 | 1 | 1 |
closure(DFAState) |  | 0% |  | 0% | 4 | 4 | 12 | 12 | 1 | 1 |
convertToAcceptState(DFAState, int) |  | 0% |  | 0% | 11 | 11 | 16 | 16 | 1 | 1 |
addDFAStateToWorkList(DFAState) |  | 0% |  | 0% | 3 | 3 | 10 | 10 | 1 | 1 |
max(Set) |  | 0% |  | 0% | 5 | 5 | 14 | 14 | 1 | 1 |
turnOffOtherAlts(DFAState, int, Set) |  | 0% |  | 0% | 5 | 5 | 8 | 8 | 1 | 1 |
resolveByChoosingFirstAlt(DFAState, Set) |  | 0% |  | 0% | 3 | 3 | 7 | 7 | 1 | 1 |
initContextTrees(int) |  | 0% |  | 0% | 2 | 2 | 5 | 5 | 1 | 1 |
getUnionOfPredicates(Map) |  | 0% |  | 0% | 3 | 3 | 10 | 10 | 1 | 1 |
getMinAlt(Set) |  | 0% |  | 0% | 3 | 3 | 7 | 7 | 1 | 1 |
NFAToDFAConverter(DFA) |  | 0% | | n/a | 1 | 1 | 7 | 7 | 1 | 1 |
resolveByPickingMinAlt(DFAState, Set) |  | 0% |  | 0% | 2 | 2 | 5 | 5 | 1 | 1 |
resolveByPickingExitAlt(DFAState, Set) |  | 0% | | n/a | 1 | 1 | 3 | 3 | 1 | 1 |
closureIsBusy(DFAState, NFAConfiguration) |  | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
static {...} |  | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |