Parsing performance in ANTLR 4 is heavily influenced by both static factors (e.g. the form of the rules in the grammar) and dynamic factors (e.g. the choice of input and the state of the DFA cache at the time profiling operations are started). For best results, gather and use aggregate statistics from a large sample of inputs representing the inputs expected in production before using the results to make changes in the grammar.
| Modifier and Type | Field and Description |
|---|---|
| public final List | ambiguities
A collection of |
| public final List | contextSensitivities
A collection of |
| public final int | decision
The decision number, which is an index into |
| public final List | errors
A collection of |
| public long | invocations
The total number of times |
| public long | LL_ATNTransitions
The total number of ATN transitions required during LL prediction for this decision. |
| public long | LL_DFATransitions
The total number of DFA transitions required during LL prediction for this decision. |
| public long | LL_Fallback
Gets the total number of times SLL prediction completed in a conflict state, resulting in fallback to LL prediction. |
| public long | LL_MaxLook
Gets the maximum lookahead required for any single LL prediction to complete for this decision. |
| public LookaheadEventInfo | LL_MaxLookEvent
Gets the |
| public long | LL_MinLook
Gets the minimum lookahead required for any single LL prediction to complete for this decision. |
| public long | LL_TotalLook
The sum of the lookahead required for LL prediction for this decision. |
| public final List | predicateEvals
A collection of |
| public long | SLL_ATNTransitions
The total number of ATN transitions required during SLL prediction for this decision. |
| public long | SLL_DFATransitions
The total number of DFA transitions required during SLL prediction for this decision. |
| public long | SLL_MaxLook
Gets the maximum lookahead required for any single SLL prediction to complete for this decision, by reaching a unique prediction, reaching an SLL conflict state, or encountering a syntax error. |
| public LookaheadEventInfo | SLL_MaxLookEvent
Gets the |
| public long | SLL_MinLook
Gets the minimum lookahead required for any single SLL prediction to complete for this decision, by reaching a unique prediction, reaching an SLL conflict state, or encountering a syntax error. |
| public long | SLL_TotalLook
The sum of the lookahead required for SLL prediction for this decision. |
| public long | timeInPrediction
The total time spent in |
| Access | Constructor and Description |
|---|---|
| public | DecisionInfo(int
The decision number decision)Constructs a new instance of the |
| Modifier and Type | Method and Description |
|---|---|
| public String |
| ambiguities | back to summary |
|---|---|
| public final List<AmbiguityInfo> ambiguities A collection of
| |
| contextSensitivities | back to summary |
|---|---|
| public final List<ContextSensitivityInfo> contextSensitivities A collection of
| |
| decision | back to summary |
|---|---|
| public final int decision The decision number, which is an index into | |
| errors | back to summary |
|---|---|
| public final List<ErrorInfo> errors A collection of
| |
| invocations | back to summary |
|---|---|
| public long invocations The total number of times | |
| LL_ATNTransitions | back to summary |
|---|---|
| public long LL_ATNTransitions The total number of ATN transitions required during LL prediction for this decision. An ATN transition is determined by the number of times the DFA does not contain an edge that is required for prediction, resulting in on-the-fly computation of that edge. If DFA caching of LL transitions is employed by the implementation, ATN computation may cache the computed edge for efficient lookup during future parsing of this decision. Otherwise, the LL parsing algorithm will use ATN transitions exclusively. | |
| LL_DFATransitions | back to summary |
|---|---|
| public long LL_DFATransitions The total number of DFA transitions required during LL prediction for this decision. If the ATN simulator implementation does not use DFA caching for LL transitions, this value will be 0. | |
| LL_Fallback | back to summary |
|---|---|
| public long LL_Fallback Gets the total number of times SLL prediction completed in a conflict state, resulting in fallback to LL prediction. Note that this value is not related to whether or not
| |
| LL_MaxLook | back to summary |
|---|---|
| public long LL_MaxLook Gets the maximum lookahead required for any single LL prediction to
complete for this decision. An LL prediction completes when the algorithm
reaches a unique prediction, a conflict state (for
| |
| LL_MaxLookEvent | back to summary |
|---|---|
| public LookaheadEventInfo LL_MaxLookEvent Gets the | |
| LL_MinLook | back to summary |
|---|---|
| public long LL_MinLook Gets the minimum lookahead required for any single LL prediction to
complete for this decision. An LL prediction completes when the algorithm
reaches a unique prediction, a conflict state (for
| |
| LL_TotalLook | back to summary |
|---|---|
| public long LL_TotalLook The sum of the lookahead required for LL prediction for this decision. Note that LL prediction is only used when SLL prediction reaches a conflict state. | |
| predicateEvals | back to summary |
|---|---|
| public final List<PredicateEvalInfo> predicateEvals A collection of
| |
| SLL_ATNTransitions | back to summary |
|---|---|
| public long SLL_ATNTransitions The total number of ATN transitions required during SLL prediction for this decision. An ATN transition is determined by the number of times the DFA does not contain an edge that is required for prediction, resulting in on-the-fly computation of that edge. If DFA caching of SLL transitions is employed by the implementation, ATN computation may cache the computed edge for efficient lookup during future parsing of this decision. Otherwise, the SLL parsing algorithm will use ATN transitions exclusively. | |
| SLL_DFATransitions | back to summary |
|---|---|
| public long SLL_DFATransitions The total number of DFA transitions required during SLL prediction for this decision. If the ATN simulator implementation does not use DFA caching for SLL transitions, this value will be 0. | |
| SLL_MaxLook | back to summary |
|---|---|
| public long SLL_MaxLook Gets the maximum lookahead required for any single SLL prediction to complete for this decision, by reaching a unique prediction, reaching an SLL conflict state, or encountering a syntax error. | |
| SLL_MaxLookEvent | back to summary |
|---|---|
| public LookaheadEventInfo SLL_MaxLookEvent Gets the | |
| SLL_MinLook | back to summary |
|---|---|
| public long SLL_MinLook Gets the minimum lookahead required for any single SLL prediction to complete for this decision, by reaching a unique prediction, reaching an SLL conflict state, or encountering a syntax error. | |
| SLL_TotalLook | back to summary |
|---|---|
| public long SLL_TotalLook The sum of the lookahead required for SLL prediction for this decision.
Note that SLL prediction is used before LL prediction for performance
reasons even when | |
| timeInPrediction | back to summary |
|---|---|
| public long timeInPrediction The total time spent in
The value of this field contains the sum of differential results obtained
by | |
| DecisionInfo | back to summary |
|---|---|
| public DecisionInfo(int decision) Constructs a new instance of the
| |
| toString | back to summary |
|---|---|
| public String toString() Overrides java. Doc from java. Returns a string representation of the object. | |