HomeSort by relevance Sort by last modified time
    Searched full:lookahead (Results 126 - 150 of 830) sorted by null

1 2 3 4 56 7 8 91011>>

  /external/nist-sip/java/gov/nist/core/
HostNameParser.java 105 char la = lexer.lookAhead(0);
148 char la = lexer.lookAhead(0);
178 if (lexer.lookAhead(0) == '[') {
271 char la = lexer.lookAhead(0);
307 " Illegal character in hostname:" + lexer.lookAhead(0),
  /device/linaro/bootloader/edk2/BaseTools/Source/C/VfrCompile/Pccts/h/
err.h 184 k = va_arg(ap, int); /* how many lookahead sets? */
188 for (i=1; i<=k; i++) /* collect all lookahead sets */
205 /* bad; lookahead is permutation that cannot be matched,
206 * but, the ith token of lookahead is valid at the ith position
671 fprintf(stderr, "cannot allocate lookahead text buffer (%d bytes)\n",
702 fprintf(stderr, "cannot allocate lookahead token buffer (%d tokens)\n",
710 fprintf(stderr, "cannot allocate lookahead line buffer (%d ints)\n",
723 fprintf(stderr, "cannot allocate lookahead text buffer (%d bytes)\n",
742 fprintf(stderr, "cannot allocate lookahead text buffer (%d)\n",
838 /* zzCONSUME; consume if not demand lookahead */
    [all...]
  /device/linaro/bootloader/edk2/EdkCompatibilityPkg/Other/Maintained/Tools/Pccts/h/
err.h 184 k = va_arg(ap, int); /* how many lookahead sets? */
188 for (i=1; i<=k; i++) /* collect all lookahead sets */
205 /* bad; lookahead is permutation that cannot be matched,
206 * but, the ith token of lookahead is valid at the ith position
671 fprintf(stderr, "cannot allocate lookahead text buffer (%d bytes)\n",
702 fprintf(stderr, "cannot allocate lookahead token buffer (%d tokens)\n",
710 fprintf(stderr, "cannot allocate lookahead line buffer (%d ints)\n",
723 fprintf(stderr, "cannot allocate lookahead text buffer (%d bytes)\n",
742 fprintf(stderr, "cannot allocate lookahead text buffer (%d)\n",
836 /* zzCONSUME; consume if not demand lookahead */
    [all...]
  /cts/tools/dasm/src/java_cup/runtime/
lr_parser.java 20 * (using the current state and the current lookahead token as indexes) to
26 * table is consulted (using the new state and current lookahead token as
236 /** The current lookahead token. */
355 * @param cur_token the current lookahead token.
367 * @param cur_token the current lookahead token.
745 * found, then we fail. Next a small number of "lookahead" or "parse
751 * to "parse ahead" though the buffered lookahead tokens. The "parse ahead"
775 /* read ahead to create lookahead we can parse multiple times */
789 if (lookahead[0].sym == EOF_sym())
804 /* do the real parse (including actions) across the lookahead */
877 protected token lookahead[]; field in class:lr_parser
    [all...]
  /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Tools/scripts/
fixdiv.py 321 self.lookahead = []
324 while len(self.lookahead) < self.window and not self.eoflookahead:
329 self.lookahead.append(line)
332 if not self.lookahead:
334 line = self.lookahead.pop(0)
343 lookend = self.lineno + len(self.lookahead)
347 return self.lookahead[index - self.lineno]
  /external/icu/icu4c/source/tools/genrb/
parse.cpp 86 struct Lookahead
111 struct Lookahead lookahead[MAX_LOOKAHEAD + 1]; member in struct:__anon21797
129 /* The nature of the lookahead buffer:
131 MAX_LOOKAHEAD lookahead tokens and a slot for the current token and value.
160 state->lookahead[i].type = getNextToken(state->buffer, &state->lookahead[i].value, &state->lookahead[i].line, &state->lookahead[i].comment, status);
176 ustr_deinit(&state->lookahead[i].value)
    [all...]
  /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/python/cpython2/Tools/scripts/
fixdiv.py 321 self.lookahead = []
324 while len(self.lookahead) < self.window and not self.eoflookahead:
329 self.lookahead.append(line)
332 if not self.lookahead:
334 line = self.lookahead.pop(0)
341 lookend = self.lineno + len(self.lookahead)
345 return self.lookahead[index - self.lineno]
  /external/python/cpython3/Tools/scripts/
fixdiv.py 321 self.lookahead = []
324 while len(self.lookahead) < self.window and not self.eoflookahead:
329 self.lookahead.append(line)
332 if not self.lookahead:
334 line = self.lookahead.pop(0)
341 lookend = self.lineno + len(self.lookahead)
345 return self.lookahead[index - self.lineno]
  /prebuilts/build-tools/common/bison/
lalr1.java 431 /// Lookahead and lookahead in internal form.
447 /// ]b4_location_type[ of the lookahead.
453 /// Semantic value of the lookahead.
483 /* Take a decision. First try without lookahead. */
491 /* Read a lookahead token. */
535 /* Shift the lookahead token. */
589 /* If just tried and failed to reuse lookahead token after an
602 /* Else will try to reuse lookahead token after shifting the error
693 - The only way there can be no lookahead present (in tok) i
    [all...]
  /device/linaro/bootloader/edk2/BaseTools/Source/C/VfrCompile/Pccts/
CHANGES_SUMMARY.txt 53 #170. Suppression for predicates with lookahead depth >1
285 creation of more than 100,000 tnodes, along with the lookahead sets
294 by full lookahead
300 Intersection of lookahead[1] sets:
304 Intersection of lookahead[2] sets:
331 function lookahead(char *string) to test characters in the
343 alternatives have identical lookahead. For example:
410 alternatives with common lookahead.
434 alternative with some other alternative with lookahead ID. In
473 When antlr discovers that there is a lookahead ambiguity between
    [all...]
KNOWN_PROBLEMS.txt 22 If the context guard g is not a subset of the lookahead context for r1
24 even when the lookahead context is not satisfied. This is an error
43 the lookahead buffer. Consider:
48 the lookahead buffer ("D"), but LT(1) in action beta will refer to
  /device/linaro/bootloader/edk2/EdkCompatibilityPkg/Other/Maintained/Tools/Pccts/
CHANGES_SUMMARY.txt 53 #170. Suppression for predicates with lookahead depth >1
285 creation of more than 100,000 tnodes, along with the lookahead sets
294 by full lookahead
300 Intersection of lookahead[1] sets:
304 Intersection of lookahead[2] sets:
331 function lookahead(char *string) to test characters in the
343 alternatives have identical lookahead. For example:
410 alternatives with common lookahead.
434 alternative with some other alternative with lookahead ID. In
473 When antlr discovers that there is a lookahead ambiguity between
    [all...]
  /prebuilts/go/darwin-x86/src/compress/flate/
deflate.go 233 func (d *compressor) findMatch(pos int, prevHead int, prevLength int, lookahead int) (length, offset int, ok bool) {
235 if lookahead < minMatchLook {
236 minMatchLook = lookahead
399 lookahead := d.windowEnd - d.index
400 if lookahead < minMatchLength+maxMatchLength {
407 if lookahead == 0 {
441 (d.fastSkipHashing != skipNever && lookahead > minMatchLength-1 ||
442 d.fastSkipHashing == skipNever && lookahead > prevLength && prevLength < d.lazy) {
443 if newLength, newOffset, ok := d.findMatch(d.index, d.chainHead-d.hashOffset, minMatchLength-1, lookahead); ok {
459 // lookahead, the last two strings are not inserted into the has
    [all...]
  /prebuilts/go/linux-x86/src/compress/flate/
deflate.go 233 func (d *compressor) findMatch(pos int, prevHead int, prevLength int, lookahead int) (length, offset int, ok bool) {
235 if lookahead < minMatchLook {
236 minMatchLook = lookahead
399 lookahead := d.windowEnd - d.index
400 if lookahead < minMatchLength+maxMatchLength {
407 if lookahead == 0 {
441 (d.fastSkipHashing != skipNever && lookahead > minMatchLength-1 ||
442 d.fastSkipHashing == skipNever && lookahead > prevLength && prevLength < d.lazy) {
443 if newLength, newOffset, ok := d.findMatch(d.index, d.chainHead-d.hashOffset, minMatchLength-1, lookahead); ok {
459 // lookahead, the last two strings are not inserted into the has
    [all...]
  /external/aac/libSBRenc/src/
tran_det.cpp 799 h_sbrFastTransientDetector->lookahead = TRAN_DET_LOOKAHEAD;
803 h_sbrFastTransientDetector->lookahead;
920 const int lookahead = h_sbrFastTransientDetector->lookahead; local
    [all...]
  /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) == ',' ) {
  /device/linaro/bootloader/edk2/BaseTools/Source/C/LzmaCompress/Sdk/C/
LzmaDec.c 895 unsigned rem = p->tempBufSize, lookAhead = 0;
896 while (rem < LZMA_REQUIRED_INPUT_MAX && lookAhead < inSize)
897 p->tempBuf[rem++] = src[lookAhead++];
904 (*srcLen) += lookAhead;
923 if (lookAhead < rem)
925 lookAhead -= rem;
927 (*srcLen) += lookAhead;
928 src += lookAhead;
929 inSize -= lookAhead;
  /device/linaro/bootloader/edk2/IntelFrameworkModulePkg/Library/LzmaCustomDecompressLib/Sdk/C/
LzmaDec.c 897 unsigned rem = p->tempBufSize, lookAhead = 0;
898 while (rem < LZMA_REQUIRED_INPUT_MAX && lookAhead < inSize)
899 p->tempBuf[rem++] = src[lookAhead++];
906 (*srcLen) += lookAhead;
925 if (lookAhead < rem)
927 lookAhead -= rem;
929 (*srcLen) += lookAhead;
930 src += lookAhead;
931 inSize -= lookAhead;
  /device/linaro/bootloader/edk2/MdeModulePkg/Library/LzmaCustomDecompressLib/Sdk/C/
LzmaDec.c 897 unsigned rem = p->tempBufSize, lookAhead = 0;
898 while (rem < LZMA_REQUIRED_INPUT_MAX && lookAhead < inSize)
899 p->tempBuf[rem++] = src[lookAhead++];
906 (*srcLen) += lookAhead;
925 if (lookAhead < rem)
927 lookAhead -= rem;
929 (*srcLen) += lookAhead;
930 src += lookAhead;
931 inSize -= lookAhead;
  /external/antlr/antlr-3.4/runtime/ActionScript/project/src/org/antlr/runtime/
CharStream.as 38 /** Get the ith character of lookahead. This is the same usually as
CharStreamState.as 37 /** Index into the char stream of next lookahead char */
  /external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime/
CharStreamState.cs 48 /// <summary>Index into the char stream of next lookahead char </summary>
ICharStream.cs 47 * Get the ith character of lookahead. This is the same usually as
  /external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/
CharStreamState.cs 47 /** <summary>Index into the char stream of next lookahead char</summary> */

Completed in 1092 milliseconds

1 2 3 4 56 7 8 91011>>