/external/bison/src/ |
closure.c | 49 #define FDERIVES(Var) fderives[(Var) - ntokens] 50 #define FIRSTS(Var) firsts[(Var) - ntokens] 81 for (i = ntokens; i < nsyms; i++) 88 symbols[j + ntokens]->tag); 102 for (i = ntokens; i < nsyms; i++) 123 | symbol 5, so the bit [8 - ntokens] in first[5 - ntokens] (= FIRST | 134 for (i = ntokens; i < nsyms; i++) 135 for (j = 0; derives[i - ntokens][j]; ++j) 137 item_number sym = derives[i - ntokens][j]->rhs[0] [all...] |
derives.c | 49 for (i = ntokens; i < nsyms; i++) 53 for (rp = derives[i - ntokens]; *rp; ++rp) 71 /* DSET[NTERM - NTOKENS] -- A linked list of the numbers of the rules 85 p->next = dset[lhs - ntokens]; 87 dset[lhs - ntokens] = p; 96 for (i = ntokens; i < nsyms; i++) 98 rule_list *p = dset[i - ntokens]; 99 derives[i - ntokens] = q;
|
nullable.c | 25 the null string. NULLABLE[I - NTOKENS] is nonzero if symbol I can 51 for (i = ntokens; i < nsyms; i++) 53 nullable[i - ntokens] ? "yes" : "no"); 98 p->next = rsets[*rp - ntokens]; 100 rsets[*rp - ntokens] = p; 110 && ! nullable[rules_ruleno->lhs->number - ntokens]) 112 nullable[rules_ruleno->lhs->number - ntokens] = true; 119 for (p = rsets[*s1++ - ntokens]; p; p = p->next) 123 if (r->useful && ! nullable[r->lhs->number - ntokens]) 125 nullable[r->lhs->number - ntokens] = true [all...] |
reduce.c | 78 if (ISVAR (*rhsp) && !bitset_test (N0, *rhsp - ntokens)) 123 bitset_set (Np, rules[r].lhs->number - ntokens); 169 if (bitset_test (N, accept->number - ntokens)) 185 if (ISTOKEN (*rhsp) || bitset_test (N, *rhsp - ntokens)) 215 for (i = ntokens; i < nsyms; i++) 297 n = ntokens; 298 for (i = ntokens; i < nsyms; i++) 300 nontermmap[i - ntokens] = n++; 301 for (i = ntokens; i < nsyms; i++) 304 nontermmap[i - ntokens] = n++ [all...] |
lalr.c | 59 /* LA is a LR by NTOKENS matrix of bits. LA[l, i] is 1 if the rule 99 goto_map[TRANSITION_SYMBOL (sp, i) - ntokens]++; 106 for (i = ntokens; i < nsyms; i++) 108 temp_map[i - ntokens] = k; 109 k += goto_map[i - ntokens]; 112 for (i = ntokens; i < nsyms; i++) 113 goto_map[i - ntokens] = temp_map[i - ntokens]; 115 goto_map[nsyms - ntokens] = ngotos; 116 temp_map[nsyms - ntokens] = ngotos [all...] |
gram.h | 28 NTOKENS is the number of tokens, and NVARS is the number of 29 variables (nonterminals). NSYMS is the total number, ntokens + 33 Numbers 0 to NTOKENS - 1 are for tokens, and NTOKENS to NSYMS - 1 35 This token is counted in ntokens. The true number of token values 36 assigned is NTOKENS reduced by one for each alias declaration. 110 # define ISTOKEN(i) ((i) < ntokens) 111 # define ISVAR(i) ((i) >= ntokens) 114 extern int ntokens;
|
tables.c | 58 return state_number_as_int (nstates) + sym - ntokens; 193 for (j = 0; j < ntokens; j += 1) 252 for (i = 0; i < ntokens; i++) 324 for (j = 0; j < ntokens; j++) 344 for (j = 0; j < ntokens; j++) 356 for (i = 0; i < ntokens; i++) 383 for (i = 0; i < ntokens; i++) 397 for (i = 0; i < ntokens; i++) 430 actrow = xnmalloc (ntokens, sizeof *actrow); 431 conflrow = xnmalloc (ntokens, sizeof *conflrow) [all...] |
symtab.c | 206 sym->number = ntokens++; 239 NTOKENS. */ 240 --ntokens; 296 ntokens--; 297 assert (ntokens == sym->number || ntokens == symval->number); 377 this->number += ntokens; 592 for (i = 0; i < ntokens; ++i) 613 for (i = 0; i < ntokens; ++i)
|
conflicts.c | 194 for (i = 0; i < ntokens; i++) 310 symbol **errors = xnmalloc (ntokens + 1, sizeof *errors); 313 shift_set = bitset_create (ntokens, BITSET_FIXED); 314 look_ahead_set = bitset_create (ntokens, BITSET_FIXED); 377 for (i = 0; i < ntokens; i++)
|
output.c | 144 MUSCLE_INSERT_INT ("tokens_number", ntokens); 190 int *values = xnmalloc (ntokens, sizeof *values); 191 for (i = 0; i < ntokens; ++i) 194 values[0], 1, ntokens); 342 for (i = 0; i < ntokens; ++i) 459 yydefgoto[0], 1, nsyms - ntokens);
|
gram.c | 43 int ntokens = 1; variable 246 "ntokens = %d, nvars = %d, nsyms = %d, nrules = %d, nritems = %d\n\n", 247 ntokens, nvars, nsyms, nrules, nritems); 255 for (i = ntokens; i < nsyms; i++)
|
print.c | 329 for (i = 0; i < ntokens; i++) 358 for (i = 0; i < ntokens; i++) 486 for (i = ntokens; i < nsyms; i++) 568 shift_set = bitset_create (ntokens, BITSET_FIXED); 569 look_ahead_set = bitset_create (ntokens, BITSET_FIXED);
|
reader.c | 503 errtoken->number = ntokens++; 509 undeftoken->number = ntokens++; 570 assert (nsyms <= SYMBOL_NUMBER_MAXIMUM && nsyms == ntokens + nvars);
|
/external/clearsilver/cs/ |
csparse.c | 941 int ntokens = 0; local 967 tokens[ntokens++].type = SimpleTokens[x].type; 976 if (found && !(tokens[ntokens-1].type == CS_OP_RPAREN || tokens[ntokens-1].type == CS_OP_RBRACKET)) 986 tokens[ntokens].type = CS_TYPE_NUM; 987 tokens[ntokens].value = arg; 991 tokens[ntokens].type = CS_TYPE_VAR_NUM; 998 tokens[ntokens].len = strlen(arg); 1000 tokens[ntokens].len = p - arg; 1001 ntokens++ 1447 int ntokens = 0; local [all...] |
/external/ping/ |
ping.c | 363 long ntokens; local 367 ntokens = (tv.tv_sec - cur_time.tv_sec)*1000 + 372 if (ntokens < MININTERVAL && in_flight() >= preload) 373 return MININTERVAL-ntokens; 375 ntokens += tokens; 376 if (ntokens > interval*preload) 377 ntokens = interval*preload; 378 if (ntokens < interval) 379 return interval - ntokens; 382 tokens = ntokens - interval [all...] |