| /external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime.Tests/ |
| ITreeNodeStreamFixture.cs | 590 /// advanced somewhere to the middle of the lookahead buffer.
592 /// Use Consume() to advance N nodes into lookahead. Then use LT()
616 // now use LT to lookahead past end of buffer
|
| /external/antlr/antlr-3.4/runtime/Ruby/test/functional/tree-parser/ |
| basic.rb | 157 example "cyclic dfa lookahead" do
338 example "wildcard lookahead" do
430 example "wildcard plus lookahead" do
|
| /external/bison/data/ |
| glr.c | 79 # Same as above, but on the lookahead, hence &yylloc instead of yylocp.
94 # Same as above, but on the lookahead, hence &yylloc instead of yylocp.
706 * stacks have actually needed the current lookahead. During deterministic
720 /** The lookahead for this reduction. */
[all...] |
| /external/bison/src/ |
| getargs.c | 159 "lookahead", "lookaheads", "look-ahead",
380 `lookahead' explicitly associate lookahead tokens to items\n\
|
| /external/bison/tests/ |
| java.at | 315 # - check the lookahead that triggers an error is not discarded
316 # when we enter error recovery. Below, the lookahead causing the
329 # POSIX says the lookahead causing the error should not be discarded.
|
| calc.at | 545 # - check the lookahead that triggers an error is not discarded
546 # when we enter error recovery. Below, the lookahead causing the
560 # POSIX says the lookahead causing the error should not be discarded.
|
| /external/openfst/src/extensions/lookahead/ |
| Makefile.in | 37 subdir = src/extensions/lookahead
279 echo ' cd $(top_srcdir) && $(AUTOMAKE) --foreign src/extensions/lookahead/Makefile'; \
281 $(AUTOMAKE) --foreign src/extensions/lookahead/Makefile
|
| /frameworks/av/media/libstagefright/codecs/amrnb/common/src/ |
| window_tab.cpp | 156 /* window for non-EFR modesm; uses 40 samples lookahead */
187 /* window for EFR, first two subframes, no lookahead */
217 /* window for EFR, last two subframes, no lookahead */
|
| /external/chromium_org/third_party/angle/src/compiler/ |
| glslang_tab.cpp | [all...] |
| /external/chromium_org/third_party/mesa/src/chromium_gensrc/mesa/program/ |
| program_parse.tab.c | [all...] |
| /external/antlr/antlr-3.4/runtime/Delphi/Sources/Antlr3.Runtime/ |
| Antlr.Runtime.Tree.pas | [all...] |
| /external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/ActionScript/ |
| ActionScript.stg | 832 /** Same as a normal DFA state except that we don't examine lookahead
[all...] |
| /external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/Java/ |
| Java.stg | 908 /** Same as a normal DFA state except that we don't examine lookahead
[all...] |
| /external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/JavaScript/ |
| JavaScript.stg | 843 /** Same as a normal DFA state except that we don't examine lookahead
[all...] |
| /external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/Perl5/ |
| Perl5.stg | 872 /** Same as a normal DFA state except that we don't examine lookahead
1076 <if(semPredState)> <! get next lookahead symbol to test edges, then rewind !>
1089 /** Just like a fixed DFA edge, test the lookahead and indicate what
1118 /** Sometimes a lookahead test cannot assume that LA(k) is in a temp variable
1119 * somewhere. Must ask for the lookahead directly.
[all...] |
| /external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/Python/ |
| Python.stg | 991 /** Same as a normal DFA state except that we don't examine lookahead
[all...] |
| /external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/Scala/ |
| Scala.stg | 901 /** Same as a normal DFA state except that we don't examine lookahead
[all...] |
| /external/chromium_org/third_party/icu/source/common/ |
| rbbitblb.cpp | 211 if (n->fType == RBBINode::lookAhead || n->fType == RBBINode::tag) {
212 // Lookahead marker node. It's a leaf, so no recursion on children.
253 n->fType == RBBINode::lookAhead ||
299 n->fType == RBBINode::lookAhead ||
729 // Both lookahead and non-lookahead accepting for this state.
765 fTree->findNodes(&lookAheadNodes, RBBINode::lookAhead, *fStatus);
[all...] |
| /external/icu4c/common/ |
| rbbitblb.cpp | 211 if (n->fType == RBBINode::lookAhead || n->fType == RBBINode::tag) {
212 // Lookahead marker node. It's a leaf, so no recursion on children.
253 n->fType == RBBINode::lookAhead ||
299 n->fType == RBBINode::lookAhead ||
729 // Both lookahead and non-lookahead accepting for this state.
765 fTree->findNodes(&lookAheadNodes, RBBINode::lookAhead, *fStatus);
[all...] |
| /external/harfbuzz/src/ |
| harfbuzz-gpos.c | [all...] |
| /external/harfbuzz_ng/src/hb-old/ |
| harfbuzz-gpos.c | [all...] |
| /external/chromium_org/v8/src/ |
| jsregexp.cc | 3071 BoyerMooreLookahead* lookahead = bm_info(not_at_start); local
4005 BoyerMooreLookahead* lookahead = bm_info(not_at_start); local
[all...] |
| /external/antlr/antlr-3.4/runtime/C/ |
| README | 116 You can manually set the max lookahead k as an option for any decision
117 though. The LL(*) algorithm ramps up to use more lookahead when it
124 distinguish between them with finite lookahead to see the decimal
334 Sem pred states didn't define lookahead vars.
[all...] |
| /external/chromium_org/third_party/zlib/ |
| trees.c | 402 s->last_eob_len = 8; /* enough lookahead for inflate */
886 * Send one empty static block to give enough lookahead for inflate.
888 * The current inflate code requires 9 bits of lookahead. If the
890 * on 5 bits or less, inflate may have only 5+3 bits of lookahead to decode
[all...] |
| /external/qemu/distrib/zlib-1.2.3/ |
| trees.c | 398 s->last_eob_len = 8; /* enough lookahead for inflate */
882 * Send one empty static block to give enough lookahead for inflate.
884 * The current inflate code requires 9 bits of lookahead. If the
886 * on 5 bits or less, inflate may have only 5+3 bits of lookahead to decode
[all...] |
