/external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Headers/ |
ANTLRUnbufferedCommonTreeNodeStreamState.h | 39 NSMutableArray *lookahead; variable 60 - (NSMutableArray *) lookahead;
|
/external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Versions/A/Headers/ |
ANTLRUnbufferedCommonTreeNodeStreamState.h | 39 NSMutableArray *lookahead; variable 60 - (NSMutableArray *) lookahead;
|
/external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Versions/Current/Headers/ |
ANTLRUnbufferedCommonTreeNodeStreamState.h | 39 NSMutableArray *lookahead; variable 60 - (NSMutableArray *) lookahead;
|
/external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Debug/ |
Profiler.cs | 199 " lookahead " + d.k + " max token " + lastRealTokenTouchedInDecision); 219 // compute lookahead depth 245 /** Track refs to lookahead if in a fixed/nonfixed decision. 264 // // compute lookahead depth 307 /** Successful or not, track how much lookahead synpreds use */ 515 // buf.Append("number of fixed lookahead decisions "); 518 // buf.Append("min lookahead used in a fixed lookahead decision "); 521 // buf.Append("max lookahead used in a fixed lookahead decision ") [all...] |
/external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime.Debug/ |
Profiler.cs | 214 " lookahead " + d.k + " max token " + lastRealTokenTouchedInDecision); 237 // compute lookahead depth 267 /** Track refs to lookahead if in a fixed/nonfixed decision. 290 // // compute lookahead depth 335 /** Successful or not, track how much lookahead synpreds use */ 566 // buf.Append("number of fixed lookahead decisions "); 569 // buf.Append("min lookahead used in a fixed lookahead decision "); 572 // buf.Append("max lookahead used in a fixed lookahead decision ") [all...] |
Tracer.cs | 61 Console.Out.WriteLine( "> " + ruleName + " lookahead(1)=" + GetInputSymbol( 1 ) ); 72 Console.Out.WriteLine( "< " + ruleName + " lookahead(1)=" + GetInputSymbol( 1 ) );
|
/external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/debug/ |
Profiler.java | 254 " lookahead "+d.k +" max token "+lastRealTokenTouchedInDecision); 270 // compute lookahead depth 291 /** Track refs to lookahead if in a fixed/nonfixed decision. 307 // // compute lookahead depth 349 /** Successful or not, track how much lookahead synpreds use */ 577 // buf.append("number of fixed lookahead decisions "); 580 // buf.append("min lookahead used in a fixed lookahead decision "); 583 // buf.append("max lookahead used in a fixed lookahead decision ") [all...] |
/external/openfst/src/include/fst/ |
lookahead-matcher.h | 0 // lookahead-matcher.h 19 // Classes to add lookahead to FST matchers, useful e.g. for improving 37 // LOOKAHEAD MATCHERS - these have the interface of Matchers (see 51 // // If safe=true, the copy is thread-safe (except the lookahead Fst is 60 // // LABEL LOOKAHEAD: Can 'label' be read from the current matcher state 64 // // RATIONAL LOOKAHEAD: The next methods allow looking ahead for an 66 // // from which to begin the matching. If the lookahead FST is a 70 // // Are there paths P from 's' in the lookahead FST that can be read from 75 // // lookahead and matcher FSTs for the last call to LookAheadFst. 80 // // Is there is a single non-epsilon arc found in the lookahead FS [all...] |
/external/bison/src/ |
AnnotationList.h | 57 * - Propagating that token to the lookahead set of contribution 69 * with contribution \c i is present in the lookahead set of kernel 72 * contribution's token to the lookahead set of the contribution's 150 * - \c lookaheads describes the lookahead sets on the kernel items of some 152 * - <tt>lookaheads = NULL</tt> only if the lookahead set on every kernel 155 * - \c NULL only if the lookahead set on kernel item \c i is empty. 156 * - The (possibly empty) lookahead set on kernel item \c i.
|
lalr.c | 1 /* Compute lookahead criteria for Bison. 22 /* Find which rules need lookahead in each state, and which lookahead 324 | Count the number of lookahead tokens required for S | 342 /* We need a lookahead either to distinguish different reductions 347 a lookahead token that makes sense there, and so no lookahead token 380 /* Compute the total number of reductions requiring a lookahead. */ 393 require lookahead tokens. */ 409 | Output the lookahead tokens for each state. [all...] |
/external/nist-sip/java/gov/nist/javax/sip/parser/ |
ViaParser.java | 93 while (lexer.lookAhead(0) == ';') { 111 if (lexer.lookAhead(0) == '(') { 116 char ch = lexer.lookAhead(0); 157 char la = lexer.lookAhead(0); 168 if (lexer.lookAhead(0) == '\"') { 213 if (this.lexer.lookAhead(0) == ',') { 217 if (this.lexer.lookAhead(0) == '\n')
|
/external/nist-sip/java/gov/nist/core/ |
LexerCore.java | 238 char next = lookAhead(0); 262 char next = lookAhead(0); 279 char c = lookAhead(0); 282 c = lookAhead(0); 322 char nextChar = lookAhead(0); 331 char nextChar = lookAhead(0); 376 char nextChar = lookAhead(0); 394 char nextChar = lookAhead(0); 434 char nextChar = lookAhead(0); 488 char nextChar = lookAhead(0) [all...] |
/external/antlr/antlr-3.4/runtime/C/include/ |
antlr3commontreenodestream.h | 241 /// to fit new lookahead depths, but consume() wraps like a circular 244 pANTLR3_BASE_TREE * lookAhead; 246 /// Number of elements available in the lookahead buffer at any point in 251 /// lookAhead[head] is the first symbol of lookahead, LT(1). 255 /// Add new lookahead at lookahead[tail]. tail wraps around at the 256 /// end of the lookahead buffer so tail could be less than head. 325 pANTLR3_BASE_TREE * lookAhead;
|
/external/harfbuzz/src/ |
harfbuzz-gpos-private.h | 542 HB_UShort* Lookahead; /* array of lookahead glyph IDs */ 550 /* total number of lookahead glyphs */ 583 HB_UShort* Lookahead; /* array of lookahead classes */ 592 /* total number of lookahead 630 /* maximal lookahead length */ 658 /* number of lookahead glyphs */ 660 /* array of lookahead coverage
|
/external/harfbuzz_ng/src/hb-old/ |
harfbuzz-gpos-private.h | 542 HB_UShort* Lookahead; /* array of lookahead glyph IDs */ 550 /* total number of lookahead glyphs */ 583 HB_UShort* Lookahead; /* array of lookahead classes */ 592 /* total number of lookahead 630 /* maximal lookahead length */ 658 /* number of lookahead glyphs */ 660 /* array of lookahead coverage
|
/external/zlib/src/ |
deflate.c | 338 if (wrap == 2 || (wrap == 1 && s->status != INIT_STATE) || s->lookahead) 364 while (s->lookahead >= MIN_MATCH) { 366 n = s->lookahead - (MIN_MATCH-1); 376 s->lookahead = MIN_MATCH-1; 379 s->strstart += s->lookahead; 381 s->insert = s->lookahead; 382 s->lookahead = 0; 899 if (strm->avail_in != 0 || s->lookahead != 0 || [all...] |
/external/libvpx/libvpx/vp8/encoder/ |
lookahead.c | 13 #include "lookahead.h" 70 /* Clamp the lookahead queue depth */ 76 /* Keep last frame in lookahead buffer by increasing depth by 1.*/ 83 /* Allocate the lookahead structures */ 122 * 1. Lookahead queue has has size of 1.
|
/external/chromium_org/third_party/harfbuzz-ng/src/ |
hb-ot-layout-gsubgpos-private.hh | 908 const USHORT lookahead[], 916 skippy_iter.set_match_func (match_func, match_data, lookahead); 1658 const ArrayOf<USHORT> &lookahead = StructAfter<ArrayOf<USHORT> > (input); local 1672 const ArrayOf<USHORT> &lookahead = StructAfter<ArrayOf<USHORT> > (input); local 1686 const ArrayOf<USHORT> &lookahead = StructAfter<ArrayOf<USHORT> > (input); local 1699 const ArrayOf<USHORT> &lookahead = StructAfter<ArrayOf<USHORT> > (input); local 2007 const OffsetArrayOf<Coverage> &lookahead = StructAfter<OffsetArrayOf<Coverage> > (input); local 2028 const OffsetArrayOf<Coverage> &lookahead = StructAfter<OffsetArrayOf<Coverage> > (input); local 2047 const OffsetArrayOf<Coverage> &lookahead = StructAfter<OffsetArrayOf<Coverage> > (input); local 2074 const OffsetArrayOf<Coverage> &lookahead = StructAfter<OffsetArrayOf<Coverage> > (input); local [all...] |
/external/harfbuzz_ng/src/ |
hb-ot-layout-gsubgpos-private.hh | 879 const USHORT lookahead[], 887 skippy_iter.set_match_func (match_func, match_data, lookahead); 1640 const ArrayOf<USHORT> &lookahead = StructAfter<ArrayOf<USHORT> > (input); local 1654 const ArrayOf<USHORT> &lookahead = StructAfter<ArrayOf<USHORT> > (input); local 1668 const ArrayOf<USHORT> &lookahead = StructAfter<ArrayOf<USHORT> > (input); local 1681 const ArrayOf<USHORT> &lookahead = StructAfter<ArrayOf<USHORT> > (input); local 1989 const OffsetArrayOf<Coverage> &lookahead = StructAfter<OffsetArrayOf<Coverage> > (input); local 2010 const OffsetArrayOf<Coverage> &lookahead = StructAfter<OffsetArrayOf<Coverage> > (input); local 2029 const OffsetArrayOf<Coverage> &lookahead = StructAfter<OffsetArrayOf<Coverage> > (input); local 2056 const OffsetArrayOf<Coverage> &lookahead = StructAfter<OffsetArrayOf<Coverage> > (input); local [all...] |
/external/chromium_org/third_party/zlib/ |
deflate.c | 344 * s->lookahead stays null, so s->ins_h will be recomputed at the next 822 if (strm->avail_in != 0 || s->lookahead != 0 || 873 if (s->lookahead == 0) { [all...] |
/cts/tools/dasm/src/java_cup/ |
lalr_item_set.java | 9 * (i.e., ignoring differences in their lookahead sets).<p> 112 /** Add a singleton item, merging lookahead sets if the item is already 126 /* if so, merge this lookahead into the original and leave it */ 129 other.lookahead().add(itm.lookahead()); 232 * differing lookahead sets are merged by creating a new item with the same 233 * core and the union of the lookahead sets (the LA in LALR stands for 234 * "lookahead merged" and this is where the merger is). This routine 265 /* create the lookahead set based on first after dot */ 266 new_lookaheads = itm.calc_lookahead(itm.lookahead()); [all...] |
/external/antlr/antlr-3.4/runtime/ObjC/Framework/ |
ANTLRUnbufferedCommonTreeNodeStream.h | 54 NSMutableArray *lookahead; variable 70 @property (retain, getter=getLookahead, setter=setLookahead:) NSMutableArray *lookahead; variable 106 #pragma mark Lookahead Handling
|
/external/nist-sip/java/gov/nist/javax/sip/parser/ims/ |
PVisitedNetworkIDParser.java | 96 if (this.lexer.lookAhead(0) == '\"') 104 char la = lexer.lookAhead(0); 130 if (this.lexer.lookAhead(0) != '\"')
|
/external/webrtc/src/modules/audio_processing/utility/ |
delay_estimator.h | 55 int lookahead); 68 // end spectra. The value will be offset by the lookahead (i.e. the lookahead
|
/frameworks/compile/slang/ |
slang_pragma_recorder.cpp | 65 const clang::Token* NextToken = &PP.LookAhead(0); 72 NextToken = &PP.LookAhead(0); 85 NextToken = &PP.LookAhead(0);
|