| /external/javassist/src/main/javassist/bytecode/analysis/ |
| Analyzer.java | 140 frames[iter.lookAhead()] = firstFrame(method, maxLocals, maxStack);
195 mergeJsr(queue, frames[pos], subroutines[target], pos, lookAhead(iter, pos));
197 merge(queue, frame, lookAhead(iter, pos));
203 merge(queue, frame, lookAhead(iter, pos));
261 int next = iter.lookAhead();
268 private int lookAhead(CodeIterator iter, int pos) throws BadBytecode {
272 return iter.lookAhead();
|
| /external/nist-sip/java/gov/nist/javax/sip/parser/ |
| AlertInfoParser.java | 77 while (lexer.lookAhead(0) != '\n') {
85 if (this.lexer.lookAhead(0) == '<') {
104 if ( lexer.lookAhead(0) == ',' ) {
|
| AddressParametersParser.java | 58 char la = this.lexer.lookAhead(0);
|
| RecordRouteParser.java | 78 char la = lexer.lookAhead(0);
|
| TimeStampParser.java | 80 if (lexer.lookAhead(0) == '.') {
100 if (lexer.lookAhead(0) != '\n') {
105 if (lexer.lookAhead(0) == '.') {
|
| /external/pcre/doc/ |
| pcrecompat.3 | 23 2. PCRE does not allow repeat quantifiers on lookahead assertions. Perl permits
28 3. Capturing subpatterns that occur inside negative lookahead assertions are
32 negative lookahead assertion contains just one branch.
|
| /external/antlr/src/org/antlr/runtime/ |
| CharStream.java | 40 /** Get the ith character of lookahead. This is the same usually as
|
| /external/icu4c/common/ |
| rbbinode.h | 32 lookAhead,
|
| /external/nist-sip/java/gov/nist/javax/sip/parser/ims/ |
| PAssertedIdentityParser.java | 85 while (lexer.lookAhead(0) == ',')
|
| PathParser.java | 87 char la = lexer.lookAhead(0);
|
| PChargingFunctionAddressesParser.java | 96 while (lexer.lookAhead(0) != '\n') {
100 char la = lexer.lookAhead(0);
|
| PAccessNetworkInfoParser.java | 103 while (lexer.lookAhead(0) == ';') {
|
| PAssociatedURIParser.java | 97 while (lexer.lookAhead(0) == ',')
|
| /external/zlib/contrib/asm686/ |
| match.S | 131 /* if ((uInt)nice_match > s->lookahead) nice_match = s->lookahead; */
324 /* if ((uInt)best_len <= s->lookahead) return (uInt)best_len; */
325 /* return s->lookahead; */
|
| /external/bison/tests/ |
| glr-regression.at | 562 ## Duplicated user destructor for lookahead. See ##
566 AT_SETUP([Duplicated user destructor for lookahead])
1073 ## Incorrect lookahead during deterministic GLR. See ##
1078 AT_SETUP([Incorrect lookahead during deterministic GLR])
1085 - Defaulted state after lookahead: yychar != YYEMPTY.
1087 - User action changing the lookahead. */
1209 ## Incorrect lookahead during nondeterministic GLR. ##
1212 AT_SETUP([Incorrect lookahead during nondeterministic GLR])
1217 - Conflicting actions (split-off parse, which copies lookahead need,
1220 - Merged deferred actions (lookahead need and RHS from different stac
[all...] |
| /external/antlr/src/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/v8/test/mjsunit/ |
| regexp-lookahead.js | 49 // Test of simple positive lookahead.
75 // Positive lookahead with captures.
|
| /frameworks/base/media/libstagefright/codecs/amrnb/common/include/ |
| cnst_vad.h | 51 #define LOOKAHEAD 40 /* length of the lookahead used by speech coder */
|
| /external/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...] |
| /external/zlib/contrib/masmx86/ |
| gvmat32.asm | 173 ; if ((uInt)nice_match > s->lookahead) nice_match = s->lookahead;
525 ; return min(best_len,s->lookahead)
728 ;;; if ((uInt)nice_match > s->lookahead) nice_match = s->lookahead;
921 ;;; if ((uInt)best_len <= s->lookahead) return (uInt)best_len;
922 ;;; return s->lookahead;
|
| /external/pcre/doc/html/ |
| pcrecompat.html | 32 2. PCRE does not allow repeat quantifiers on lookahead assertions. Perl permits
38 3. Capturing subpatterns that occur inside negative lookahead assertions are
42 negative lookahead assertion contains just one branch.
|
| /packages/apps/Email/emailcommon/src/org/apache/james/mime4j/field/address/parser/ |
| AddressListParser.jj | 31 LOOKAHEAD=1;
156 LOOKAHEAD(2147483647)
193 LOOKAHEAD(2147483647)
|
| /external/antlr/src/org/antlr/runtime/debug/ |
| DebugParser.java | 38 /** Used to differentiate between fixed lookahead and cyclic DFA decisions
|
| DebugTreeParser.java | 40 /** Used to differentiate between fixed lookahead and cyclic DFA decisions
|
