/external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Versions/Current/Headers/ |
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;
|
H A D | ANTLRDebugTreeNodeStream.h | 52 - (id) LT:(NSInteger)k;
|
H A D | ANTLRLookaheadStream.h | 55 - (id) LT:(NSInteger) i;
|
/external/antlr/antlr-3.4/runtime/ObjC/Framework/ |
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;
|
H A D | ANTLRDebugTreeNodeStream.h | 52 - (id) LT:(NSInteger)k;
|
H A D | ANTLRLookaheadStream.h | 60 - (id) LT:(NSInteger) i;
|
/external/antlr/antlr-3.4/tool/src/main/antlr3/org/antlr/grammar/v3/ |
H A D | 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/llvm/lib/Target/ARM/ |
H A D | ARMTargetTransformInfo.cpp | 64 std::pair<unsigned, MVT> LT = TLI->getTypeLegalizationCost(Src); local 65 int Idx = CostTableLookup(NEONFltDblTbl, ISD, LT.second); 67 return LT.first * NEONFltDblTbl[Idx].Cost; 295 std::pair<unsigned, MVT> LT = TLI->getTypeLegalizationCost(ValTy); local 296 return LT.first; 356 std::pair<unsigned, MVT> LT = TLI->getTypeLegalizationCost(Tp); local 358 int Idx = CostTableLookup(NEONShuffleTbl, ISD::VECTOR_SHUFFLE, LT.second); 362 return LT.first * NEONShuffleTbl[Idx].Cost; 382 std::pair<unsigned, MVT> LT = TLI->getTypeLegalizationCost(Tp); local 384 CostTableLookup(NEONAltShuffleTbl, ISD::VECTOR_SHUFFLE, LT 398 std::pair<unsigned, MVT> LT = TLI->getTypeLegalizationCost(Ty); local 471 std::pair<unsigned, MVT> LT = TLI->getTypeLegalizationCost(Src); local [all...] |
/external/antlr/antlr-3.4/runtime/ObjC/Framework/examples/simplecTreeParser/ |
H A D | SimpleCParser.m | 982 [retval setStart:[input LT:1]]; 1043 [retval setStop:[input LT:-1]]; 1055 retval.tree = (ANTLRCommonTree *)[treeAdaptor errorNode:input From:retval.start To:[input LT:-1] Exception:re]; 1078 [retval setStart:[input LT:1]]; 1245 [retval setStop:[input LT:-1]]; 1260 retval.tree = (ANTLRCommonTree *)[treeAdaptor errorNode:input From:retval.start To:[input LT:-1] Exception:re]; 1283 [retval setStart:[input LT:1]]; 1373 [retval setStop:[input LT:-1]]; 1388 retval.tree = (ANTLRCommonTree *)[treeAdaptor errorNode:input From:retval.start To:[input LT:-1] Exception:re]; 1411 [retval setStart:[input LT [all...] |
/external/antlr/antlr-3.4/runtime/ObjC/Framework/examples/simplecTreeParser/output1/ |
H A D | SimpleCParser.m | 864 [retval setStart:[input LT:1]]; 920 [retval setStop:[input LT:-1]]; 931 retval.tree = (ANTLRCommonTree *)[treeAdaptor errorNode:input From:retval.startToken To:[input LT:-1] Exception:re]; 948 [retval setStart:[input LT:1]]; 1104 [retval setStop:[input LT:-1]]; 1118 retval.tree = (ANTLRCommonTree *)[treeAdaptor errorNode:input From:retval.startToken To:[input LT:-1] Exception:re]; 1135 [retval setStart:[input LT:1]]; 1218 [retval setStop:[input LT:-1]]; 1232 retval.tree = (ANTLRCommonTree *)[treeAdaptor errorNode:input From:retval.startToken To:[input LT:-1] Exception:re]; 1249 [retval setStart:[input LT [all...] |
/external/antlr/antlr-3.4/runtime/ActionScript/project/src/org/antlr/runtime/tree/ |
H A D | 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.Debug/ |
H A D | DebugEventHub.cs | 142 public virtual void LT(int index, IToken t) { method in class:Antlr.Runtime.Debug.DebugEventHub 145 listener.LT(index, t); 236 public virtual void LT(int index, object t) { method in class:Antlr.Runtime.Debug.DebugEventHub 239 listener.LT(index, t);
|
/external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Misc/ |
H A D | LookaheadStream.cs | 47 * read via LT(1). Goes from 0 to numtokens. 54 * Return it later when they ask for LT passed end of input. 138 public virtual T LT(int k) { method in class:Antlr.Runtime.Misc.LookaheadStream
|
/external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/ |
H A D | CommonTokenStream.cs | 120 public override IToken LT(int k) method in class:Antlr.Runtime.CommonTokenStream
|
H A D | UnbufferedTokenStream.cs | 48 * You can only look backwards 1 token: LT(-1). 159 return LT(i).Type;
|
/external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime.Debug/ |
H A D | DebugEventHub.cs | 167 public virtual void LT( int index, IToken t ) method in class:Antlr.Runtime.Debug.DebugEventHub 172 listener.LT( index, t ); 287 public virtual void LT( int index, object t ) method in class:Antlr.Runtime.Debug.DebugEventHub 292 listener.LT( index, t );
|
/external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/misc/ |
H A D | 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) { method in class:LookaheadStream 121 //System.out.print("LT(p="+p+","+k+")=");
|
/external/antlr/antlr-3.4/runtime/JavaScript/tests/functional/ |
H A D | rhino-python.extensions | 130 var t = this.stream.LT(1); 153 t = this.stream.LT(1);
|
/external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Headers/ |
H A D | ANTLRDebugTreeNodeStream.h | 52 - (id) LT:(NSInteger)k;
|
H A D | ANTLRLookaheadStream.h | 55 - (id) LT:(NSInteger) i;
|
/external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Versions/A/Headers/ |
H A D | ANTLRDebugTreeNodeStream.h | 52 - (id) LT:(NSInteger)k;
|
H A D | ANTLRLookaheadStream.h | 55 - (id) LT:(NSInteger) i;
|
/external/llvm/lib/Target/ARM/MCTargetDesc/ |
H A D | ARMBaseInfo.h | 41 LT, // Less than Less than, or unordered enumerator in enum:llvm::ARMCC::CondCodes 60 case GE: return LT; 61 case LT: return GE; 81 case ARMCC::LT: return "lt";
|
/external/llvm/lib/Target/Hexagon/ |
H A D | HexagonExpandCondsets.cpp | 143 void terminateSegment(LiveInterval::iterator LT, SlotIndex S, 375 void HexagonExpandCondsets::terminateSegment(LiveInterval::iterator LT, argument 377 // Terminate the live segment pointed to by LT within a live interval LI. 378 if (LT == LI.end()) 381 VNInfo *OldVN = LT->valno; 382 SlotIndex EX = LT->end; 383 LT->end = S; 384 // If LT does not end at a block boundary, the termination is done. 388 // If LT ended at a block boundary, it's possible that its value number 437 LiveInterval::iterator LT local 548 LiveInterval::iterator LT = LID.FindSegmentContaining(MX); local [all...] |
/external/antlr/antlr-3.4/gunit/src/main/antlr3/org/antlr/gunit/swingui/parsers/ |
H A D | ANTLRv3.g | 209 CommonTree blkRoot = (CommonTree)adaptor.create(BLOCK,input.LT(-1),"BLOCK"); 217 Token firstToken = input.LT(1); 218 Token prevToken = input.LT(-1); // either : or | I think 287 Token firstToken = input.LT(1); 335 Token op = input.LT(1); 348 Token firstToken = input.LT(1); 395 Token firstToken = input.LT(1);
|