| /external/bison/src/ |
| ielr.h | 43 symbol_number lookahead, state ***predecessors,
|
| /external/apache-xml/src/main/java/org/apache/xalan/templates/ |
| AVT.java | 196 String lookahead = null; // next token local
201 if (lookahead != null)
203 t = lookahead;
204 lookahead = null;
228 lookahead = tokenizer.nextToken();
230 if (lookahead.equals("{"))
234 buffer.append(lookahead);
236 lookahead = null;
242 else if(lookahead.equals("\"") || lookahead.equals("\'")
[all...] |
| /external/webrtc/src/modules/audio_processing/utility/ |
| delay_estimator_wrapper.h | 35 // - lookahead : Amount of non-causal lookahead to use. This can
41 // A value of zero is the typical no-lookahead case.
51 int lookahead);
64 // value will be offset by the lookahead (i.e. the lookahead should be
|
| delay_estimator.h | 55 int lookahead);
68 // end spectra. The value will be offset by the lookahead (i.e. the lookahead
|
| delay_estimator.c | 93 int lookahead) {
95 int history_size = max_delay + lookahead;
103 if (lookahead < 0) {
123 self->near_history_size = lookahead + 1;
206 // If we apply lookahead, shift near-end binary spectrum history. Insert
|
| /cts/tools/dasm/src/java_cup/ |
| lalr_item.java | 7 * a set of lookahead symbols (terminal). (The first two of these parts
16 * that B has already been parsed, and that we will expect to see a lookahead
20 * Items may initially be missing some items from their lookahead sets.
22 * to be updated if symbols are added to its lookahead set. During
23 * "lookahead propagation", we add symbols to various lookahead sets and
40 * @param look the set of lookahead symbols.
55 * @param look the set of lookahead symbols.
64 /** Constructor with default position and empty lookahead set.
76 /** The lookahead symbols of the item. *
80 public terminal_set lookahead() {return _lookahead;}; method in class:lalr_item
[all...] |
| 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/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/ObjC/Framework/ |
| ANTLRUnbufferedCommonTreeNodeStreamState.h | 39 NSMutableArray *lookahead; variable
60 - (NSMutableArray *) lookahead;
|
| /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/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...] |
| /external/chromium_org/third_party/icu/source/common/ |
| ruleiter.h | 170 * options. This is useful in conjunction with the lookahead() method.
184 * sequence of calls is to call skipIgnored(), then call lookahead(), then
185 * parse the string returned by lookahead(), then call jumpahead() to
192 UnicodeString& lookahead(UnicodeString& result, int32_t maxLookAhead = -1) const;
196 * This is useful in conjunction with the lookahead() method.
|
| ruleiter.cpp | 74 c = lookahead(tempEscape, MAX_U_NOTATION_LEN).unescapeAt(offset);
111 UnicodeString& RuleCharacterIterator::lookahead(UnicodeString& result, int32_t maxLookAhead) const { function in class:RuleCharacterIterator
|
| /external/icu4c/common/ |
| ruleiter.h | 169 * options. This is useful in conjunction with the lookahead() method.
183 * sequence of calls is to call skipIgnored(), then call lookahead(), then
184 * parse the string returned by lookahead(), then call jumpahead() to
191 UnicodeString& lookahead(UnicodeString& result, int32_t maxLookAhead = -1) const;
195 * This is useful in conjunction with the lookahead() method.
|
| ruleiter.cpp | 74 c = lookahead(tempEscape, MAX_U_NOTATION_LEN).unescapeAt(offset);
111 UnicodeString& RuleCharacterIterator::lookahead(UnicodeString& result, int32_t maxLookAhead) const { function in class:RuleCharacterIterator
|
| /external/qemu/distrib/zlib-1.2.3/ |
| deflate.c | 114 /* Minimum amount of lookahead, except at the end of the input file.
344 * s->lookahead stays null, so s->ins_h will be recomputed at the next
786 if (strm->avail_in != 0 || s->lookahead != 0 ||
[all...] |
| /external/chromium_org/third_party/lzma_sdk/ |
| 7zDec.c | 142 size_t lookahead = (1 << 18); local
143 if (lookahead > inSize)
144 lookahead = (size_t)inSize;
145 res = inStream->Look((void *)inStream, (const void **)&inBuf, &lookahead);
150 SizeT inProcessed = (SizeT)lookahead, dicPos = state.dicPos;
153 lookahead -= inProcessed;
159 if (state.dicBufSize != outSize || lookahead != 0 ||
192 size_t lookahead = (1 << 18); local
193 if (lookahead > inSize)
194 lookahead = (size_t)inSize
[all...] |
| /external/lzma/C/ |
| 7zDec.c | 142 size_t lookahead = (1 << 18);
local
143 if (lookahead > inSize)
144 lookahead = (size_t)inSize;
145 res = inStream->Look((void *)inStream, (const void **)&inBuf, &lookahead);
150 SizeT inProcessed = (SizeT)lookahead, dicPos = state.dicPos;
153 lookahead -= inProcessed;
159 if (state.dicBufSize != outSize || lookahead != 0 ||
192 size_t lookahead = (1 << 18);
local
193 if (lookahead > inSize)
194 lookahead = (size_t)inSize;
[all...] |
| /external/chromium_org/third_party/ply/ |
| yacc.py | 283 lookahead = None # Current lookahead symbol
284 lookaheadstack = [ ] # Stack of lookahead symbols
332 # Get the next symbol on the input. If a lookahead symbol
341 if not lookahead:
343 lookahead = get_token() # Get the next token
345 lookahead = lookaheadstack.pop()
346 if not lookahead:
347 lookahead = YaccSymbol()
348 lookahead.type = "$end
[all...] |
| /external/apache-xml/src/main/java/org/apache/xml/utils/ |
| NamespaceSupport2.java | 392 private String lookahead=null; field in class:PrefixForUriEnumerator
406 if(lookahead!=null)
414 lookahead=prefix;
425 String tmp=lookahead;
426 lookahead=null;
|
| /external/chromium_org/third_party/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/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...] |
| /cts/tools/dasm/src/java_cup/runtime/ |
| lr_parser.java | 20 * (using the current state and the current lookahead token as indexes) to
26 * table is consulted (using the new state and current lookahead token as
236 /** The current lookahead token. */
355 * @param cur_token the current lookahead token.
367 * @param cur_token the current lookahead token.
745 * found, then we fail. Next a small number of "lookahead" or "parse
751 * to "parse ahead" though the buffered lookahead tokens. The "parse ahead"
775 /* read ahead to create lookahead we can parse multiple times */
789 if (lookahead[0].sym == EOF_sym())
804 /* do the real parse (including actions) across the lookahead */
877 protected token lookahead[]; field in class:lr_parser
[all...] |
