/external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/ |
H A D | UnbufferedTokenStream.java | 43 * You can only look backwards 1 token: LT(-1). 75 public int LA(int i) { return LT(i).getType(); }
|
/external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/debug/ |
H A D | Tracer.java | 59 return ((TokenStream)input).LT(k);
|
/external/antlr/antlr-3.4/runtime/ObjC/Framework/ |
H A D | LookaheadStream.m | 108 public Object LT(int k) { 115 //System.out.print("LT(p="+p+","+k+")="); 116 if ( (p+k-1) >= eofElementIndex ) { // move to super.LT 134 public Object getCurrentSymbol() { return LT(1); }
|
H A D | ANTLRDebugEventListener.h | 59 * so that a GUI can easily track what LT/consume events are 80 * triggered by both LA and LT calls. The debugger will want to know 83 * ahead into a file it doesn't have so LT events must pass the token 86 - (void) LT:(NSInteger)i foundToken:(id<ANTLRToken>)t; 137 * caused the problem was the last object referenced by LT. The 138 * immediately preceding LT event should hold the unexpected Token or 151 * LT(1) 155 * LT(1) 159 * LT(1) 164 * LT( [all...] |
H A D | LookaheadStream.h | 108 public Object LT(int k) { function in class:FastQueue 115 //System.out.print("LT(p="+p+","+k+")="); 116 if ( (p+k-1) >= eofElementIndex ) { // move to super.LT 134 public Object getCurrentSymbol() { return LT(1); }
|
/external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/Perl5/ |
H A D | ASTTreeParser.stg | 68 _last = (<ASTLabelType>)input.LT(1); 109 _last = (<ASTLabelType>)input.LT(1); 115 _last = (<ASTLabelType>)input.LT(1); 140 _last = (<ASTLabelType>)input.LT(1); 163 _last = (<ASTLabelType>)input.LT(1); 185 _last = (<ASTLabelType>)input.LT(1); 209 _last = (<ASTLabelType>)input.LT(1); 227 _last = (<ASTLabelType>)input.LT(1);
|
/external/dexmaker/src/main/java/com/google/dexmaker/ |
H A D | Comparison.java | 29 LT() { method in enum:Comparison
|
/external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Headers/ |
H A D | ANTLRDebugEventListener.h | 59 * so that a GUI can easily track what LT/consume events are 80 * triggered by both LA and LT calls. The debugger will want to know 83 * ahead into a file it doesn't have so LT events must pass the token 86 - (void) LT:(NSInteger)i foundToken:(id<ANTLRToken>)t; 137 * caused the problem was the last object referenced by LT. The 138 * immediately preceding LT event should hold the unexpected Token or 151 * LT(1) 155 * LT(1) 159 * LT(1) 164 * LT( [all...] |
H A D | ANTLRDebugEventProxy.h | 83 - (void) LT:(NSInteger)i foundToken:(id<ANTLRToken>)t; 100 - (void) LT:(NSInteger)i foundNode:(unsigned)nodeHash ofType:(NSInteger)type text:(NSString *)text;
|
/external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Versions/A/Headers/ |
H A D | ANTLRDebugEventListener.h | 59 * so that a GUI can easily track what LT/consume events are 80 * triggered by both LA and LT calls. The debugger will want to know 83 * ahead into a file it doesn't have so LT events must pass the token 86 - (void) LT:(NSInteger)i foundToken:(id<ANTLRToken>)t; 137 * caused the problem was the last object referenced by LT. The 138 * immediately preceding LT event should hold the unexpected Token or 151 * LT(1) 155 * LT(1) 159 * LT(1) 164 * LT( [all...] |
H A D | ANTLRDebugEventProxy.h | 83 - (void) LT:(NSInteger)i foundToken:(id<ANTLRToken>)t; 100 - (void) LT:(NSInteger)i foundNode:(unsigned)nodeHash ofType:(NSInteger)type text:(NSString *)text;
|
/external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Versions/Current/Headers/ |
H A D | ANTLRDebugEventListener.h | 59 * so that a GUI can easily track what LT/consume events are 80 * triggered by both LA and LT calls. The debugger will want to know 83 * ahead into a file it doesn't have so LT events must pass the token 86 - (void) LT:(NSInteger)i foundToken:(id<ANTLRToken>)t; 137 * caused the problem was the last object referenced by LT. The 138 * immediately preceding LT event should hold the unexpected Token or 151 * LT(1) 155 * LT(1) 159 * LT(1) 164 * LT( [all...] |
/external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/tree/ |
H A D | TreeParser.java | 82 return ((TreeNodeStream)input).LT(1); 103 Object look = input.LT(1); 114 look = input.LT(1); 173 return inContext(input.getTreeAdaptor(), getTokenNames(), input.LT(1), context); 232 super.traceIn(ruleName, ruleIndex, input.LT(1)); 236 super.traceOut(ruleName, ruleIndex, input.LT(1));
|
/external/v8/src/ |
H A D | token.h | 94 T(LT, "<", 10) \ 179 // (e.g. "LT" for the token LT). 207 return op == LT || op == LTE || op == GT || op == GTE; 230 case LT: return GTE; 233 case GTE: return LT; 247 case LT: return GT; 248 case GT: return LT; 274 // (.e., "<" for the token LT) or NULL if the token doesn't
|
/external/llvm/lib/Target/AArch64/ |
H A D | AArch64ConditionOptimizer.cpp | 15 // * LT -> LE 16 // * LE -> LT 208 case AArch64CC::LT: return AArch64CC::LE; 209 case AArch64CC::LE: return AArch64CC::LT; 215 // Transforms GT -> GE, GE -> GT, LT -> LE, LE -> LT by updating comparison 370 if (((HeadCmp == AArch64CC::GT && TrueCmp == AArch64CC::LT) || 371 (HeadCmp == AArch64CC::LT && TrueCmp == AArch64CC::GT)) && 392 (HeadCmp == AArch64CC::LT && TrueCmp == AArch64CC::LT)) [all...] |
/external/llvm/lib/Target/PowerPC/ |
H A D | PPCTargetTransformInfo.cpp | 316 std::pair<unsigned, MVT> LT = TLI->getTypeLegalizationCost(Src); local 324 if (LT.second == MVT::v2f64 || LT.second == MVT::v2i64) 330 Src->getPrimitiveSizeInBits() >= LT.second.getSizeInBits() && 331 LT.second.getSizeInBits() == 128 && 336 unsigned SrcBytes = LT.second.getStoreSize(); 338 Cost += LT.first*(SrcBytes/Alignment-1);
|
/external/antlr/antlr-3.4/runtime/Python/antlr3/ |
H A D | exceptions.py | 120 self.token = self.input.LT(1) 129 self.c = self.input.LT(1) 140 self.node = nodes.LT(1) 148 priorNode = nodes.LT(i) 159 priorNode = nodes.LT(i)
|
/external/antlr/antlr-3.4/tool/src/main/antlr3/org/antlr/grammar/v3/ |
H A D | ANTLR.g | 162 // sometimes resync does not consume a token (when LT(1) is 165 // is consumed during recovery; LT(-1) will return null. 283 private final Token LT(int k) { return input.LT( k ); } 410 // token = LT( 1 ); 560 CommonToken start = (CommonToken)LT(1); 561 int startLine = LT(1).getLine(); 633 : ( -> BLOCK[input.LT(-1),"BLOCK"] ) 695 -> ^(ALT[$start,"ALT"] element+ EOA[input.LT(-1),"<end-of-alt>"]) 697 -> ^(ALT[$start,"ALT"] EPSILON[input.LT( [all...] |
/external/antlr/antlr-3.4/runtime/Delphi/Sources/Antlr3.Runtime.Tests/ |
H A D | Antlr.Runtime.Tree.Tests.pas | 628 T := Nodes.LT(I + 1); 724 /// Use Consume() to advance N nodes into lookahead. Then use LT() 748 Node := Stream.LT(1) as ITree; 753 // now use LT to lookahead past end of buffer 759 Node := Stream.LT(I) as ITree; // look ahead to ith token 826 CheckEquals((Stream.LT(1) as ITree).TokenType,101); 827 CheckEquals((Stream.LT(2) as ITree).TokenType,TToken.DOWN); 828 CheckEquals((Stream.LT(3) as ITree).TokenType,102); 829 CheckEquals((Stream.LT(4) as ITree).TokenType,TToken.DOWN); 830 CheckEquals((Stream.LT( [all...] |
/external/antlr/antlr-3.4/runtime/ObjC/Framework/examples/treerewrite/ |
H A D | TreeRewriteParser.m | 216 [retval setStart:[input LT:1]]; 291 [retval setStop:[input LT:-1]]; 305 retval.tree = (ANTLRCommonTree *)[treeAdaptor errorNode:input From:retval.start To:[input LT:-1] Exception:re]; 328 [retval setStart:[input LT:1]]; 358 [retval setStop:[input LT:-1]]; 370 retval.tree = (ANTLRCommonTree *)[treeAdaptor errorNode:input From:retval.start To:[input LT:-1] Exception:re];
|
/external/boringssl/src/crypto/perlasm/ |
H A D | x86masm.pl | 82 IF \@Version LT 800 88 IF \@Version LT 800 123 IF \@Version LT 800
|
/external/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/duration/ |
H A D | Period.java | 65 return new Period(ETimeLimit.LT, false, count, unit); 118 return setTimeLimit(ETimeLimit.LT); 234 return timeLimit == ETimeLimit.LT;
|
/external/smali/smali/src/main/java/org/jf/smali/ |
H A D | smaliParser.java | 489 retval.start = input.LT(1); 727 retval.stop = input.LT(-1); 736 retval.tree = (CommonTree)adaptor.errorNode(input, retval.start, input.LT(-1), re); 759 retval.start = input.LT(1); 811 retval.stop = input.LT(-1); 820 retval.tree = (CommonTree)adaptor.errorNode(input, retval.start, input.LT(-1), re); 841 retval.start = input.LT(1); 891 retval.stop = input.LT(-1); 900 retval.tree = (CommonTree)adaptor.errorNode(input, retval.start, input.LT(-1), re); 921 retval.start = input.LT( [all...] |
/external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime.Test/BuildOptions/ |
H A D | DebugGrammarParser.cs | 134 retval.start = input.LT(1); 222 retval.stop = input.LT(-1); 232 retval.tree = (CommonTree)adaptor.ErrorNode(input, retval.start, input.LT(-1), re); 266 retval.start = input.LT(1); 509 retval.stop = input.LT(-1); 519 retval.tree = (CommonTree)adaptor.ErrorNode(input, retval.start, input.LT(-1), re); 553 retval.start = input.LT(1); 661 retval.stop = input.LT(-1); 671 retval.tree = (CommonTree)adaptor.ErrorNode(input, retval.start, input.LT(-1), re); 708 retval.start = input.LT( [all...] |
H A D | ProfileGrammarParser.cs | 138 retval.start = input.LT(1); 226 retval.stop = input.LT(-1); 236 retval.tree = (CommonTree)adaptor.ErrorNode(input, retval.start, input.LT(-1), re); 270 retval.start = input.LT(1); 513 retval.stop = input.LT(-1); 523 retval.tree = (CommonTree)adaptor.ErrorNode(input, retval.start, input.LT(-1), re); 557 retval.start = input.LT(1); 665 retval.stop = input.LT(-1); 675 retval.tree = (CommonTree)adaptor.ErrorNode(input, retval.start, input.LT(-1), re); 712 retval.start = input.LT( [all...] |