Lines Matching refs:nstate

235   int nstate;              /* Number of states */  member
757     stp->index = lemp->nstate++; /* Every state gets a sequence number */
827   for(i=0; i<lemp->nstate; i++){
836   for(i=0; i<lemp->nstate; i++){
861   for(i=0; i<lemp->nstate; i++){
869     for(i=0; i<lemp->nstate; i++){
902   for(i=0; i<lemp->nstate; i++){   /* Loop over all states */
930   for(i=0; i<lemp->nstate; i++){
947   for(i=0; i<lemp->nstate; i++){
1408     lem.nstate = 0;
1439       lem.nstate, lem.tablesize, lem.nconflict);
2673   for(i=0; i<lemp->nstate; i++){
2762     case REDUCE: act = ap->x.rp->index + lemp->nstate; break;
2763     case ERROR:  act = lemp->nstate + lemp->nrule;     break;
2764     case ACCEPT: act = lemp->nstate + lemp->nrule + 1; break;
3215     minimum_size_type(0, lemp->nstate+lemp->nrule+5));  lineno++;
3253   fprintf(out,"#define YYNSTATE %d\n",lemp->nstate);  lineno++;
3275   ax = malloc( sizeof(ax[0])*lemp->nstate*2 );
3280   for(i=0; i<lemp->nstate; i++){
3283     stp->iDflt = lemp->nstate + lemp->nrule;
3311   qsort(ax, lemp->nstate*2, sizeof(ax[0]), axset_compare);
3313   for(i=0; i<lemp->nstate*2 && ax[i].nAction>0; i++){
3379   n = lemp->nstate;
3400   n = lemp->nstate;
3419   n = lemp->nstate;
3602   for(i=0; i<lemp->nstate; i++){