HomeSort by relevance Sort by last modified time
    Searched refs:greedy (Results 1 - 25 of 27) sorted by null

1 2

  /external/antlr/runtime/Ruby/test/functional/lexer/
filter-mode.rb 33 : '"' (options {greedy=false;}: ESC | .)* '"'
37 : '\'' (options {greedy=false;}: ESC | .)* '\''
117 : 'return' (options {greedy=false;}:.)* ';'
153 : '/*' (options {greedy=false;} : . )* '*/'
160 : '//' (options {greedy=false;} : . )* '\n'
167 : '"' (options {greedy=false;}: ESC | .)* '"'
171 : '\'' (options {greedy=false;}: ESC | .)* '\''
  /external/icu/icu4c/source/i18n/
numparse_impl.h 57 void parse(const UnicodeString& input, bool greedy, ParsedNumber& result, UErrorCode& status) const;
59 void parse(const UnicodeString& input, int32_t start, bool greedy, ParsedNumber& result,
numparse_impl.cpp 240 void NumberParserImpl::parse(const UnicodeString& input, bool greedy, ParsedNumber& result,
242 return parse(input, 0, greedy, result, status);
245 void NumberParserImpl::parse(const UnicodeString& input, int32_t start, bool greedy, ParsedNumber& result,
254 if (greedy) {
283 // In a greedy parse, recurse on only the first match.
293 // NOTE: If we get here, the greedy parse completed without consuming the entire string.
314 // In a non-greedy parse, we attempt all possible matches and pick the best.
  /external/antlr/gunit/src/main/antlr3/org/antlr/gunit/swingui/parsers/
StGUnit.g 140 ( options {greedy=false;}
152 ( options {greedy=false;}
166 ( options {greedy=false; k=3;}
ANTLRv3.g 532 ( options {greedy=false; k=1;}
549 ( options {greedy=false; k=2;}
  /external/antlr/runtime/JavaScript/tests/functional/
t012lexerXML.g 39 fragment INTERNAL_DTD : '[' (options {greedy=false;} : .)* ']' ;
93 : '<!--' (options {greedy=false;} : .)* '-->'
97 : '<![CDATA[' (options {greedy=false;} : .)* ']]>'
110 ( options {greedy=true;} : LETTER | '0'..'9' | '.' | '-' | '_' | ':' )*
Python.g 100 : defparameter (options {greedy=true;}:COMMA defparameter)*
120 : fpdef (options {greedy=true;}:COMMA fpdef)* (COMMA)?
129 : small_stmt (options {greedy=true;}:SEMI small_stmt)* (SEMI)? NEWLINE
311 : atom (trailer)* (options {greedy=true;}:DOUBLESTAR factor)?
326 listmaker: test ( list_for | (options {greedy=true;}:COMMA test)* ) (COMMA)?
338 : subscript (options {greedy=true;}:COMMA subscript)* (COMMA)?
512 /** Match various string types. Note that greedy=false implies '''
517 ( '\'\'\'' (options {greedy=false;}:.)* '\'\'\''
518 | '"""' (options {greedy=false;}:.)* '"""'
  /external/icu/android_icu4j/src/main/java/android/icu/impl/number/parse/
NumberParserImpl.java 302 public void parse(String input, boolean greedy, ParsedNumber result) {
303 parse(input, 0, greedy, result);
314 * @param greedy
315 * Whether to use the faster but potentially less accurate greedy code path.
319 public void parse(String input, int start, boolean greedy, ParsedNumber result) {
325 if (greedy) {
350 // In a greedy parse, recurse on only the first match.
360 // NOTE: If we get here, the greedy parse completed without consuming the entire string.
381 // In a non-greedy parse, we attempt all possible matches and pick the best.
  /external/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/number/parse/
NumberParserImpl.java 300 public void parse(String input, boolean greedy, ParsedNumber result) {
301 parse(input, 0, greedy, result);
312 * @param greedy
313 * Whether to use the faster but potentially less accurate greedy code path.
317 public void parse(String input, int start, boolean greedy, ParsedNumber result) {
323 if (greedy) {
348 // In a greedy parse, recurse on only the first match.
358 // NOTE: If we get here, the greedy parse completed without consuming the entire string.
379 // In a non-greedy parse, we attempt all possible matches and pick the best.
  /external/antlr/gunit/src/main/antlr3/org/antlr/gunit/
gUnit.g 276 ( options {greedy=false;}
305 ( options {greedy=false; k=3;}
  /external/antlr/runtime/Ruby/test/functional/template-output/
template-output.rb 300 COMMENT: '/*' (options {greedy=false;} : .)* '*/' {$channel = HIDDEN;} ;
361 COMMENT: '/*' (options {greedy=false;} : .)* '*/' {$channel = HIDDEN;} ;
  /device/linaro/bootloader/edk2/MdeModulePkg/Universal/RegularExpressionDxe/Oniguruma/
regcomp.c 692 r = add_opcode(reg, qn->greedy ? OP_REPEAT : OP_REPEAT_NG);
711 r = add_opcode(reg, qn->greedy ? OP_REPEAT_INC_SG : OP_REPEAT_INC_NG_SG);
714 r = add_opcode(reg, qn->greedy ? OP_REPEAT_INC : OP_REPEAT_INC_NG);
724 if (qn->greedy && IS_REPEAT_INFINITE(qn->upper) &&
753 if (qn->greedy && infinite) {
767 if (qn->greedy) {
790 else if (qn->upper == 1 && qn->greedy) {
803 else if (!qn->greedy && qn->upper == 1 && qn->lower == 0) { /* '??' */
870 if (qn->greedy) {
922 else if (qn->upper == 1 && qn->greedy) {
    [all...]
regparse.c 1364 NQTFR(node)->greedy = 1;
2299 int greedy; member in struct:__anon9297::__anon9298::__anon9299
    [all...]
regparse.h 177 int greedy; member in struct:__anon9306
  /external/antlr/tool/src/main/antlr3/org/antlr/grammar/v3/
ANTLRv3.g 539 ( options {greedy=false; k=1;}
556 ( options {greedy=false; k=2;}
ActionTranslator.g 753 : '{' (options {greedy=false;}:.)* '}'
  /external/syzkaller/vendor/github.com/google/go-cmp/cmp/internal/diff/
diff.go 181 // The algorithm below is a greedy, meet-in-the-middle algorithm for
189 // ? As we search, we build a path in a greedy manner, where the first
  /external/antlr/tool/src/main/java/org/antlr/tool/
Grammar.java 298 new HashSet<String>() {{add("k"); add("greedy"); add("backtrack"); add("memoize");}};
302 new HashMap<String, String>() {{put("greedy","true");}};
305 new HashMap<String, String>() {{put("greedy","true");}};
    [all...]
  /external/zlib/src/contrib/pascal/
example.pas 295 EXIT_ERR('deflate not greedy');
  /external/tensorflow/tensorflow/python/keras/
backend.py     [all...]
backend_test.py     [all...]
  /external/guice/extensions/persist/lib/
antlr-2.7.5h3.jar 
  /external/v8/src/inspector/build/closure-compiler/
closure-compiler.jar 
  /build/make/tools/droiddoc/templates-ndk/assets/js/
android_3p-bundle.js     [all...]
  /external/doclava/res/assets/templates-sdk/assets/js/
android_3p-bundle.js     [all...]

Completed in 1245 milliseconds

1 2