/external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/ |
LeftRecursiveRules.stg | 64 ( options {backtrack=false;} 65 : ( options {backtrack=false;} 74 options {backtrack=true;}
|
/external/antlr/antlr-3.4/runtime/Ruby/test/functional/parser/ |
backtracking.rb | 9 grammar Backtrack; 12 backtrack=true; 46 * manual predicate here so that we don't backtrack over 50 * Remember: the goal is to avoid backtrack like the plague 238 lexer = Backtrack::Lexer.new( 'int a;' ) 239 parser = Backtrack::Parser.new lexer
|
nuances.rb | 134 options { backtrack=true; }
|
/external/icu/icu4c/source/layout/ |
ContextualSubstSubtables.h | 35 le_bool backtrack = FALSE); 39 const ClassDefinitionTable *classDefinitionTable, le_bool backtrack = FALSE); 43 GlyphIterator *glyphIterator, const char *offsetBase, le_bool backtrack = FALSE);
|
ContextualSubstSubtables.cpp | 51 GlyphIterator *glyphIterator, le_bool backtrack) 56 if (backtrack) { 82 le_bool backtrack) 87 if (backtrack) { 119 GlyphIterator *glyphIterator, const char *offsetBase, le_bool backtrack) 124 if (backtrack) {
|
/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/include/cloog/ |
options.h | 114 int backtrack; /* 1 to perform backtracking in member in struct:cloogoptions
|
/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/include/cloog/ |
options.h | 114 int backtrack; /* 1 to perform backtracking in member in struct:cloogoptions
|
/external/harfbuzz_ng/src/ |
hb-ot-layout-gsubgpos-private.hh | 885 const USHORT backtrack[], 893 skippy_iter.set_match_func (match_func, match_data, backtrack); 1722 backtrack; \/* Array of backtracking values member in struct:OT::ChainRule 2109 backtrack; \/* Array of coverage tables member in struct:OT::ChainContextFormat3 [all...] |
hb-ot-layout-gsub-table.hh | 913 const OffsetArrayOf<Coverage> &lookahead = StructAfter<OffsetArrayOf<Coverage> > (backtrack); 917 count = backtrack.len; 919 if (!(this+backtrack[i]).intersects (c->glyphs)) 939 const OffsetArrayOf<Coverage> &lookahead = StructAfter<OffsetArrayOf<Coverage> > (backtrack); 945 count = backtrack.len; 947 (this+backtrack[i]).add_coverage (c->before); 979 const OffsetArrayOf<Coverage> &lookahead = StructAfter<OffsetArrayOf<Coverage> > (backtrack); 983 backtrack.len, (USHORT *) backtrack.array, 1003 if (!(coverage.sanitize (c, this) && backtrack.sanitize (c, this)) 1018 backtrack; \/* Array of coverage tables member in struct:OT::ReverseChainSingleSubstFormat1 [all...] |
/packages/apps/UnifiedEmail/src/org/apache/commons/io/ |
FilenameUtils.java | 1155 Stack<int[]> backtrack = new Stack<int[]>(); local [all...] |
/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/tool/ |
GrammarReport.java | 107 String backtrack = (String) g.getOption("backtrack"); local 108 if ( backtrack==null ) { 109 backtrack = "false"; 111 data.grammarLevelBacktrack = backtrack; 283 buf.append("Number of decisions that backtrack: "); 372 buf.append("Grammar option backtrack: ");
|
Grammar.java | 206 add("backtrack"); 219 add("backtrack"); 232 add("backtrack"); 242 add("k"); add("backtrack"); add("memoize"); add("rewrite"); 254 new HashSet() {{add("k"); add("greedy"); add("backtrack"); add("memoize");}}; 376 /** At least one backtrack=true in rule or decision or grammar. */ 682 // filter => backtrack=true 686 Object backtrack = (String)getOption("backtrack"); local 689 if ( backtrack!=null && !backtrack.toString().equals("true") ) [all...] |
/toolchain/binutils/binutils-2.25/gas/testsuite/gas/cris/ |
regprefix-err-1.s | 29 ; Perhaps in this one we should backtrack and retry r10 as a symbol, but
|
/external/antlr/antlr-3.4/runtime/Ruby/lib/antlr3/debug/ |
event-hub.rb | 33 def backtrack( level ) method in class:ANTLR3.Debug.EventHub 35 listener.backtrack( level )
|
/prebuilts/go/darwin-x86/src/regexp/ |
backtrack.go | 5 // backtrack is a regular expression search with submatch 12 // backtrack is a fast replacement for the NFA code on small 308 // backtrack runs a backtracking search of prog on the input starting at pos. 309 func (m *machine) backtrack(i input, pos int, end int, ncap int) bool { func 311 panic("backtrack called for a RuneReader")
|
/prebuilts/go/linux-x86/src/regexp/ |
backtrack.go | 5 // backtrack is a regular expression search with submatch 12 // backtrack is a fast replacement for the NFA code on small 308 // backtrack runs a backtracking search of prog on the input starting at pos. 309 func (m *machine) backtrack(i input, pos int, end int, ncap int) bool { func 311 panic("backtrack called for a RuneReader")
|
/external/skia/tools/lua/ |
ngrams.lua | 19 -- list containing just the verb to the master list. Then, backtrack over the
|
/external/v8/test/mjsunit/ |
regexp-UC16.js | 39 "backref-UC16-backtrack");
|
/external/v8/test/mjsunit/harmony/ |
regexp-lookbehind.js | 119 // and we do not backtrack into a lookbehind. 125 // We do not backtrack into a lookbehind. 126 // The lookbehind captures "abc" so that \1 does not match. We do not backtrack
|
/external/v8/test/cctest/ |
test-regexp.cc | 831 Label fail, backtrack; local 843 m.PushBacktrack(&backtrack); 845 m.Bind(&backtrack); 846 m.Backtrack(); 898 Label fail, backtrack; local 910 m.PushBacktrack(&backtrack); 912 m.Bind(&backtrack); 913 m.Backtrack(); 972 Label backtrack; local 1239 Label backtrack; local 1422 Label start, fail, backtrack; local [all...] |
/external/antlr/antlr-3.4/runtime/Ruby/lib/antlr3/ |
debug.rb | 217 def backtrack method in class:ANTLR3.Debug.ParserEvents 464 # any backtrack), this informs the debugger that stream should be 479 def backtrack( level ) method in class:ANTLR3.Debug.EventListener 685 :add_child, :backtrack, :become_root, :begin_backtrack,
|
/external/pcre/dist/ |
pcre_jit_compile.c | 105 the 'backtrack' path. Branch instructions are expesive for all CPUs, so we avoid taken 110 Backtrack path: match failed. 113 Backtrack path: match is required. 130 D backtrack path 131 ')' backtrack path (If we arrived from "C" jump to the backtrack of "C") 132 B backtrack path 135 C backtrack path 136 A backtrack path 138 Notice, that the order of backtrack code paths are the opposite of the fas 6087 backtrack_common *backtrack; local 6293 backtrack_common *backtrack; local 6413 backtrack_common *backtrack; local 6984 backtrack_common *backtrack; local 7525 backtrack_common *backtrack; local 7906 backtrack_common *backtrack; local 8152 backtrack_common *backtrack; local 8215 backtrack_common *backtrack; local 8247 backtrack_common *backtrack; local 8278 backtrack_common *backtrack; local 9361 assert_backtrack backtrack; local [all...] |
/external/v8/src/regexp/ |
jsregexp.cc | 751 // push backtrack code location 753 // backtrack code location: 759 // <push affected registers on backtrack stack> 761 // push backtrack code location 763 // backtrack code location: 765 // <pop backtrack location from stack and go to it> 772 // <pop backtrack location from stack and go to it> 798 // then need to backtrack to a point where it can match "foo". The naive 3218 Label* backtrack = trace->backtrack(); local [all...] |
/prebuilts/go/darwin-x86/src/path/ |
path.go | 102 // can backtrack 108 // cannot backtrack, but not rooted, so append .. element.
|
/prebuilts/go/linux-x86/src/path/ |
path.go | 102 // can backtrack 108 // cannot backtrack, but not rooted, so append .. element.
|