Lines Matching defs:nstate
262 int nstate; /* Number of states */
786 stp->index = lemp->nstate++; /* Every state gets a sequence number */
856 for(i=0; i<lemp->nstate; i++){
865 for(i=0; i<lemp->nstate; i++){
890 for(i=0; i<lemp->nstate; i++){
898 for(i=0; i<lemp->nstate; i++){
930 for(i=0; i<lemp->nstate; i++){ /* Loop over all states */
959 for(i=0; i<lemp->nstate; i++){
976 for(i=0; i<lemp->nstate; i++){
1441 lem.nstate = 0;
1472 lem.nstate, lem.tablesize, lem.nconflict);
2714 for(i=0; i<lemp->nstate; i++){
2802 case REDUCE: act = ap->x.rp->index + lemp->nstate; break;
2803 case ERROR: act = lemp->nstate + lemp->nrule; break;
2804 case ACCEPT: act = lemp->nstate + lemp->nrule + 1; break;
3253 minimum_size_type(0, lemp->nstate+lemp->nrule+5)); lineno++;
3290 fprintf(out,"#define YYNSTATE %d\n",lemp->nstate); lineno++;
3312 ax = malloc( sizeof(ax[0])*lemp->nstate*2 );
3317 for(i=0; i<lemp->nstate; i++){
3320 stp->iDflt = lemp->nstate + lemp->nrule;
3348 qsort(ax, lemp->nstate*2, sizeof(ax[0]), axset_compare);
3350 for(i=0; i<lemp->nstate*2 && ax[i].nAction>0; i++){
3416 n = lemp->nstate;
3437 n = lemp->nstate;
3456 n = lemp->nstate;
3639 for(i=0; i<lemp->nstate; i++){