95   int i, j, k, c;  in lemon_vsprintf()  local
119         k = 0;  in lemon_vsprintf()
121           k++;  in lemon_vsprintf()
122           zTemp[sizeof(zTemp)-k] = (v%10) + '0';  in lemon_vsprintf()
125         lemon_addtext(str, &nUsed, &zTemp[sizeof(zTemp)-k], k, iWidth);  in lemon_vsprintf()
131         k = va_arg(ap, int);  in lemon_vsprintf()
133         lemon_addtext(str, &nUsed, z, k, iWidth);  in lemon_vsprintf()
682   int i, j, k, n, end;  in acttab_insert()  local
718         k = p->aLookahead[j].lookahead - p->mnLookahead + i;  in acttab_insert()
719         if( k<0 || k>=p->nAction ) break;  in acttab_insert()
720         if( p->aLookahead[j].lookahead!=p->aAction[k].lookahead ) break;  in acttab_insert()
721         if( p->aLookahead[j].action!=p->aAction[k].action ) break;  in acttab_insert()
751           k = p->aLookahead[j].lookahead - p->mnLookahead + i;  in acttab_insert()
752           if( k<0 ) break;  in acttab_insert()
753           if( p->aAction[k].lookahead>=0 ) break;  in acttab_insert()
774     k = p->aLookahead[j].lookahead - p->mnLookahead + i;  in acttab_insert()
775     p->aAction[k] = p->aLookahead[j];  in acttab_insert()
776     if( k>=p->nAction ) p->nAction = k+1;  in acttab_insert()
1428             int k;  in Configlist_closure()  local
1429             for(k=0; k<xsp->nsubsym; k++){  in Configlist_closure()
1430               SetAdd(newcfp->fws, xsp->subsym[k]->index);  in Configlist_closure()
1931 static void errline(int n, int k, FILE *err)  in errline()  argument
1944   spcnt += k;  in errline()
2821       int k;  in eval_preprocessor_boolean()  local
2824       for(k=i+1; z[k]; k++){  in eval_preprocessor_boolean()
2825         if( z[k]==')' ){  in eval_preprocessor_boolean()
2828             z[k] = 0;  in eval_preprocessor_boolean()
2830             z[k] = ')';  in eval_preprocessor_boolean()
2835             i = k;  in eval_preprocessor_boolean()
2838         }else if( z[k]=='(' ){  in eval_preprocessor_boolean()
2840         }else if( z[k]==0 ){  in eval_preprocessor_boolean()
2841           i = k;  in eval_preprocessor_boolean()
2853       int j, k, n;  in eval_preprocessor_boolean()  local
2855       for(k=i+1; ISALNUM(z[k]) || z[k]=='_'; k++){}  in eval_preprocessor_boolean()
2856       n = k - i;  in eval_preprocessor_boolean()
2864       i = k-1;  in eval_preprocessor_boolean()
2892   int i, j, k;  in preprocess_input()  local
2930         k = z[j];  in preprocess_input()
2933         z[j] = k;  in preprocess_input()
4277       int k;  in writeRuleText()  local
4279       for(k=1; k<sp->nsubsym; k++){  in writeRuleText()
4280         fprintf(out,"|%s",sp->subsym[k]->name);  in writeRuleText()
4383           int k;  in ReportTable()  local
4384           for(k=0; k<sp->nsubsym; k++){  in ReportTable()
4387               i,j,sp->subsym[k]->index  in ReportTable()