6 #define Bungetrune Bungetc /* ok for now. */
11 #define TBITSET ((32+NTERMS)/32) /* BOTCH?? +31 */
12 #define BIT(a,i) ((a)[(i)>>5] & (1<<((i)&037)))
13 #define SETBIT(a,i) ((a)[(i)>>5] |= (1<<((i)&037)))
14 #define NWORDS(n) (((n)+32)/32)
16 #define PARSER "#9/lib/yaccpar"
17 #define PARSERS "#9/lib/yaccpars"
18 #define TEMPNAME "y.tmp.XXXXXX"
19 #define ACTNAME "y.acts.XXXXXX"
21 #define FILEU "output"
23 #define FILEDEBUG "debug"
28 * the following are adjustable
29 * according to memory size
46 PRIVATE = 0xE000, /* unicode private use */
48 /* relationships which must hold:
49 TBITSET ints must hold NTERMS+1 bits...
52 TEMPSIZE >= NTERMS + NNONTERM + 1
60 NOASC = 0, /* no assoc. */
61 LASC = 1, /* left assoc. */
62 RASC = 2, /* right assoc. */
63 BASC = 3, /* binary assoc. */
65 /* flags for state generation */
71 /* flags for a rule having an action, and being reduced */
76 /* output parser flags */
103 /* macros for getting associativity and precedence levels */
105 #define ASSOC(i) ((i)&03)
106 #define PLEVEL(i) (((i)>>4)&077)
107 #define TYPE(i) (((i)>>10)&077)
109 /* macros for setting associativity and precedence levels */
111 #define SETASC(i,j) i |= j
112 #define SETPLEV(i,j) i |= (j<<4)
113 #define SETTYPE(i,j) i |= (j<<10)
117 #define TLOOP(i) for(i=1; i<=ntokens; i++)
118 #define NTLOOP(i) for(i=0; i<=nnonter; i++)
119 #define PLOOP(s,i) for(i=s; i<nprod; i++)
120 #define SLOOP(i) for(i=0; i<nstate; i++)
121 #define WSBUMP(x) x++
122 #define WSLOOP(s,j) for(j=s; j<cwp; j++)
123 #define ITMLOOP(i,p,q) for(q=pstate[i+1], p=pstate[i]; p<q; p++)
124 #define SETLOOP(i) for(i=0; i<tbitset; i++)
126 /* command to clobber tempfiles after use */
128 #define ZAPFILE(x) if(x) remove(x)
130 /* I/O descriptors */
132 Biobuf* faction; /* file for saving actions */
133 Biobuf* fdefine; /* file for #defines */
134 Biobuf* fdebug; /* y.debug for strings for debugging */
135 Biobuf* ftable; /* y.tab.c file */
136 Biobuf* ftemp; /* tempfile to pass 2 */
137 Biobuf* finput; /* input file */
138 Biobuf* foutput; /* y.output file */
140 /* communication variables between various I/O routines */
142 char* infile; /* input file name */
143 int numbval; /* value of an input number */
144 char tokname[NAMESIZE+4]; /* input token name, slop for runes and 0 */
146 /* structure declarations */
176 /* storage of names */
178 char cnames[CNAMSZ]; /* place where token and nonterminal names are stored */
179 int cnamsz = CNAMSZ; /* size of cnames */
180 char* cnamp = cnames; /* place where next name is to be put in */
181 int ndefout = 4; /* number of defined symbols output */
184 char ttempname[] = TEMPNAME;
185 char tactname[] = ACTNAME;
186 char* parser = PARSER;
189 /* storage of types */
190 int ntypes; /* number of types defined */
191 char* typeset[NTYPES]; /* pointers to type tags */
193 /* token information */
195 int ntokens = 0 ; /* number of tokens */
197 int toklev[NTERMS]; /* vector with the precedence of the terminals */
199 /* nonterminal information */
201 int nnonter = -1; /* the number of nonterminals */
202 Symb nontrst[NNONTERM];
203 int start; /* start symbol */
205 /* assigned token type values */
208 char* ytabc = OFILE; /* name of y.tab.c */
210 /* grammar rule information */
212 int mem0[MEMSIZE] ; /* production storage */
214 int nprod = 1; /* number of productions */
215 int* prdptr[NPROD]; /* pointers to descriptions of productions */
216 int levprd[NPROD]; /* precedence levels for the productions */
217 int rlines[NPROD]; /* line number for this rule */
219 /* state information */
221 int nstate = 0; /* number of states */
222 Item* pstate[NSTATES+2]; /* pointers to the descriptions of the states */
223 int tystate[NSTATES]; /* contains type information about the states */
224 int defact[NSTATES]; /* the default actions of states */
225 int tstates[NTERMS]; /* states generated by terminal gotos */
226 int ntstates[NNONTERM]; /* states generated by nonterminal gotos */
227 int mstates[NSTATES]; /* chain of overflows of term/nonterm generation lists */
228 int lastred; /* the number of the last reduction of a state */
230 /* lookahead set information */
232 Lkset lkst[LSETSIZE];
233 int nolook; /* flag to turn off lookahead computations */
234 int tbitset; /* size of lookahead sets */
235 int nlset = 0; /* next lookahead set index */
236 int nolook = 0; /* flag to suppress lookahead computations */
237 Lkset clset; /* temporary storage for lookahead computations */
239 /* working set information */
241 Wset wsets[WSETSIZE];
244 /* storage for action table */
246 int amem[ACTSIZE]; /* action table storage */
247 int* memp = amem; /* next free action table position */
248 int indgo[NSTATES]; /* index to the stored goto table */
250 /* temporary vector, indexable by states, terms, or ntokens */
252 int temp1[TEMPSIZE]; /* temporary storage, indexed by terms + ntokens or states */
253 int lineno = 1; /* current input line number */
254 int fatfl = 1; /* if on, error is fatal */
255 int nerrors = 0; /* number of errors */
257 /* statistics collection variables */
267 int* ggreed = lkst[0].lset;
268 int* pgo = wsets[0].ws.lset;
269 int* yypgo = &nontrst[0].value;
271 int maxspr = 0; /* maximum spread of any entry */
272 int maxoff = 0; /* maximum offset into a array */
279 /* storage for information about the nonterminals */
281 int** pres[NNONTERM+2]; /* vector of pointers to productions yielding each nonterminal */
282 Lkset* pfirst[NNONTERM+2]; /* vector of pointers to first sets for each nonterminal */
283 int pempty[NNONTERM+1]; /* vector of nonterminals nontrivially deriving e */
285 /* random stuff picked out from between functions */
297 int pidebug = 0; /* debugging flag for putitem */
299 int cldebug = 0; /* debugging flag for closure */
322 /* define functions */
324 void main(int, char**);
326 char* chcopy(char*, char*);
330 void error(char*, ...);
331 void aryfil(int*, int, int);
332 int setunion(int*, int*);
337 void putitem(int*, Lkset*);
341 Lkset* flset(Lkset*);
344 void setup(int, char**);
346 int defin(int, char*);
351 int chfind(int, char*);
356 void openup(char*, int, int, int, char*);
358 int apack(int*, int);
361 void precftn(int, int, int);
364 void warray(char*, int*, int);
372 void arout(char*, int*, int);
376 main(int argc, char *argv[])
379 setup(argc, argv); /* initialize and read productions */
380 tbitset = NWORDS(ntokens);
381 cpres(); /* make table of which productions yield a given nonterminal */
382 cempty(); /* make a table of which nonterminals can match the empty string */
383 cpfir(); /* make a table of firsts of nonterminals */
384 stagen(); /* generate the states */
385 output(); /* write the states and the tables */
395 * put out other arrays, copy the parsers
402 finput = Bopen(parser, OREAD);
404 error("cannot find parser %s", parser);
405 warray("yyr1", levprd, nprod);
406 aryfil(temp1, nprod, 0);
408 temp1[i] = prdptr[i+1]-prdptr[i]-2;
409 warray("yyr2", temp1, nprod);
411 aryfil(temp1, nstate, -1000);
413 for(j=tstates[i]; j!=0; j=mstates[j])
416 for(j=ntstates[i]; j!=0; j=mstates[j])
418 warray("yychk", temp1, nstate);
419 warray("yydef", defact, nstate);
421 /* put out token translation tables */
422 /* table 1 has 0-256 */
423 aryfil(temp1, 256, 0);
427 if(j >= 0 && j < 256) {
429 print("yacc bug -- cant have 2 different Ts with same value\n");
430 print(" %s and %s\n", tokset[i].name, tokset[temp1[j]].name);
438 warray("yytok1", temp1, c+1);
440 /* table 2 has PRIVATE-PRIVATE+256 */
441 aryfil(temp1, 256, 0);
444 j = tokset[i].value - PRIVATE;
445 if(j >= 0 && j < 256) {
447 print("yacc bug -- cant have 2 different Ts with same value\n");
448 print(" %s and %s\n", tokset[i].name, tokset[temp1[j]].name);
456 warray("yytok2", temp1, c+1);
458 /* table 3 has everything else */
459 Bprint(ftable, "long yytok3[] =\n{\n");
463 if(j >= 0 && j < 256)
465 if(j >= PRIVATE && j < 256+PRIVATE)
468 Bprint(ftable, "%4d,%4d,", j, i);
471 Bprint(ftable, "\n");
473 Bprint(ftable, "%4d\n};\n", 0);
475 /* copy parser text */
476 while((c=Bgetrune(finput)) != Beof) {
478 if((c = Bgetrune(finput)) != 'A')
479 Bputrune(ftable, '$');
480 else { /* copy actions */
481 faction = Bopen(actname, OREAD);
483 error("cannot reopen action tempfile");
484 while((c=Bgetrune(faction)) != Beof)
488 c = Bgetrune(finput);
497 * copies string q into p, returning next free char ptr
500 chcopy(char* p, char* q)
515 * creates output string for item pointed to by pp
521 static char sarr[ISIZE];
527 q = chcopy(sarr, nontrst[*p-NTBASE].name);
539 q = chcopy(q, symnam(i));
540 if(q > &sarr[ISIZE-30])
541 error("item too big");
544 /* an item calling for a reduction */
548 sprint(q, "%d)", -i);
554 * return a pointer to the name of symbol i
561 cp = (i >= NTBASE)? nontrst[i-NTBASE].name: tokset[i].name;
568 * output the summary on y.output
575 Bprint(foutput, "\n%d/%d terminals, %d/%d nonterminals\n",
576 ntokens, NTERMS, nnonter, NNONTERM);
577 Bprint(foutput, "%d/%d grammar rules, %d/%d states\n",
578 nprod, NPROD, nstate, NSTATES);
579 Bprint(foutput, "%d shift/reduce, %d reduce/reduce conflicts reported\n",
581 Bprint(foutput, "%d/%d working sets used\n",
582 (int)(zzcwp-wsets), WSETSIZE);
583 Bprint(foutput, "memory: states,etc. %d/%d, parser %d/%d\n",
584 (int)(zzmemsz-mem0), MEMSIZE, (int)(memp-amem), ACTSIZE);
585 Bprint(foutput, "%d/%d distinct lookahead sets\n", nlset, LSETSIZE);
586 Bprint(foutput, "%d extra closures\n", zzclose - 2*nstate);
587 Bprint(foutput, "%d shift entries, %d exceptions\n", zzacent, zzexcp);
588 Bprint(foutput, "%d goto entries\n", zzgoent);
589 Bprint(foutput, "%d entries saved by goto default\n", zzgobest);
591 if(zzsrconf != 0 || zzrrconf != 0) {
592 print("\nconflicts: ");
594 print("%d shift/reduce", zzsrconf);
595 if(zzsrconf && zzrrconf)
598 print("%d reduce/reduce", zzrrconf);
612 * write out error comment -- NEEDS WORK
619 fprint(2, "\n fatal error:");
620 fprint(2, s, (&s)[1]);
621 fprint(2, ", %s:%d\n", infile, lineno);
630 * set elements 0 through n-1 to c
633 aryfil(int *v, int n, int c)
642 * set a to the union of a and b
643 * return 1 if b is not a subset of a, 0 otherwise
646 setunion(int *a, int *b)
669 Bprint(foutput, "\tNULL");
671 Bprint(foutput, " { ");
674 Bprint(foutput, "%s ", symnam(j));
675 Bprint(foutput, "}");
680 * compute an array with the beginnings of productions yielding given nonterminals
681 * The array pres points to these lists
682 * the array pyield has the lists: the total size is only NPROD+1
688 static int *pyield[NPROD];
694 fatfl = 0; /* make undefined symbols nonfatal */
697 *pmem++ = prdptr[j]+1;
699 error("nonterminal %s not defined!", nontrst[i].name);
708 if(pmem != &pyield[nprod])
709 error("internal Yacc error: pyield %d", pmem-&pyield[nprod]);
713 * compute an array with the first of nonterminals
718 int *p, **s, i, **t, ch, changes;
720 zzcwp = &wsets[nnonter];
722 aryfil(wsets[i].ws.lset, tbitset, 0);
724 /* initially fill the sets */
725 for(s=pres[i]; s<t; ++s)
726 for(p = *s; (ch = *p) > 0; ++p) {
728 SETBIT(wsets[i].ws.lset, ch);
731 if(!pempty[ch-NTBASE])
736 /* now, reflect transitivity */
742 for(s = pres[i]; s < t; ++s)
743 for(p = *s; (ch = (*p-NTBASE)) >= 0; ++p) {
744 changes |= setunion(wsets[i].ws.lset, wsets[ch].ws.lset);
752 pfirst[i] = flset(&wsets[i].ws);
757 Bprint(foutput, "\n%s: ", nontrst[i].name);
759 Bprint(foutput, " %d\n", pempty[i]);
764 * sorts last state,and sees if it equals earlier ones. returns state number
769 Item *p1, *p2, *k, *l, *q1, *q2;
773 p2 = pstate[nstate+1];
775 return 0; /* null state */
777 for(k = p2-1; k > p1; k--) /* make k the biggest */
778 for(l = k-1; l >= p1; --l)
779 if(l->pitem > k->pitem) {
790 size1 = p2 - p1; /* size of state */
792 for(i = (c>=NTBASE)? ntstates[c-NTBASE]: tstates[c]; i != 0; i = mstates[i]) {
800 for(l = q1; l < q2; l++) {
801 if(l->pitem != k->pitem)
808 pstate[nstate+1] = pstate[nstate]; /* delete last state */
809 /* fix up lookaheads */
812 for(l = q1, k = p1; l < q2; ++l, ++k ) {
816 clset.lset[s] = l->look->lset[s];
817 if(setunion(clset.lset, k->look->lset)) {
819 /* register the new set */
820 l->look = flset( &clset );
827 error("yacc state/nolook error");
828 pstate[nstate+2] = p2;
829 if(nstate+1 >= NSTATES)
830 error("too many states");
832 mstates[nstate] = ntstates[c-NTBASE];
833 ntstates[c-NTBASE] = nstate;
835 mstates[nstate] = tstates[c];
838 tystate[nstate] = MUSTDO;
843 putitem(int *ptr, Lkset *lptr)
847 if(pidebug && foutput != 0)
848 Bprint(foutput, "putitem(%s), state %d\n", writem(ptr), nstate);
849 j = pstate[nstate+1];
852 j->look = flset(lptr);
853 pstate[nstate+1] = ++j;
854 if((int*)j > zzmemsz) {
856 if(zzmemsz >= &mem0[MEMSIZE])
857 error("out of state space");
862 * mark nonterminals which derive the empty string
863 * also, look for nonterminals which don't derive any token strings
871 /* first, use the array pempty to detect productions that can never be reduced */
872 /* set pempty to WHONOWS */
873 aryfil(pempty, nnonter+1, WHOKNOWS);
875 /* now, look at productions, marking nonterminals which derive something */
878 if(pempty[*prdptr[i] - NTBASE])
880 for(p = prdptr[i]+1; *p >= 0; ++p)
881 if(*p >= NTBASE && pempty[*p-NTBASE] == WHOKNOWS)
883 /* production can be derived */
885 pempty[*prdptr[i]-NTBASE] = OK;
890 /* now, look at the nonterminals, to see if they are all OK */
892 /* the added production rises or falls as the start symbol ... */
895 if(pempty[i] != OK) {
897 error("nonterminal %s never derives any token string", nontrst[i].name);
907 /* now, compute the pempty array, to see which nonterminals derive the empty string */
908 /* set pempty to WHOKNOWS */
909 aryfil( pempty, nnonter+1, WHOKNOWS);
911 /* loop as long as we keep finding empty nonterminals */
915 /* not known to be empty */
916 if(pempty[*prdptr[i]-NTBASE] == WHOKNOWS) {
917 for(p = prdptr[i]+1; *p >= NTBASE && pempty[*p-NTBASE] == EMPTY ; ++p)
919 /* we have a nontrivially empty nonterminal */
921 pempty[*prdptr[i]-NTBASE] = EMPTY;
922 /* got one ... try for another */
930 * generate the states
942 /* THIS IS FUNNY from the standpoint of portability
943 * it represents the magic moment when the mem0 array, which has
944 * been holding the productions, starts to hold item pointers, of a
946 * someday, alloc should be used to allocate all this stuff... for now, we
947 * accept that if pointers don't fit in integers, there is a problem...
950 pstate[0] = pstate[1] = (Item*)mem;
951 aryfil(clset.lset, tbitset, 0);
952 putitem(prdptr[0]+1, &clset);
955 pstate[2] = pstate[1];
957 aryfil(amem, ACTSIZE, 0);
959 /* now, the main state generation loop */
963 if(tystate[i] != MUSTDO)
966 aryfil(temp1, nnonter+1, 0);
967 /* take state i, close it, and do gotos */
969 /* generate goto's */
976 if(pstate[i+1]-pstate[i] <= p-wsets)
977 tystate[i] = MUSTLOOKAHEAD;
982 /* this item contributes to the goto */
983 if(c == *(q->pitem)) {
984 putitem(q->pitem+1, &q->ws);
988 state(c); /* register new state */
990 temp1[c-NTBASE] = state(c);
992 if(gsdebug && foutput != 0) {
993 Bprint(foutput, "%d: ", i);
996 Bprint(foutput, "%s %d, ",
997 nontrst[j].name, temp1[j]);
998 Bprint(foutput, "\n");
1000 indgo[i] = apack(&temp1[1], nnonter-1) - 1;
1008 * generate the closure of state i
1016 int c, ch, work, k, *pi, **s, **t;
1020 /* first, copy kernel of state i to wsets */
1023 cwp->pitem = p->pitem;
1024 cwp->flag = 1; /* this item must get closed */
1026 cwp->ws.lset[k] = p->look->lset[k];
1030 /* now, go through the loop, closing each item */
1037 /* dot is before c */
1041 /* only interesting case is where . is before nonterminal */
1045 /* compute the lookahead */
1046 aryfil(clset.lset, tbitset, 0);
1048 /* find items involving c */
1050 if(v->flag == 1 && *(pi=v->pitem) == c) {
1054 while((ch = *++pi) > 0) {
1055 /* terminal symbol */
1057 SETBIT(clset.lset, ch);
1060 /* nonterminal symbol */
1061 setunion(clset.lset, pfirst[ch-NTBASE]->lset);
1062 if(!pempty[ch-NTBASE])
1066 setunion(clset.lset, v->ws.lset);
1070 * now loop over productions derived from c
1071 * c is now nonterminal number
1075 for(s = pres[c]; s < t; ++s) {
1077 * put these items into the closure
1081 /* yes, it is there */
1082 if(v->pitem == *s) {
1085 if(setunion(v->ws.lset, clset.lset))
1090 /* not there; make a new entry */
1091 if(cwp-wsets+1 >= WSETSIZE)
1092 error( "working set overflow");
1097 SETLOOP(k) cwp->ws.lset[k] = clset.lset[k];
1106 /* have computed closure; flags are reset; return */
1109 if(cldebug && foutput != 0) {
1110 Bprint(foutput, "\nState %d, nolook = %d\n", i, nolook);
1113 Bprint(foutput, "flag set!\n");
1115 Bprint(foutput, "\t%s", writem(u->pitem));
1117 Bprint(foutput, "\n");
1123 * decide if the lookahead set pointed to by p is known
1124 * return pointer to a perminent location for the set
1132 for(q = &lkst[nlset]; q-- > lkst;) {
1139 /* we have matched */
1145 if(nlset >= LSETSIZE)
1146 error("too many lookahead sets");
1148 q->lset[j] = p->lset[j];
1163 exits("interrupted");
1167 setup(int argc, char *argv[])
1170 int i, j, fd, lev, ty, ytab, *p;
1171 int vflag, dflag, stem;
1172 char actnm[8], *stemc, *s, dirbuf[128];
1205 error("illegal option: %c", ARGC());
1207 openup(stemc, dflag, vflag, ytab, ytabc);
1209 if((fd = mkstemp(ttempname)) >= 0){
1210 tempname = ttempname;
1211 ftemp = Bfdopen(fd, OWRITE);
1213 if((fd = mkstemp(tactname)) >= 0){
1215 faction = Bfdopen(fd, OWRITE);
1217 if(ftemp == 0 || faction == 0)
1218 error("cannot open temp file");
1220 error("no input file");
1222 if(infile[0] != '/' && getwd(dirbuf, sizeof dirbuf)!=nil){
1223 i = strlen(infile)+1+strlen(dirbuf)+1+10;
1226 snprint(s, i, "%s/%s", dirbuf, infile);
1231 finput = Bopen(infile, OREAD);
1233 error("cannot open '%s'", argv[0]);
1237 extval = PRIVATE; /* tokens start in unicode 'private use' */
1239 defin(1, "$accept");
1244 for(t = gettok(); t != MARK && t != ENDFILE;)
1251 if(gettok() != IDENTIFIER)
1252 error("bad %%start construction");
1253 start = chfind(1, tokname);
1258 if(gettok() != TYPENAME)
1259 error("bad syntax in %%type");
1265 if((t=chfind(1, tokname)) < NTBASE) {
1266 j = TYPE(toklev[t]);
1267 if(j != 0 && j != ty)
1268 error("type redeclaration of token %s",
1271 SETTYPE(toklev[t], ty);
1273 j = nontrst[t-NTBASE].value;
1274 if(j != 0 && j != ty)
1275 error("type redeclaration of nonterminal %s",
1276 nontrst[t-NTBASE].name );
1278 nontrst[t-NTBASE].value = ty;
1292 /* copy the union declaration to the output */
1303 /* nonzero means new prec. and assoc. */
1307 /* get identifiers so defined */
1310 /* there is a type defined */
1325 j = chfind(0, tokname);
1327 error("%s defined earlier as nonterminal", tokname);
1329 if(ASSOC(toklev[j]))
1330 error("redeclaration of precedence of %s", tokname);
1331 SETASC(toklev[j], lev);
1332 SETPLEV(toklev[j], i);
1336 error("redeclaration of type of %s", tokname);
1337 SETTYPE(toklev[j],ty);
1341 tokset[j].value = numbval;
1342 if(j < ndefout && j > 3)
1343 error("please define type number of %s earlier",
1360 error("syntax error");
1363 error("unexpected EOF before %%");
1366 Bprint(ftable, "extern int yyerrflag;\n");
1367 Bprint(ftable, "#ifndef YYMAXDEPTH\n");
1368 Bprint(ftable, "#define YYMAXDEPTH 150\n");
1369 Bprint(ftable, "#endif\n" );
1371 Bprint(ftable, "#ifndef YYSTYPE\n");
1372 Bprint(ftable, "#define YYSTYPE int\n");
1373 Bprint(ftable, "#endif\n");
1375 Bprint(ftable, "YYSTYPE yylval;\n");
1376 Bprint(ftable, "YYSTYPE yyval;\n");
1380 /* added production */
1383 /* if start is 0, we will overwrite with the lhs of the first rule */
1388 while((t=gettok()) == LCURLY)
1391 error("bad syntax on first rule");
1394 prdptr[0][1] = chfind(1, tokname);
1397 while(t != MARK && t != ENDFILE) {
1398 /* process a rule */
1399 rlines[nprod] = lineno;
1401 *mem++ = *prdptr[nprod-1];
1403 if(t == IDENTCOLON) {
1404 *mem = chfind(1, tokname);
1406 error("token illegal on LHS of grammar rule");
1409 error("illegal rule: missing semicolon or | ?");
1410 /* read rule body */
1414 while(t == IDENTIFIER) {
1415 *mem = chfind(1, tokname);
1417 levprd[nprod] = toklev[*mem];
1422 if(gettok() != IDENTIFIER)
1423 error("illegal %%prec syntax");
1424 j = chfind(2, tokname);
1426 error("nonterminal %s illegal after %%prec",
1427 nontrst[j-NTBASE].name);
1428 levprd[nprod] = toklev[j];
1432 levprd[nprod] |= ACTFLAG;
1433 Bprint(faction, "\ncase %d:", nprod);
1434 cpyact(mem-prdptr[nprod]-1);
1435 Bprint(faction, " break;");
1436 if((t=gettok()) == IDENTIFIER) {
1438 /* action within rule... */
1439 sprint(actnm, "$$%d", nprod);
1441 /* make it a nonterminal */
1442 j = chfind(1, actnm);
1445 * the current rule will become rule number nprod+1
1446 * move the contents down, and make room for the null
1448 for(p = mem; p >= prdptr[nprod]; --p)
1452 /* enter null production for action */
1457 /* update the production information */
1458 levprd[nprod+1] = levprd[nprod] & ~ACTFLAG;
1459 levprd[nprod] = ACTFLAG;
1460 if(++nprod >= NPROD)
1461 error("more than %d rules", NPROD);
1464 /* make the action appear in the original rule */
1467 /* get some more of the rule */
1476 /* check that default action is reasonable */
1477 if(ntypes && !(levprd[nprod]&ACTFLAG) && nontrst[*prdptr[nprod]-NTBASE].value) {
1479 /* no explicit action, LHS has value */
1482 tempty = prdptr[nprod][1];
1484 error("must return a value, since LHS has a type");
1486 if(tempty >= NTBASE)
1487 tempty = nontrst[tempty-NTBASE].value;
1489 tempty = TYPE(toklev[tempty]);
1490 if(tempty != nontrst[*prdptr[nprod]-NTBASE].value)
1491 error("default action causes potential type clash");
1495 error("more than %d rules", NPROD);
1496 prdptr[nprod] = mem;
1500 /* end of all rules */
1505 Bprint(ftable, "\n#line\t%d\t\"%s\"\n", lineno, infile);
1506 while((c=Bgetrune(finput)) != Beof)
1507 Bputrune(ftable, c);
1513 * finish action routine
1520 Bprint(ftable, "#define YYEOFCODE %d\n", 1);
1521 Bprint(ftable, "#define YYERRCODE %d\n", 2);
1525 * define s to be a terminal if t=0
1526 * or a nonterminal if t=1
1529 defin(int nt, char *s)
1537 if(nnonter >= NNONTERM)
1538 error("too many nonterminals, limit %d",NNONTERM);
1539 nontrst[nnonter].name = cstash(s);
1540 return NTBASE + nnonter;
1543 /* must be a token */
1545 if(ntokens >= NTERMS)
1546 error("too many terminals, limit %d", NTERMS);
1547 tokset[ntokens].name = cstash(s);
1549 /* establish value for token */
1550 /* single character literal */
1552 val = chartorune(&rune, &s[1]);
1559 /* escape sequence */
1560 if(s[0] == ' ' && s[1] == '\\') {
1562 /* single character escape sequence */
1564 case 'n': val = '\n'; break;
1565 case 'r': val = '\r'; break;
1566 case 'b': val = '\b'; break;
1567 case 't': val = '\t'; break;
1568 case 'f': val = '\f'; break;
1569 case '\'': val = '\''; break;
1570 case '"': val = '"'; break;
1571 case '\\': val = '\\'; break;
1572 default: error("invalid escape");
1578 if(s[2] >= '0' && s[2] <= '7') {
1584 error("illegal \\nnn construction");
1585 val = 64*s[2] + 8*s[3] + s[4] - 73*'0';
1587 error("'\\000' is illegal");
1590 error("unknown escape");
1595 tokset[ntokens].value = val;
1596 toklev[ntokens] = 0;
1601 * write out the defines (at the end of the declaration section)
1607 char sar[NAMESIZE+10];
1609 for(i=ndefout; i<=ntokens; i++) {
1611 c = tokset[i].name[0];
1612 if(c != ' ' && c != '$') {
1613 Bprint(ftable, "#define %s %d\n",
1614 tokset[i].name, tokset[i].value);
1616 Bprint(fdefine, "#define\t%s\t%d\n",
1617 tokset[i].name, tokset[i].value);
1620 ndefout = ntokens+1;
1621 if(last && fdebug) {
1622 Bprint(fdebug, "char* yytoknames[] =\n{\n");
1624 if(tokset[i].name) {
1625 chcopy(sar, tokset[i].name);
1626 Bprint(fdebug, "\t\"%s\",\n", sar);
1629 Bprint(fdebug, "\t0,\n");
1631 Bprint(fdebug, "};\n");
1642 if(cnamp >= &cnames[cnamsz])
1643 error("too many characters in id's and literals");
1655 int i, base, match, reserve;
1656 static int peekline;
1662 c = Bgetrune(finput);
1663 while(c == ' ' || c == '\n' || c == '\t' || c == '\f') {
1666 c = Bgetrune(finput);
1671 lineno += skipcom();
1683 /* get, and look up, a type name (union member name) */
1685 while((c=Bgetrune(finput)) != '>' && c >= 0 && c != '\n') {
1687 c = runetochar(&tokname[i], &rune);
1692 error("unterminated < ... > clause");
1694 for(i=1; i<=ntypes; i++)
1695 if(!strcmp(typeset[i], tokname)) {
1701 typeset[numbval] = cstash(tokname);
1710 c = Bgetrune(finput);
1711 if(c == '\n' || c <= 0)
1712 error("illegal or missing ' or \"" );
1717 c = Bgetrune(finput);
1722 c = runetochar(&tokname[i], &rune);
1730 switch(c = Bgetrune(finput)) {
1731 case '0': return TERM;
1732 case '<': return LEFT;
1733 case '2': return BINARY;
1734 case '>': return RIGHT;
1736 case '\\': return MARK;
1737 case '=': return PREC;
1738 case '{': return LCURLY;
1739 default: reserve = 1;
1746 base = (c=='0')? 8: 10;
1747 for(c = Bgetrune(finput); isdigit(c); c = Bgetrune(finput))
1748 numbval = numbval*base + (c-'0');
1752 if(islower(c) || isupper(c) || c=='_' || c=='.' || c=='$') {
1754 while(islower(c) || isupper(c) || isdigit(c) ||
1755 c == '-' || c=='_' || c=='.' || c=='$') {
1756 if(reserve && isupper(c))
1759 c = runetochar(&tokname[i], &rune);
1762 c = Bgetrune(finput);
1770 /* find a reserved word */
1772 for(c=0; resrv[c].name; c++)
1773 if(strcmp(tokname, resrv[c].name) == 0)
1774 return resrv[c].value;
1775 error("invalid escape, or illegal reserved word: %s", tokname);
1778 /* look ahead to distinguish IDENTIFIER from IDENTCOLON */
1779 c = Bgetrune(finput);
1780 while(c == ' ' || c == '\t'|| c == '\n' || c == '\f' || c == '/') {
1783 /* look for comments */
1785 peekline += skipcom();
1786 c = Bgetrune(finput);
1795 * determine the type of a symbol
1803 v = nontrst[t-NTBASE].value;
1805 v = TYPE(toklev[t]);
1807 error("must specify type for %s", (t>=NTBASE)?
1808 nontrst[t-NTBASE].name: tokset[t].name);
1813 chfind(int t, char *s)
1820 if(!strcmp(s, tokset[i].name))
1823 if(!strcmp(s, nontrst[i].name))
1826 /* cannot find name */
1828 error("%s should have been defined earlier", s);
1833 * copy the union declaration to the output, and the define file if present
1841 Bprint(ftable, "\n#line\t%d\t\"%s\"\n", lineno, infile);
1842 Bprint(ftable, "typedef union ");
1844 Bprint(fdefine, "\ntypedef union ");
1848 if((c=Bgetrune(finput)) == Beof)
1849 error("EOF encountered while processing %%union");
1850 Bputrune(ftable, c);
1852 Bputrune(fdefine, c);
1863 /* we are finished copying */
1865 Bprint(ftable, " YYSTYPE;\n");
1867 Bprint(fdefine, "\tYYSTYPE;\nextern\tYYSTYPE\tyylval;\n");
1875 * copies code between \{ and \}
1883 c = Bgetrune(finput);
1885 c = Bgetrune(finput);
1888 Bprint(ftable, "\n#line\t%d\t\"%s\"\n", lineno, infile);
1891 if((c=Bgetrune(finput)) == '}')
1893 Bputc(ftable, '\\');
1896 if((c=Bgetrune(finput)) == '}')
1900 Bputrune(ftable, c);
1903 c = Bgetrune(finput);
1905 error("eof before %%}");
1909 * skip over comments
1910 * skipcom is called after reading a '/'
1918 /* i is the number of lines skipped */
1920 if(Bgetrune(finput) != '*')
1921 error("illegal comment");
1922 c = Bgetrune(finput);
1925 if((c=Bgetrune(finput)) == '/')
1929 c = Bgetrune(finput);
1931 error("EOF inside comment");
1936 * copy C action to the next ; or closing }
1942 int brac, match, j, s, fnd, tok;
1944 Bprint(faction, "\n#line\t%d\t\"%s\"\n", lineno, infile);
1948 c = Bgetrune(finput);
1953 Bputrune(faction, c);
1965 c = Bgetrune(finput);
1967 /* type description */
1970 if(gettok() != TYPENAME)
1971 error("bad syntax on $<ident> clause");
1973 c = Bgetrune(finput);
1976 Bprint(faction, "yyval");
1978 /* put out the proper tag... */
1981 tok = fdtype(*prdptr[nprod]);
1982 Bprint(faction, ".%s", typeset[tok]);
1988 c = Bgetrune(finput);
1994 c = Bgetrune(finput);
1999 error("Illegal use of $%d", j+offset);
2002 Bprint(faction, "yypt[-%d].yyv", -j);
2004 /* put out the proper tag */
2006 if(j+offset <= 0 && tok < 0)
2007 error("must specify type of $%d", j+offset);
2009 tok = fdtype(prdptr[nprod][j+offset]);
2010 Bprint(faction, ".%s", typeset[tok]);
2014 if(isupper(c) || islower(c) || c == '_' || c == '.') {
2015 int tok; /* tok used oustide for type info */
2017 /* look for $name */
2019 if(gettok() != IDENTIFIER)
2020 error("$ must be followed by an identifier");
2021 tok = chfind(2, tokname);
2022 if((c = Bgetrune(finput)) != '#') {
2026 if(gettok() != NUMBER) {
2027 error("# must be followed by number");
2031 for(j=1; j<=offset; ++j)
2032 if(tok == prdptr[nprod][j]) {
2038 error("$name or $name#number not found");
2040 Bputc(faction, '$');
2042 Bputc(faction, '-');
2049 Bputrune(faction, c);
2053 /* look for comments */
2054 Bputrune(faction, c);
2055 c = Bgetrune(finput);
2059 /* it really is a comment */
2060 Bputrune(faction, c);
2061 c = Bgetrune(finput);
2064 Bputrune(faction, c);
2065 if((c=Bgetrune(finput)) == '/')
2068 Bputrune(faction, c);
2071 c = Bgetrune(finput);
2073 error("EOF inside comment");
2076 /* character constant */
2081 /* character string */
2085 Bputrune(faction, c);
2086 while(c = Bgetrune(finput)) {
2088 Bputrune(faction, c);
2089 c = Bgetrune(finput);
2096 error("newline in string or char. const.");
2097 Bputrune(faction, c);
2099 error("EOF in string or character constant");
2102 error("action does not terminate");
2110 Bputrune(faction, c);
2115 openup(char *stem, int dflag, int vflag, int ytab, char *ytabc)
2120 sprint(buf, "%s.%s", stem, FILEU);
2121 foutput = Bopen(buf, OWRITE);
2123 error("cannot open %s", buf);
2126 sprint(buf, "%s.%s", stem, FILEDEBUG);
2127 if((fdebug = Bopen(buf, OWRITE)) == 0)
2128 error("can't open %s", buf);
2131 sprint(buf, "%s.%s", stem, FILED);
2132 fdefine = Bopen(buf, OWRITE);
2134 error("can't create %s", buf);
2137 sprint(buf, "%s.%s", stem, OFILE);
2140 ftable = Bopen(buf, OWRITE);
2142 error("cannot open table file %s", buf);
2146 * print the output for the states
2154 Bprint(ftable, "short yyexca[] =\n{");
2156 Bprint(fdebug, "char* yystates[] =\n{\n");
2158 /* output the stuff for state i */
2160 nolook = tystate[i]!=MUSTLOOKAHEAD;
2163 /* output actions */
2165 aryfil(temp1, ntokens+nnonter+1, 0);
2168 if(c > 1 && c < NTBASE && temp1[c] == 0) {
2170 if(c == *(v->pitem))
2171 putitem(v->pitem+1, (Lkset*)0);
2172 temp1[c] = state(c);
2174 if(c > NTBASE && temp1[(c -= NTBASE) + ntokens] == 0)
2175 temp1[c+ntokens] = amem[indgo[i]+c];
2178 temp1[1] = ACCEPTCODE;
2180 /* now, we have the shifts; look at the reductions */
2189 if(BIT(u->ws.lset, k)) {
2193 if(temp1[k] < 0) { /* reduce/reduce conflict */
2196 "\n%d: reduce/reduce conflict"
2197 " (red'ns %d and %d ) on %s",
2198 i, -temp1[k], lastred,
2200 if(-temp1[k] > lastred)
2201 temp1[k] = -lastred;
2204 /* potential shift/reduce conflict */
2205 precftn( lastred, k, i );
2213 Bprint(fdebug, "};\n");
2214 Bprint(ftable, "};\n");
2215 Bprint(ftable, "#define YYNPROD %d\n", nprod);
2216 Bprint(ftable, "#define YYPRIVATE %d\n", PRIVATE);
2218 Bprint(ftable, "#define yydebug %s\n", yydebug);
2222 * pack state i from temp1 into amem
2225 apack(int *p, int n)
2227 int *pp, *qq, *rr, off, *q, *r;
2229 /* we don't need to worry about checking because
2230 * we will only look at entries known to be there...
2231 * eliminate leading and trailing 0's
2235 for(pp = p, off = 0; *pp == 0 && pp <= q; ++pp, --off)
2242 /* now, find a place for the elements from p to q, inclusive */
2243 r = &amem[ACTSIZE-1];
2244 for(rr = amem; rr <= r; rr++, off++) {
2245 for(qq = rr, pp = p; pp <= q; pp++, qq++)
2247 if(*pp != *qq && *qq != 0)
2250 /* we have found an acceptable k */
2251 if(pkdebug && foutput != 0)
2252 Bprint(foutput, "off = %d, k = %d\n", off, (int)(rr-amem));
2253 for(qq = rr, pp = p; pp <= q; pp++, qq++)
2256 error("action table overflow");
2261 if(pkdebug && foutput != 0)
2262 for(pp = amem; pp <= memp; pp += 10) {
2263 Bprint(foutput, "\t");
2264 for(qq = pp; qq <= pp+9; qq++)
2265 Bprint(foutput, "%d ", *qq);
2266 Bprint(foutput, "\n");
2271 error("no space in action table");
2276 * output the gotos for the nontermninals
2281 int i, j, k, best, count, cbest, times;
2283 /* mark begining of gotos */
2284 Bprint(ftemp, "$\n");
2285 for(i = 1; i <= nnonter; i++) {
2288 /* find the best one to make default */
2292 /* is j the most frequent */
2293 for(j = 0; j <= nstate; j++) {
2296 if(tystate[j] == best)
2299 /* is tystate[j] the most frequent */
2302 for(k = j; k <= nstate; k++)
2303 if(tystate[k] == cbest)
2311 /* best is now the default entry */
2312 zzgobest += times-1;
2313 for(j = 0; j <= nstate; j++)
2314 if(tystate[j] != 0 && tystate[j] != best) {
2315 Bprint(ftemp, "%d,%d,", j, tystate[j]);
2319 /* now, the default */
2323 Bprint(ftemp, "%d\n", best);
2328 * output the gotos for nonterminal c
2337 /* first, find nonterminals with gotos on c */
2338 aryfil(temp1, nnonter+1, 0);
2345 /* cc is a nonterminal */
2346 if((cc=prdptr[i][1]-NTBASE) >= 0)
2347 /* cc has a goto on c */
2348 if(temp1[cc] != 0) {
2350 /* thus, the left side of production i does too */
2351 cc = *prdptr[i]-NTBASE;
2352 if(temp1[cc] == 0) {
2359 /* now, we have temp1[c] = 1 if a goto on c in closure of cc */
2360 if(g2debug && foutput != 0) {
2361 Bprint(foutput, "%s: gotos on ", nontrst[c].name);
2364 Bprint(foutput, "%s ", nontrst[i].name);
2365 Bprint(foutput, "\n");
2368 /* now, go through and put gotos into tystate */
2369 aryfil(tystate, nstate, 0);
2372 if((cc = *p->pitem) >= NTBASE)
2373 /* goto on c is possible */
2374 if(temp1[cc-NTBASE]) {
2375 tystate[i] = amem[indgo[i]+c];
2381 * decide a shift/reduce conflict by precedence.
2382 * r is a rule number, t a token number
2383 * the conflict is in state s
2384 * temp1[t] is changed to reflect the action
2387 precftn(int r, int t, int s)
2393 if(PLEVEL(lt) == 0 || PLEVEL(lp) == 0) {
2398 "\n%d: shift/reduce conflict (shift %d(%d), red'n %d(%d)) on %s",
2399 s, temp1[t], PLEVEL(lt), r, PLEVEL(lp), symnam(t));
2403 if(PLEVEL(lt) == PLEVEL(lp))
2406 if(PLEVEL(lt) > PLEVEL(lp))
2407 action = RASC; /* shift */
2409 action = LASC; /* reduce */
2411 case BASC: /* error action */
2414 case LASC: /* reduce */
2422 * temp1 has the actions, lastred the default
2427 int p, p0, p1, ntimes, tred, count, j, flag;
2429 /* find the best choice for lastred */
2435 if(temp1[j]+lastred == 0)
2437 /* count the number of appearances of temp1[j] */
2440 levprd[tred] |= REDFLAG;
2442 if(temp1[p]+tred == 0)
2444 if(count > ntimes) {
2451 * for error recovery, arrange that, if there is a shift on the
2452 * error recovery token, `error', that the default be the error action
2457 /* clear out entries in temp1 which equal lastred */
2459 if(temp1[p]+lastred == 0)
2463 defact[i] = lastred;
2466 if((p1=temp1[p0]) != 0) {
2471 if(p1 == ACCEPTCODE) {
2479 Bprint(ftable, "-1, %d,\n", i);
2480 Bprint(ftable, "\t%d, %d,\n", p0, p1);
2484 Bprint(ftemp, "%d,%d,", p0, p1);
2489 Bprint(ftable, "\t-2, %d,\n", lastred);
2491 Bprint(ftemp, "\n");
2506 Bprint(fdebug, " 0, /*%d*/\n", i);
2508 Bprint(fdebug, " \"");
2510 Bprint(fdebug, "%s\\n", writem(pp->pitem));
2511 if(tystate[i] == MUSTLOOKAHEAD)
2512 WSLOOP(wsets + (pstate[i+1] - pstate[i]), u)
2514 Bprint(fdebug, "%s\\n", writem(u->pitem));
2515 Bprint(fdebug, "\", /*%d*/\n", i);
2520 Bprint(foutput, "\nstate %d\n", i);
2522 Bprint(foutput, "\t%s\n", writem(pp->pitem));
2523 if(tystate[i] == MUSTLOOKAHEAD)
2524 /* print out empty productions in closure */
2525 WSLOOP(wsets+(pstate[i+1]-pstate[i]), u)
2527 Bprint(foutput, "\t%s\n", writem(u->pitem));
2529 /* check for state equal to another */
2531 if((j1=temp1[j0]) != 0) {
2532 Bprint(foutput, "\n\t%s ", symnam(j0));
2533 /* shift, error, or accept */
2535 if(j1 == ACCEPTCODE)
2536 Bprint(foutput, "accept");
2539 Bprint(foutput, "error");
2541 Bprint(foutput, "shift %d", j1);
2543 Bprint(foutput, "reduce %d (src line %d)", -j1, rlines[-j1]);
2546 /* output the final production */
2548 Bprint(foutput, "\n\t. reduce %d (src line %d)\n\n",
2549 lastred, rlines[lastred]);
2551 Bprint(foutput, "\n\t. error\n\n");
2553 /* now, output nonterminal actions */
2555 for(j0 = 1; j0 <= nnonter; j0++) {
2558 Bprint(foutput, "\t%s goto %d\n", symnam(j0+NTBASE), temp1[j1]);
2563 warray(char *s, int *v, int n)
2567 Bprint(ftable, "short %s[] =\n{", s);
2570 Bprint(ftable, "\n");
2571 Bprint(ftable, "%4d", v[i]);
2574 Bprint(ftable, "\n};\n");
2577 Bprint(ftable, ",");
2582 * in order to free up the mem and amem arrays for the optimizer,
2583 * and still be able to output yyr1, etc., after the sizes of
2584 * the action array is known, we hide the nonterminals
2585 * derived by productions in levprd.
2596 if(!(levprd[i] & REDFLAG)) {
2599 Bprint(foutput, "Rule not reduced: %s\n", writem(prdptr[i]));
2601 levprd[i] = *prdptr[i] - NTBASE;
2604 print("%d rules never reduced\n", j);
2610 int i, *p, j, k, *q;
2612 /* read the arrays from tempfile and set parameters */
2613 finput = Bopen(tempname, OREAD);
2615 error("optimizer cannot open tempfile");
2626 temp1[nstate] = pmem - mem0;
2632 error("bad tempfile");
2638 temp1[nstate] = yypgo[0] = pmem - mem0;
2643 yypgo[nnonter] = pmem-mem0;
2649 error("bad tempfile");
2654 yypgo[nnonter--] = pmem - mem0;
2655 for(i = 0; i < nstate; i++) {
2658 q = mem0 + temp1[i+1];
2659 for(p = mem0 + temp1[i]; p < q ; p += 2) {
2665 /* nontrivial situation */
2667 /* j is now the range */
2668 /* j -= k; *//* call scj */
2672 tystate[i] = (temp1[i+1]-temp1[i]) + 2*j;
2677 /* initialize ggreed table */
2678 for(i = 1; i <= nnonter; i++) {
2682 /* minimum entry index is always 0 */
2683 q = mem0 + yypgo[i+1] - 1;
2684 for(p = mem0+yypgo[i]; p < q ; p += 2) {
2689 ggreed[i] = ggreed[i] + 2*j;
2694 /* now, prepare to put the shift actions into the amem array */
2695 for(i = 0; i < ACTSIZE; i++)
2698 for(i = 0; i < nstate; i++) {
2699 if(tystate[i] == 0 && adb > 1)
2700 Bprint(ftable, "State %d: null\n", i);
2703 while((i = nxti()) != NOMORE)
2709 /* print amem array */
2711 for(p = amem; p <= maxa; p += 10) {
2712 Bprint(ftable, "%4d ", (int)(p-amem));
2713 for(i = 0; i < 10; ++i)
2714 Bprint(ftable, "%4d ", p[i]);
2715 Bprint(ftable, "\n");
2718 /* write out the output appropriate to the language */
2727 int *p, *r, *s, *q1, *q2;
2729 /* enter gotos on nonterminal i into array amem */
2732 q2 = mem0+ yypgo[i+1] - 1;
2733 q1 = mem0 + yypgo[i];
2735 /* now, find amem place for it */
2736 for(p = amem; p < &amem[ACTSIZE]; p++) {
2739 for(r = q1; r < q2; r += 2) {
2744 if((maxa = s) > &amem[ACTSIZE])
2745 error("a array overflow");
2747 /* we have found amem spot */
2750 if((maxa = p) > &amem[ACTSIZE])
2751 error("a array overflow");
2752 for(r = q1; r < q2; r += 2) {
2758 Bprint(ftable, "Nonterminal %d, entry at %d\n", i, pgo[i]);
2763 error("cannot place goto %d\n", i);
2769 int *r, *s, n, flag, j, *q1, *q2;
2773 /* enter state i into the amem array */
2774 q2 = mem0+temp1[i+1];
2776 /* find an acceptable place */
2777 for(n = -maxoff; n < ACTSIZE; n++) {
2779 for(r = q1; r < q2; r += 2) {
2780 if((s = *r + n + amem) < amem)
2789 /* check that the position equals another only if the states are identical */
2790 for(j=0; j<nstate; j++) {
2793 /* we have some disagreement */
2796 if(temp1[j+1]+temp1[i] == temp1[j]+temp1[i+1]) {
2798 /* states are equal */
2802 "State %d: entry at %d equals state %d\n",
2807 /* we have some disagreement */
2812 for(r = q1; r < q2; r += 2) {
2813 if((s = *r+n+amem) >= &amem[ACTSIZE])
2814 error("out of space in optimizer a array");
2817 if(*s != 0 && *s != r[1])
2818 error("clobber of a array, pos'n %d, by %d", s-amem, r[1]);
2823 Bprint(ftable, "State %d: entry at %d\n", i, indgo[i]);
2827 error("Error; failure to place state %d\n", i);
2840 for(i = 1; i <= nnonter; i++)
2841 if(ggreed[i] >= max) {
2845 for(i = 0; i < nstate; ++i)
2846 if(tystate[i] >= max) {
2851 Bprint(ftable, "nxti = %d, max = %d\n", maxi, max);
2869 for(p = maxa; p >= amem; p--)
2873 Bprint(foutput, "Optimizer space used: input %d/%d, output %d/%d\n",
2874 (int)(pmem-mem0+1), MEMSIZE, (int)(maxa-amem+1), ACTSIZE);
2875 Bprint(foutput, "%d table entries, %d zero\n", (int)(maxa-amem+1), i);
2876 Bprint(foutput, "maximum spread: %d, maximum offset: %d\n", maxspr, maxoff);
2880 * this version is for C
2881 * write out the optimized parser
2886 Bprint(ftable, "#define\tYYLAST\t%d\n", (int)(maxa-amem+1));
2887 arout("yyact", amem, (maxa-amem)+1);
2888 arout("yypact", indgo, nstate);
2889 arout("yypgo", pgo, nnonter+1);
2893 arout(char *s, int *v, int n)
2897 Bprint(ftable, "short %s[] =\n{", s);
2898 for(i = 0; i < n;) {
2900 Bprint(ftable, "\n");
2901 Bprint(ftable, "%4d", v[i]);
2904 Bprint(ftable, "\n};\n");
2906 Bprint(ftable, ",");
2911 * read and convert an integer from the standard input
2912 * return the terminating character
2913 * blanks, tabs, and newlines are ignored
2922 while((c=Bgetrune(finput)) != Beof) {
2924 val = val*10 + c-'0';
2936 if(pmem >= &mem0[MEMSIZE])
2937 error("out of space");