Lines Matching refs:k
16 int i, j, k, c; in output() local
40 for( k=1; k<=nterms; ++k ){ in output()
41 if( ((wsets[j].ws[k>>4])&(1<<(k&017))) != 0 ) { in output()
42 if( temp1[k] == 0 ) temp1[k] = c; in output()
43 else if( temp1[k]<0 ){ /* reduce/reduce conflict */ in output()
46 i, -temp1[k], lastred, symnam(k) ); in output()
47 if( -temp1[k] > lastred ) temp1[k] = -lastred; in output()
52 switch( precftn( lastred, k ) ) { in output()
58 temp1[k], lastred, symnam(k) ); in output()
62 wsets[j].ws[k>>4] &=~ (1<<(k&017)); in output()
67 temp1[k] = -lastred; in output()
72 temp1[k] = ERRCODE; in output()
131 _REGISTER k, l, off; local
142 for( k=0; k<actsiz; ++k ){
145 if( p[off+l] != amem[k+l] && amem[k+l] != 0 ) goto nextk;
148 if( pkdebug ){ settty(); fprintf( cout , "off = %d, k = %d\n", off, k ); }
152 if( k+l >= actsiz ) error("action table overflow");
153 if( k+l >= memact ) memact = k+l;
154 amem[k+l] = p[off+l];
158 for( k=0; k<memact; k+=10){
160 for( l=0; l<=9; ++l ) fprintf( cout , "%d ", amem[k+l] );
164 return(k-off);
172 int i, j, k, best, offset, count, cbest, times; in go2out() local
197 for( k=j; k<=nstate; ++k ) if( tystate[k]==cbest ) ++count; in go2out()
310 int ntimes, tred, count, j, k; in wract() local
393 for (k = 0; k < tbitset; ++k) in wract()
394 if (lastate[lookstate[j]].lset[k] != wsets[lambdarule].ws[k]) in wract()
434 for (k = 0; k < tbitset; ++k) in wract()
435 lastate[savedlook].lset[k] = wsets[lambdarule].ws[k]; in wract()