Lines Matching refs:index

122   int index;               /* Index number for this symbol */
160 int index; /* An index number for this rule */
212 int index; /* Sequencial number for this state */
358 rc = ap1->sp->index - ap2->sp->index;
363 rc = ap1->x.rp->index - ap2->x.rp->index;
510 ** i is the index in p->aAction[] where p->mnLookahead is inserted.
545 /* Insert transaction set at index i. */
554 ** index into yy_action of the action */
645 progress += SetAdd(s1->firstset,s2->index);
757 stp->index = lemp->nstate++; /* Every state gets a sequence number */
1170 SetAdd(newcfp->fws,xsp->index);
1381 /* Count and index the symbols of the grammar */
1385 for(i=0; i<=lem.nsymbol; i++) lem.symbols[i]->index = i;
1388 for(i=0; i<=lem.nsymbol; i++) lem.symbols[i]->index = i;
1602 ** Return the index of the N-th non-switch argument. Return -1
2048 rp->index = psp->gp->nrule++;
2558 assert( sp->index==j );
2621 fprintf(out,"%12s%s (state %2d) ","",tag,plp->cfp->stp->index);
2636 fprintf(fp,"%*s shift %d",indent,ap->sp->name,ap->x.stp->index);
2639 fprintf(fp,"%*s reduce %d",indent,ap->sp->name,ap->x.rp->index);
2649 indent,ap->sp->name,ap->x.rp->index);
2675 fprintf(fp,"State %d:\n",stp->index);
2681 sprintf(buf,"(%d)",cfp->rp->index);
2761 case SHIFT: act = ap->x.stp->index; break;
2762 case REDUCE: act = ap->x.rp->index + lemp->nstate; break;
2992 rp->rhs[i]->index,i-rp->nrhs+1); (*lineno)++;
3047 ** is filled in with the hash index plus 1. A ".dtnum" value of 0 is
3255 fprintf(out,"#define YYERRORSYMBOL %d\n",lemp->errsym->index); lineno++;
3288 if( ap->sp->index<lemp->nterminal ){
3290 }else if( ap->sp->index<lemp->nsymbol ){
3318 if( ap->sp->index>=lemp->nterminal ) continue;
3321 acttab_action(pActtab, ap->sp->index, action);
3329 if( ap->sp->index<lemp->nterminal ) continue;
3330 if( ap->sp->index==lemp->nsymbol ) continue;
3333 acttab_action(pActtab, ap->sp->index, action);
3442 fprintf(out, " %3d, /* %10s => %s */\n", p->fallback->index,
3465 assert( rp->index==i );
3480 fprintf(out," case %d:\n",sp->index); lineno++;
3491 fprintf(out," case %d:\n",sp->index); lineno++;
3500 sp->index<=0 || sp->destructor!=0 ) continue;
3501 fprintf(out," case %d:\n",sp->index); lineno++;
3521 fprintf(out," { %d, %d },\n",rp->lhs->index,rp->nrhs); lineno++;
3527 fprintf(out," case %d:\n",rp->index); lineno++;
3899 int i1 = (**a).index + 10000000*((**a).name[0]>'Z');
3900 int i2 = (**b).index + 10000000*((**b).name[0]>'Z');
4067 x = a->rp->index - b->rp->index;
4079 rc = a->rp->index - b->rp->index;
4095 h = h*571 + a->rp->index*37 + a->dot;
4253 h = h*571 + a->rp->index*37 + a->dot;