/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/analysis/ |
LL1DFA.java | 42 /** From list of lookahead sets (one per alt in decision), create
|
DFAState.java | 52 * so I have to add one to simulate the proper lookahead sequences for 80 /** When doing an acyclic DFA, this is the number of lookahead symbols 83 * a max fixed lookahead. 496 // if fixed lookahead, then more than 1 alt is a nondeterminism 497 // if we have hit the max lookahead
|
/external/bison/doc/ |
bison.1 | 186 `lookahead' 187 explicitly associate lookahead tokens to items
|
/external/bison/src/ |
print-xml.c | 89 /* Display the lookahead tokens? */ 143 /* Report lookahead tokens and shifts. */ 197 /* Report lookahead tokens and errors. */ 296 /* Report lookahead tokens (or $default) and reductions. */
|
tables.h | 76 The lookahead token's number, I, is used to index that portion of
|
/external/clang/lib/AST/ |
CommentBriefParser.cpp | 60 // Get lookahead token.
|
/external/javassist/src/main/javassist/bytecode/analysis/ |
SubroutineScanner.java | 69 int old = iter.lookAhead();
|
/external/openfst/src/lib/ |
fst.cc | 103 // Fst type definitions for lookahead Fsts.
|
/external/qemu/ |
json-lexer.c | 66 from OLD_STATE required lookahead. This happens whenever the table
|
/external/webkit/Source/JavaScriptCore/tests/mozilla/ecma_3/RegExp/ |
regress-187133.js | 45 * This is a "zero-width lookahead negative assertion".
|
/external/webkit/Source/WebCore/platform/text/ |
SegmentedString.h | 137 LookAheadResult lookAhead(const String& string) { return lookAheadInline<SegmentedString::equalsLiterally>(string); }
|
/external/webrtc/src/modules/audio_processing/aec/ |
aec_resampler.c | 90 // Add new frame data in lookahead
|
/external/harfbuzz/src/ |
harfbuzz-gsub.c | [all...] |
/external/harfbuzz_ng/src/hb-old/ |
harfbuzz-gsub.c | [all...] |
/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/tool/ |
Interpreter.java | 391 * The first symbol of lookahead is presumed to be primed; that is, 392 * input.lookahead(1) must point at the input symbol you want to start
|
/external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/tool/templates/messages/languages/ |
en.stg | 87 "cannot generate a sample input sequence from lookahead DFA" 261 ANTLR could not analyze this decision in rule <enclosingRule>; often this is because of recursive rule references visible from the left edge of alternatives. ANTLR will re-analyze the decision with a fixed lookahead of k=1. Consider using "options {k=1;}" for that decision and possibly adding a syntactic predicate.
|
/external/apache-xml/src/main/java/org/apache/xpath/compiler/ |
Lexer.java | 507 if (m_processor.lookahead('(', 1)) 544 if (m_processor.lookahead(':', 1))
|
/external/libvpx/libvpx/vp8/encoder/ |
onyx_int.h | 31 #include "lookahead.h" 313 struct lookahead_ctx *lookahead; member in struct:VP8_COMP
|
temporal_filter.c | 450 num_frames_forward = vp8_lookahead_depth(cpi->lookahead) 507 struct lookahead_entry* buf = vp8_lookahead_peek(cpi->lookahead,
|
/external/qemu/distrib/zlib-1.2.3/ |
deflate.h | 158 uInt lookahead; /* number of valid bytes ahead in window */ member in struct:internal_state 272 /* Minimum amount of lookahead, except at the end of the input file.
|
/external/regex-re2/re2/ |
prog.h | 237 // (the DFA has only one-byte lookahead). 238 // - even if the lookahead were possible, the Progs would be huge.
|
/external/zlib/src/ |
deflate.h | 161 uInt lookahead; /* number of valid bytes ahead in window */ member in struct:internal_state 282 /* Minimum amount of lookahead, except at the end of the input file.
|
/packages/inputmethods/LatinIME/native/jni/src/suggest/core/ |
suggest.cpp | 224 * nodes based on the next touch point(s) (or no touch points for lookahead) 294 // Handle forward lookahead when the lexicon letter exceeds the input size.
|
/external/antlr/antlr-3.4/runtime/JavaScript/tests/functional/ |
t033backtracking.g | 45 * fixed lookahead; k=2 made a few extra thousand lines. ;)
|
/external/antlr/antlr-3.4/runtime/ObjC/Framework/ |
ANTLRCommonTokenStream.m | 103 #pragma mark Lookahead
|