HomeSort by relevance Sort by last modified time
    Searched full:lookahead (Results 101 - 125 of 637) sorted by null

1 2 3 45 6 7 8 91011>>

  /external/antlr/antlr-3.4/runtime/ObjC/Framework/examples/LL-star/
simplec.g 17 * Use ANTLRWorks to see the lookahead use (step by Location)
  /external/antlr/antlr-3.4/runtime/ObjC/Framework/examples/fuzzy/
Fuzzy.g 63 * ever match since k=1 lookahead in the QID loop of '.' will make it loop.
  /external/antlr/antlr-3.4/runtime/Python/tests/
t018llstar.g 25 * Use ANTLRWorks to see the lookahead use (step by Location)
  /external/bison/
AUTHORS 16 IELR and LAC (Lookahead Correction) support (Bison 2.5, 2011).
  /external/bison/src/
conflicts.h 1 /* Find and resolve or report lookahead conflicts for bison,
ielr.h 43 symbol_number lookahead, state ***predecessors,
AnnotationList.c 263 lookahead set. Thus, it can't contribute to inadequacies,
266 successor of the start state's kernel item, the lookahead
304 predecessor item's lookahead set. */
460 lookahead. */
491 /* Otherwise, add the kernel items whose lookahead sets
493 lookahead set. */
503 /* The lookahead token has to come from somewhere. */
611 fprintf (stderr, " as lookahead, rule number %d",
659 * - \c lookaheads describes the lookahead sets on the kernel items of some
661 * - <tt>lookaheads = NULL</tt> only if the lookahead set on every kerne
    [all...]
graphviz.c 103 /* If no lookahead tokens were valid transitions, this reduction is
119 /* (The lookahead tokens have been added to the beginning of the
184 /* Build the lookahead tokens lists, one for enabled transitions and one
main.c 117 /* Add lookahead sets to parser states. Except when LALR(1) is
123 lookahead is not enough to disambiguate the parsing. In file
180 /* Lookahead tokens are no longer needed. */
ielr.c 46 * a goto on <tt>ritem[i]</tt> include the lookahead set of the item.
189 * \c i include the lookahead set of item \c j in the from state of goto
217 one whose lookahead set is included in this goto's follows. */
379 symbol_number lookahead, state ***predecessors,
404 lookahead set from the RHS's only nonterminal, and (2) no reduction
405 has a lookback dependency on this lookahead set. Nevertheless, I
437 predecessor items' lookahead sets. */
464 return bitset_test (item_lookahead_sets[s->number][item], lookahead);
558 * \c NULL iff all lookahead sets are empty. <tt>lookaheads[i] = NULL</tt>
559 * iff the lookahead set on item \c i is empty
    [all...]
parse-gram.c     [all...]
  /external/chromium_org/components/autofill/core/browser/
autofill_scanner.h 17 // A helper class for parsing a stream of |AutofillField|'s with lookahead.
  /external/guava/guava/src/com/google/common/collect/
PeekingIterator.java 25 * An iterator that supports a one-element lookahead while iterating.
  /external/libvpx/libvpx/test/
altref_test.cc 17 // lookahead range: [kLookAheadMin, kLookAheadMax).
  /external/nist-sip/java/gov/nist/javax/sip/parser/
AcceptLanguageParser.java 91 while (lexer.lookAhead(0) != '\n') {
94 if (lexer.lookAhead(0) != ';') {
101 while (lexer.lookAhead(0) == ';') {
122 if (lexer.lookAhead(0) == ',') {
AddressParser.java 53 if (this.lexer.lookAhead(0) == '<') {
69 if (this.lexer.lookAhead(0) == '\"') {
99 char la = lexer.lookAhead(k);
110 char la = lexer.lookAhead(k);
InReplyToParser.java 74 while (lexer.lookAhead(0) != '\n') {
80 if (lexer.lookAhead(0) == '@') {
94 while (lexer.lookAhead(0) == ',') {
102 if (lexer.lookAhead(0) == '@') {
ServerParser.java 71 if (this.lexer.lookAhead(0) == '\n')
75 while (this.lexer.lookAhead(0) != '\n'
76 && this.lexer.lookAhead(0) != '\0') {
77 if (this.lexer.lookAhead(0) == '(') {
  /external/libvpx/libvpx/vp9/encoder/
vp9_lookahead.c 62 // Clamp the lookahead queue depth
65 // Allocate the lookahead structures
107 // 1. Lookahead queue has has size of 1.
  /external/nist-sip/java/gov/nist/core/
HostNameParser.java 105 char la = lexer.lookAhead(0);
148 char la = lexer.lookAhead(0);
178 if (lexer.lookAhead(0) == '[') {
271 char la = lexer.lookAhead(0);
307 " Illegal character in hostname:" + lexer.lookAhead(0),
  /external/webrtc/src/modules/audio_processing/utility/
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/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...]
  /external/chromium_org/tools/gn/
parser.cc 119 bool Parser::LookAhead(Token::Type type) {
126 if (!LookAhead(type))
276 if (LookAhead(Token::LEFT_BRACE)) {
331 while (!LookAhead(stop_before)) {
372 if (LookAhead(Token::LEFT_BRACE)) {
374 } else if (LookAhead(Token::IF)) {
401 if (LookAhead(Token::RIGHT_BRACE)) {
  /external/javassist/src/main/javassist/bytecode/analysis/
Analyzer.java 140 frames[iter.lookAhead()] = firstFrame(method, maxLocals, maxStack);
195 mergeJsr(queue, frames[pos], subroutines[target], pos, lookAhead(iter, pos));
197 merge(queue, frame, lookAhead(iter, pos));
203 merge(queue, frame, lookAhead(iter, pos));
261 int next = iter.lookAhead();
268 private int lookAhead(CodeIterator iter, int pos) throws BadBytecode {
272 return iter.lookAhead();
  /external/bison/data/
lalr1.java 431 /// Lookahead and lookahead in internal form.
447 /// ]b4_location_type[ of the lookahead.
453 /// Semantic value of the lookahead.
483 /* Take a decision. First try without lookahead. */
491 /* Read a lookahead token. */
535 /* Shift the lookahead token. */
589 /* If just tried and failed to reuse lookahead token after an
602 /* Else will try to reuse lookahead token after shifting the error
693 - The only way there can be no lookahead present (in tok) i
    [all...]

Completed in 957 milliseconds

1 2 3 45 6 7 8 91011>>