HomeSort by relevance Sort by last modified time
    Searched refs:LA (Results 176 - 200 of 213) sorted by null

1 2 3 4 5 6 78 9

  /external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/JavaScript/
ASTTreeParser.stg 57 if ( this.input.LA(1)==org.antlr.runtime.Token.DOWN ) {
  /external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/Perl5/
ASTTreeParser.stg 86 if ( input.LA(1)==Token.DOWN ) {
  /external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/Python/
ASTTreeParser.stg 95 if self.input.LA(1) == DOWN:
  /external/antlr/antlr-3.4/runtime/ActionScript/project/src/org/antlr/runtime/tree/
CommonTreeNodeStream.as 272 public function LA(i:int):int {
  /external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/tree/
BufferedTreeNodeStream.java 305 public int LA(int i) {
  /external/antlr/antlr-3.4/runtime/JavaScript/src/org/antlr/runtime/tree/
CommonTreeNodeStream.js 229 LA: function(i) {
  /external/antlr/antlr-3.4/runtime/Python/antlr3/
exceptions.py 134 self.c = self.input.LA(1)
streams.py 63 def LA(self, i):
66 Negative indexes are allowed. LA(-1) is previous token (token
67 just matched). LA(-i) where i is before first token should
154 The index is 0..n-1. A seek to position i means that LA(1) will
155 return the ith symbol. So, seeking to 0 means LA(1) will return the
209 LA(i). This will be used for labels in the generated
211 probably better to be 32-bit clean and be consistent with LA.
402 def LA(self, i):
407 i += 1 # e.g., translate LA(-1) to use offset i=0; then data[p+0-1]
421 i += 1 # e.g., translate LA(-1) to use offset i=0; then data[p+0-1
    [all...]
  /external/antlr/antlr-3.4/runtime/Delphi/Sources/Antlr3.Runtime/
Antlr.Runtime.pas 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.
    [all...]
Antlr.Runtime.Tree.pas     [all...]
  /external/llvm/lib/Analysis/
ScalarEvolution.cpp 502 if (const Argument *LA = dyn_cast<Argument>(LV)) {
504 unsigned LArgNo = LA->getArgNo(), RArgNo = RA->getArgNo();
537 const APInt &LA = LC->getValue()->getValue();
539 unsigned LBitWidth = LA.getBitWidth(), RBitWidth = RA.getBitWidth();
542 return LA.ult(RA) ? -1 : 1;
546 const SCEVAddRecExpr *LA = cast<SCEVAddRecExpr>(LHS);
550 const Loop *LLoop = LA->getLoop(), *RLoop = RA->getLoop();
559 unsigned LNumOps = LA->getNumOperands(), RNumOps = RA->getNumOperands();
565 long X = compare(LA->getOperand(i), RA->getOperand(i));
    [all...]
  /cts/tools/signature-tools/lib/
antlr-2.7.7.jar 
  /external/llvm/include/llvm/Target/
TargetLowering.h     [all...]
  /external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Tree/
BufferedTreeNodeStream.cs 384 public virtual int LA(int i) {
  /external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/Tree/
BufferedTreeNodeStream.cs 453 public virtual int LA( int i )
  /external/antlr/antlr-3.4/tool/src/main/antlr3/org/antlr/grammar/v3/
ActionTranslator.g 270 {enclosingRule!=null && input.LA(1)!='=' &&
326 : '$' x=ID '.' y=ID WS? '=' {enclosingRule!=null && input.LA(1)!='='}?
ANTLRv3.g 480 : '/*' {if (input.LA(1)=='*') $type=DOC_COMMENT; else $channel=HIDDEN;} .* '*/'
  /external/antlr/antlr-3.4/gunit/src/main/antlr3/org/antlr/gunit/swingui/parsers/
ANTLRv3.g 474 : '/*' {if (input.LA(1)=='*') $type=DOC_COMMENT; else $channel=HIDDEN;} .* '*/'
  /external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/CSharp2/
ASTTreeParser.stg 87 if (input.LA(1) == TokenTypes.Down) {
  /external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/CSharp3/
ASTTreeParser.stg 88 if (input.LA(1) == TokenTypes.Down) {
  /external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/ObjC/
ASTTreeParser.stg 130 if ( [input LA:1] == ANTLRTokenTypeDOWN ) {
  /external/llvm/lib/Target/ARM/
ARMConstantIslandPass.cpp 140 unsigned LA = std::max(unsigned(PostAlign), LogAlign);
141 if (!LA)
144 return PO + UnknownPadding(LA, internalKnownBits());
    [all...]
  /external/libffi/src/mips/
n32.S 408 LA t9, ffi_closure_mips_inner_N32
  /external/smali/smali/src/main/antlr3/org/jf/smali/
smaliParser.g 362 ( ({input.LA(1) == ANNOTATION_DIRECTIVE}? annotation {annotations.add($annotation.tree);})*
622 ({input.LA(1) == ANNOTATION_DIRECTIVE}? annotation {annotations.add($annotation.tree);})*
    [all...]
  /external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime.Tests/
ITreeNodeStreamFixture.cs 497 while (stream.LA(1) != Token.EndOfFile)

Completed in 2724 milliseconds

1 2 3 4 5 6 78 9