Lines Matching refs:nstate
232 int nstate; /* Number of states */ member
754 stp->index = lemp->nstate++; /* Every state gets a sequence number */
824 for(i=0; i<lemp->nstate; i++){
833 for(i=0; i<lemp->nstate; i++){
858 for(i=0; i<lemp->nstate; i++){
866 for(i=0; i<lemp->nstate; i++){
899 for(i=0; i<lemp->nstate; i++){ /* Loop over all states */
927 for(i=0; i<lemp->nstate; i++){
944 for(i=0; i<lemp->nstate; i++){
1405 lem.nstate = 0;
1436 lem.nstate, lem.tablesize, lem.nconflict);
2670 for(i=0; i<lemp->nstate; i++){
2759 case REDUCE: act = ap->x.rp->index + lemp->nstate; break;
2760 case ERROR: act = lemp->nstate + lemp->nrule; break;
2761 case ACCEPT: act = lemp->nstate + lemp->nrule + 1; break;
3212 minimum_size_type(0, lemp->nstate+lemp->nrule+5)); lineno++;
3250 fprintf(out,"#define YYNSTATE %d\n",lemp->nstate); lineno++;
3272 ax = malloc( sizeof(ax[0])*lemp->nstate*2 );
3277 for(i=0; i<lemp->nstate; i++){
3280 stp->iDflt = lemp->nstate + lemp->nrule;
3308 qsort(ax, lemp->nstate*2, sizeof(ax[0]), axset_compare);
3310 for(i=0; i<lemp->nstate*2 && ax[i].nAction>0; i++){
3376 n = lemp->nstate;
3397 n = lemp->nstate;
3416 n = lemp->nstate;
3599 for(i=0; i<lemp->nstate; i++){