Lines Matching refs:LA
74 /// Negative indexes are allowed. LA(-1) is previous token (token just matched).
75 /// LA(-i) where i is before first token should yield -1, invalid char or EOF.
77 function LA(I: Integer): Integer;
162 /// The index is 0..N-1. A seek to position i means that LA(1) will return
163 /// the ith symbol. So, seeking to 0 means LA(1) will return the first
199 /// LA(I). This will be used for labels in the generated lexer code.
201 /// better to be 32-bit clean and be consistent with LA.
1652 function LA(I: Integer): Integer; virtual;
2032 /// LA(1) is not what we are looking for. If LA(2) has the right token,
2033 /// however, then assume LA(1) is some extra spurious token. Delete it
2034 /// and LA(2) as if we were doing a normal Match(), which advances the
2053 /// mismatched token error. To Recover, it sees that LA(1)==';'
2138 /// token mismatch. Upon token mismatch, if LA(1) is member of
2203 * In this case, for input "[]", LA(1) is in this set so we would
2207 * exception (since LA(1) is not in the viable following token
2345 function LA(I: Integer): Integer; virtual;
2864 FC := AInput.LA(1);
2869 FC := AInput.LA(1);
3218 function TANTLRStringStream.LA(I: Integer): Integer;
3225 Inc(I); // e.g., translate LA(-1) to use offset i=0; then data[p+0-1]
3242 Result := Char(LA(I));
3247 Result := LA(I);
4211 TType := Input.LA(1);
4215 TType := Input.LA(1);
4262 TType := Input.LA(1);
4266 TType := Input.LA(1);
4492 if (Input.LA(1) = TokenType) then
4574 if (Follow2.Member(Input.LA(1)) or Follow2.Member(TToken.EOR_TOKEN_TYPE)) then
4584 Result := (Input.LA(2) = TokenType);
4891 function TCommonTokenStream.LA(I: Integer): Integer;
4898 Result := Char(LA(I));
5164 C := Char(Input.LA(1)); // -1 == \uFFFF, all tokens fit in 65000 space
5462 if (FInput.LA(1) <> Integer(S[I])) then
5482 if (FInput.LA(1) <> C) then
5506 if (FInput.LA(1) < A) or (FInput.LA(1) > B) then
5531 if (FInput.LA(1) = Integer(cscEOF)) then
