| issueWarnings() |  | 0% |  | 0% | 24 | 24 | 48 | 48 | 1 | 1 |
| getNFAPath(NFAState, int, List, List) |  | 0% |  | 0% | 9 | 9 | 31 | 31 | 1 | 1 |
| computeAltToProblemMaps(Set, Map, Map, Map) |  | 0% |  | 0% | 6 | 6 | 25 | 25 | 1 | 1 |
| reachesState(DFAState, DFAState, Set) |  | 0% |  | 0% | 7 | 7 | 23 | 23 | 1 | 1 |
| stripWildCardAlts(Set) |  | 0% |  | 0% | 5 | 5 | 14 | 14 | 1 | 1 |
| issueRecursionWarnings() |  | 0% |  | 0% | 2 | 2 | 18 | 18 | 1 | 1 |
| getNFAPathStatesForAlt(int, int, List) |  | 0% |  | 0% | 2 | 2 | 12 | 12 | 1 | 1 |
| getSampleInputSequenceUsingStateSet(State, State, Set, List) |  | 0% |  | 0% | 5 | 5 | 12 | 12 | 1 | 1 |
| DecisionProbe(DFA) |  | 0% | | n/a | 1 | 1 | 13 | 13 | 1 | 1 |
| isDeterministic() |  | 0% |  | 0% | 7 | 7 | 11 | 11 | 1 | 1 |
| getInputSequenceDisplay(List) |  | 0% |  | 0% | 4 | 4 | 9 | 9 | 1 | 1 |
| getTokenNameForTokensRuleAlt(int) |  | 0% | | n/a | 1 | 1 | 7 | 7 | 1 | 1 |
| getSampleNonDeterministicInputSequence(DFAState) |  | 0% |  | 0% | 3 | 3 | 7 | 7 | 1 | 1 |
| getUnaliasedDFAStateSet(Set) |  | 0% |  | 0% | 2 | 2 | 6 | 6 | 1 | 1 |
| getDFAPathStatesToTarget(DFAState) |  | 0% |  | 0% | 3 | 3 | 6 | 6 | 1 | 1 |
| reportNondeterminismResolvedWithSemanticPredicate(DFAState) |  | 0% |  | 0% | 2 | 2 | 6 | 6 | 1 | 1 |
| reportNondeterminism(DFAState, Set) |  | 0% | | n/a | 1 | 1 | 5 | 5 | 1 | 1 |
| getNonDeterministicAltsForState(DFAState) |  | 0% |  | 0% | 2 | 2 | 7 | 7 | 1 | 1 |
| reportNonLLStarDecision(DFA) |  | 0% | | n/a | 1 | 1 | 4 | 4 | 1 | 1 |
| getStateLabelIndexKey(int, int) |  | 0% | | n/a | 1 | 1 | 5 | 5 | 1 | 1 |
| getSemanticContextForAlt(DFAState, int) |  | 0% |  | 0% | 2 | 2 | 4 | 4 | 1 | 1 |
| reportAltPredicateContext(DFAState, Map) |  | 0% | | n/a | 1 | 1 | 4 | 4 | 1 | 1 |
| reportRecursionOverflow(DFAState, NFAConfiguration) |  | 0% |  | 0% | 2 | 2 | 4 | 4 | 1 | 1 |
| static {...} |  | 0% | | n/a | 1 | 1 | 4 | 4 | 1 | 1 |
| removeRecursiveOverflowState(DFAState) |  | 0% | | n/a | 1 | 1 | 3 | 3 | 1 | 1 |
| analysisOverflowed() |  | 0% |  | 0% | 2 | 2 | 1 | 1 | 1 | 1 |
| hasPredicate() |  | 0% |  | 0% | 2 | 2 | 1 | 1 | 1 | 1 |
| reportLexerRuleNondeterminism(DFAState, Set) |  | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| reportIncompletelyCoveredAlts(DFAState, Map) |  | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| getIncompletelyCoveredAlts(DFAState) |  | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| reportDanglingState(DFAState) |  | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| getDescription() |  | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| isReduced() |  | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| isCyclic() |  | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| getNumberOfStates() |  | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| getUnreachableAlts() |  | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| reset() |  | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| isNonLLStarDecision() |  | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| getDanglingStates() |  | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| getNonDeterministicAlts() |  | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| getDFAStatesWithSyntacticallyAmbiguousAlts() |  | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| getDisabledAlternatives(DFAState) |  | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| getNondeterministicStatesResolvedWithSemanticPredicate() |  | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |