| /external/chromium_org/v8/src/ |
| token.h | 116 T(LT, "<", 10) \
197 // (e.g. "LT" for the token LT).
225 return op == LT || op == LTE || op == GT || op == GTE;
248 case LT: return GTE;
251 case GTE: return LT;
265 case LT: return GT;
266 case GT: return LT;
292 // (.e., "<" for the token LT) or NULL if the token doesn't
|
| /external/v8/src/ |
| token.h | 115 T(LT, "<", 10) \
195 // (e.g. "LT" for the token LT).
219 return op == LT || op == LTE || op == GT || op == GTE;
232 case LT: return GTE;
235 case GTE: return LT;
247 case LT: return GT;
248 case GT: return LT;
273 // (.e., "<" for the token LT) or NULL if the token doesn't
|
| /external/dropbear/libtomcrypt/src/ciphers/safer/ |
| saferp.c | 122 * Each round of LT starts in 'b' and ends in 'b2'.
124 #define LT(b, b2) \
151 LT(b, b2);
165 #undef LT
166 #define LT(b, b2) _lt(b, b2)
347 ROUND(b, 0); LT(b, ct);
348 ROUND(ct, 2); LT(ct, b);
349 ROUND(b, 4); LT(b, ct);
350 ROUND(ct, 6); LT(ct, b);
351 ROUND(b, 8); LT(b, ct)
[all...] |
| /external/antlr/antlr-3.4/tool/src/main/antlr3/org/antlr/grammar/v3/ |
| 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(-1),"epsilon"] EOA[input.LT(-1),"<end-of-alt>"]
[all...] |
| LeftRecursiveRuleWalker.g | 196 prefix : ^( ALT (^(BACKTRACK_SEMPRED .*))? {setTokenPrec((GrammarAST)input.LT(1), outerAlt);} ({!((CommonTree)input.LT(1)).getText().equals(ruleName)}? element)+ recurse EOA ) ;
198 suffix : ^( ALT (^(BACKTRACK_SEMPRED .*))? recurseNoLabel {setTokenPrec((GrammarAST)input.LT(1), outerAlt);} element+ EOA ) ;
206 recurseNoLabel : {((CommonTree)input.LT(1)).getText().equals(ruleName)}? RULE_REF;
|
| /external/antlr/antlr-3.4/runtime/Delphi/Sources/Antlr3.Runtime.Tests/ |
| 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(5) as ITree).TokenType,103)
[all...] |
| /external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Tree/ |
| CommonTreeNodeStream.cs | 165 return TreeAdaptor.GetType(LT(i));
208 object o = LT(1);
214 o = LT(1);
|
| TreeParser.cs | 91 return ((ITreeNodeStream)input).LT(1);
179 base.TraceIn(ruleName, ruleIndex, input.LT(1));
184 base.TraceOut(ruleName, ruleIndex, input.LT(1));
|
| /external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/Tree/ |
| CommonTreeNodeStream.cs | 191 return TreeAdaptor.GetType( LT( i ) );
241 object o = LT( 1 );
248 o = LT( 1 );
|
| TreeParser.cs | 100 return ( (ITreeNodeStream)input ).LT( 1 );
199 base.TraceIn( ruleName, ruleIndex, input.LT( 1 ) );
205 base.TraceOut( ruleName, ruleIndex, input.LT( 1 ) );
|
| /external/antlr/antlr-3.4/runtime/ObjC/Framework/examples/treerewrite/ |
| 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/llvm/lib/Target/PowerPC/ |
| PPCTargetTransformInfo.cpp | 225 std::pair<unsigned, MVT> LT = TLI->getTypeLegalizationCost(Src);
230 unsigned Cost = LT.first * 1;
234 unsigned SrcBytes = LT.second.getStoreSize();
|
| /external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Headers/ |
| 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/ |
| 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/ |
| 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/Framework/ |
| 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/Framework/examples/simplecTreeParser/ |
| SimpleCParser.m | [all...] |
| /external/antlr/antlr-3.4/runtime/ObjC/Framework/examples/simplecTreeParser/output1/ |
| SimpleCParser.m | [all...] |
| /external/antlr/antlr-3.4/runtime/ActionScript/project/src/org/antlr/runtime/tree/ |
| CommonErrorNode.as | 21 // sometimes resync does not consume a token (when LT(1) is
24 // is consumed during recovery; LT(-1) will return null.
|
| /external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime/ |
| RecognitionException.cs | 149 this._token = ((ITokenStream)input).LT(1);
291 this._node = nodes.LT(1);
299 object priorNode = nodes.LT(i);
310 priorNode = nodes.LT(i);
|
| UnbufferedTokenStream.cs | 47 * You can only look backwards 1 token: LT(-1).
93 return LT(i).Type;
|
| /external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Debug/ |
| Tracer.cs | 82 return ((ITokenStream) input).LT(k);
|
| /external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/ |
| RecognitionException.cs | 159 this._token = ((ITokenStream)input).LT(1);
331 this._node = input.LT(1);
356 object priorNode = input.LT(i);
371 priorNode = input.LT(i);
|
| /external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/misc/ |
| LookaheadStream.java | 43 * read via LT(1). Goes from 0 to numtokens.
50 * Return it later when they ask for LT passed end of input.
116 public T LT(int k) {
121 //System.out.print("LT(p="+p+","+k+")=");
|
| /external/antlr/antlr-3.4/runtime/JavaScript/src/org/antlr/runtime/tree/ |
| CommonErrorNode.js | 6 // sometimes resync does not consume a token (when LT(1) is
9 // is consumed during recovery; LT(-1) will return null.
|
