Lines Matching refs:LT
351 /// i<0 indicates nodes in the past. So LT(-1) is previous node, but
352 /// implementations are not required to provide results for k < -1.
353 /// LT(0) is undefined. For i>=n, return null.
354 /// Return null for LT(0) and any index that results in an absolute address
357 /// This is analogus to the LT() method of the TokenStream, but this
361 function LT(const K: Integer): IANTLRInterface;
728 function LT(const K: Integer): IANTLRInterface;
933 /// Compute a Map<String, Integer> that is an inverted index of
948 /// more efficient. Returns Map<Integer, List> where the List is
1066 /// of tokens is kept to efficiently and easily handle LT(i) calls, though
1414 function LT(const K: Integer): IANTLRInterface;
1967 /// <summary>Which node did we visit last? Used for LT(-1) calls. </summary>
1983 /// Buffer tree node stream for use with LT(i). This list grows
1989 /// <summary>lookahead[head] is the first symbol of lookahead, LT(1). </summary>
2000 /// The marker is an index into this stack. This is a List<TreeWalkState>.
2043 function LT(const K: Integer): IANTLRInterface; virtual;
2065 /// DOWN/UP nodes; those are only returned by the LT() method.
2081 /// this method, LT(1) will be lookahead[0].
2620 // sometimes resync does not consume a token (when LT(1) is
2623 // is consumed during recovery; LT(-1) will return null.
3117 Result := LT(1);
3168 Result := FAdaptor.GetNodeType(LT(I));
3187 function TCommonTreeNodeStream.LT(const K: Integer): IANTLRInterface;
3737 Result := FInput.LT(1);
3797 Look := FInput.LT(1);
3811 Look := FInput.LT(1);
3842 inherited TraceIn(RuleName, RuleIndex, FInput.LT(1).ToString);
3848 inherited TraceOut(RuleName, RuleIndex, FInput.LT(1).ToString);
4656 T := LT(I);
4676 function TUnBufferedTreeNodeStream.LT(const K: Integer): IANTLRInterface;
4726 LA[I] := LT(K);
