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.
<p>
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.</p>
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.
<p> 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.</p>
@see #LL_DFATransitions @see ParserATNSimulator#computeTargetState @see LexerATNSimulator#computeTargetState