Home
last modified time | relevance | path

Searched refs:nterms (Results 1 – 7 of 7) sorted by relevance

/original-bsd/usr.bin/pascal/eyacc/
H A Dey2.c218 trmset[nterms].name = ctokn; in defin()
220 trmset[nterms].value = ctokn[1]; in defin()
225 case 'n': trmset[nterms].value = '\n'; break; in defin()
226 case 'r': trmset[nterms].value = '\r'; break; in defin()
230 case '"': trmset[nterms].value = '"'; break; in defin()
243 trmset[nterms].value = extval++; in defin()
246 trmlev[nterms] = 0; in defin()
247 return( nterms ); in defin()
256 for( i=ndefout; i<=nterms; ++i ){ in defout()
277 ndefout = nterms+1; in defout()
[all …]
H A Dey1.c89 tbitset = (nterms+16)/16;
154 fprintf( cout , "\nint nterms %d;",nterms); in summary()
158 for (i=1;i<=nterms;i++) if( trmset[i].value >= 0400 ) fprintf( cout , "\n\"%s\",",symnam(i)); in summary()
166 fprintf( cout , "\n%d/%d terminals, %d/%d nonterminals\n", nterms, tlim, in summary()
271 for( j=1; j<=nterms; ++j ){
H A Dey4.c25 aryfil( temp1, nterms+1, 0 ); in output()
40 for( k=1; k<=nterms; ++k ){ in output()
126 else return( amem[ apstate[i] + c - NTBASE + nterms ] ); in go2()
321 else for( j=1; j<=nterms; ++j ){ in wract()
328 for( p=1; p<=nterms; ++p ){ in wract()
339 for( p=1; p<= nterms; ++p ) if( temp1[p]+lastred == 0 )temp1[p]=0; in wract()
441 for( p0=1; p0<=nterms; ++p0 ) in wract()
475 for( j0=1; j0<=nterms; ++j0 ) if( (j1=temp1[j0]) != 0 ){ in wrstate()
H A Dey3.c219 aryfil( temp1, nterms+nnonter+1, 0 ); in stagen()
240 else temp1[c-NTBASE+nterms] = state(c); in stagen()
245 for( j=1; j<=nterms; ++j ){ in stagen()
249 if( temp1[j+nterms] ) fprintf( cout , "%s %d, ", nontrst[j].name, temp1[j+nterms] ); in stagen()
253 apstate[i] = apack( &temp1[0], nterms ); in stagen()
254 indgo[i] = apack( &temp1[nterms+1], nnonter-1 ) - 1; in stagen()
H A Dey.h65 extern int nterms ; /* number of terminals */
H A Dey0.c58 int nterms = 0; /* number of terminals */ variable
/original-bsd/usr.bin/pascal/src/
H A Dgram44 /int nterms/d