HomeSort by relevance Sort by last modified time
    Searched full:lookahead (Results 176 - 200 of 830) sorted by null

1 2 3 4 5 6 78 91011>>

  /prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/clang/include/clang/AST/
CommentBriefParser.h 35 /// Current lookahead token.
  /prebuilts/clang/host/linux-x86/clang-4393122/include/clang/AST/
CommentBriefParser.h 35 /// Current lookahead token.
  /prebuilts/clang/host/linux-x86/clang-4479392/include/clang/AST/
CommentBriefParser.h 35 /// Current lookahead token.
  /prebuilts/clang/host/linux-x86/clang-4579689/include/clang/AST/
CommentBriefParser.h 35 /// Current lookahead token.
  /prebuilts/clang/host/linux-x86/clang-4630689/include/clang/AST/
CommentBriefParser.h 35 /// Current lookahead token.
  /prebuilts/clang/host/linux-x86/clang-4639204/include/clang/AST/
CommentBriefParser.h 35 /// Current lookahead token.
  /prebuilts/clang/host/linux-x86/clang-4691093/include/clang/AST/
CommentBriefParser.h 35 /// Current lookahead token.
  /device/linaro/bootloader/edk2/BaseTools/Source/C/VfrCompile/Pccts/antlr/
fset.c 57 * We lock the junction according to k--the lookahead. If we have been at this
58 * junction before looking for the same, k, number of lookahead tokens, we will
102 * was behind the (...)+ block--thus using enough lookahead
539 fprintf(stderr, " warning: predicate applied for >1 lookahead %d-sequences\n", predicate->k);
546 fprintf(stderr, " You may only want one lookahead %d-sequence to apply\n", predicate->k);
556 * If delta is the set of ambiguous lookahead sequences, then make sure that
670 else fatal_internal("productions have no lookahead in predicate checking routine");
704 " These alts have ambig lookahead sequences resolved by a predicate for\n",
770 " resolving power for some lookahead sequences.\n");
782 " resolving power for some lookahead sequences.\n");
    [all...]
main.c 182 warnNoFL("must have at least one token of lookahead (setting to 1)");
452 fprintf(stderr,"Maintenance Release style hoisting enabled for predicates with lookahead depth = 1\n");
454 fprintf(stderr," Can't consider suppression for predicates with lookahead depth > 1\n");
473 fprintf(stderr," Applies to predicates with lookahead depth > 1\n");
498 { "-ck", 1, (void (*)(...)) pCk, "Set compressed lookahead depth; fast approximate lookahead"},
503 "Ambiguities for k>1 grammars shown with exact tuples (not lookahead sets)"},
516 { "-gk", 0, (void (*)(...)) pDL, "Generate parsers that delay lookahead fetches until needed"},
524 { "-k", 1, (void (*)(...)) pLLK, "Set full LL(k) lookahead depth (default==1)"},
542 "Lookahead token may appear multiple times in -aa listing"}, /* MR11 */
    [all...]
syn.h 104 Tree *tcontext; /* used if lookahead depth of > one is needed (tree) */
105 int k; /* lookahead depth for this tcontext */
106 set scontext[2];/* used if lookahead depth of one is needed (set) */
110 set completionTree; /* which lookahead depths are required to complete tcontext? */
369 char approx; /* limit block to use linear approx lookahead? */
  /external/icu/icu4c/source/i18n/
collationiterator.cpp 497 int32_t lookAhead = 1;
522 sinceMatch < lookAhead)) {
532 lookAhead -= sinceMatch - 1;
537 d, suffixes, ce32, lookAhead, c, errorCode);
549 ++lookAhead;
559 int32_t lookAhead, UChar32 c,
588 ++lookAhead;
597 // We have read and matched (lookAhead-2) code points,
609 if(lookAhead > 2) {
611 backwardNumCodePoints(lookAhead, errorCode)
    [all...]
  /external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Misc/
LookaheadStream.cs 37 * A lookahead queue that knows how to mark/release locations
82 * lookahead buffer. Return eof upon end of the stream we're pulling from.
  /external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/Misc/
LookaheadStream.cs 39 * A lookahead queue that knows how to mark/release locations
97 * lookahead buffer. Return eof upon end of the stream we're pulling from.
  /external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/misc/
LookaheadStream.java 34 /** A lookahead queue that knows how to mark/release locations
68 * lookahead buffer. Return eof upon end of the stream we're pulling from.
  /external/antlr/antlr-3.4/runtime/ObjC/Framework/
LookaheadStream.h 33 /** A lookahead queue that knows how to mark/release locations
63 * lookahead buffer. Return eof upon end of the stream we're pulling from.
LookaheadStream.m 33 /** A lookahead queue that knows how to mark/release locations
63 * lookahead buffer. Return eof upon end of the stream we're pulling from.
  /external/libopus/silk/
define.h 95 /* Milliseconds of lookahead for pitch analysis */
107 /* Milliseconds of lookahead for noise shape analysis */
  /external/libvpx/libvpx/vp8/
vp8cx.mk 44 VP8_CX_SRCS-yes += encoder/lookahead.c
45 VP8_CX_SRCS-yes += encoder/lookahead.h
  /external/llvm/lib/Target/Mips/
MipsHazardSchedule.cpp 39 /// difficult to process as lookahead for hazards is insufficent, as
117 // Forbidden slot hazard handling. Use lookahead over state.
  /external/nist-sip/java/gov/nist/javax/sip/parser/ims/
PChargingFunctionAddressesParser.java 96 while (lexer.lookAhead(0) != '\n') {
100 char la = lexer.lookAhead(0);
  /external/owasp/sanitizer/src/main/org/owasp/html/
HtmlLexer.java 222 private final LinkedList<HtmlToken> lookahead = Lists.newLinkedList(); field in class:HtmlLexer
224 if (!lookahead.isEmpty()) {
225 return lookahead.remove();
234 while (lookahead.size() <= i && splitter.hasNext()) {
235 lookahead.add(splitter.next());
237 return lookahead.size() > i ? lookahead.get(i) : null;
241 lookahead.addFirst(token);
  /frameworks/av/media/libstagefright/codecs/amrnb/common/include/
cnst_vad.h 51 #define LOOKAHEAD 40 /* length of the lookahead used by speech coder */
  /external/zlib/src/contrib/amd64/
amd64-match.S 84 printf("#define dsLookahead (%3u)(%%rdi)\n",(int)(((char*)&(s->lookahead))-((char*)s)));
182 /* if ((uInt)nice_match > s->lookahead) nice_match = s->lookahead; */
432 /* if ((uInt)best_len <= s->lookahead) return (uInt)best_len; */
433 /* return s->lookahead; */
  /toolchain/binutils/binutils-2.27/zlib/contrib/amd64/
amd64-match.S 84 printf("#define dsLookahead (%3u)(%%rdi)\n",(int)(((char*)&(s->lookahead))-((char*)s)));
182 /* if ((uInt)nice_match > s->lookahead) nice_match = s->lookahead; */
432 /* if ((uInt)best_len <= s->lookahead) return (uInt)best_len; */
433 /* return s->lookahead; */
  /external/apache-xml/src/main/java/org/apache/xpath/compiler/
XPathParser.java 290 final boolean lookahead(char c, int n) method in class:XPathParser
391 * @param n number of tokens to lookahead. Must be
397 private final boolean lookahead(String s, int n) method in class:XPathParser
404 String lookahead = (String) m_ops.m_tokenQueue.elementAt(m_queueMark + (n - 1)); local
406 isToken = (lookahead != null) ? lookahead.equals(s) : (s == null);
874 if (tokenIs('!') && lookahead('=', 1))
    [all...]

Completed in 819 milliseconds

1 2 3 4 5 6 78 91011>>