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 "/sys/lib/yaccpar"
17 #define PARSERS "/sys/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+UTFmax+1]; /* 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 Blethal(finput, nil);
406 warray("yyr1", levprd, nprod);
407 aryfil(temp1, nprod, 0);
409 temp1[i] = prdptr[i+1]-prdptr[i]-2;
410 warray("yyr2", temp1, nprod);
412 aryfil(temp1, nstate, -1000);
414 for(j=tstates[i]; j!=0; j=mstates[j])
417 for(j=ntstates[i]; j!=0; j=mstates[j])
419 warray("yychk", temp1, nstate);
420 warray("yydef", defact, nstate);
422 /* put out token translation tables */
423 /* table 1 has 0-256 */
424 aryfil(temp1, 256, 0);
428 if(j >= 0 && j < 256) {
430 print("yacc bug -- cant have 2 different Ts with same value\n");
431 print(" %s and %s\n", tokset[i].name, tokset[temp1[j]].name);
439 warray("yytok1", temp1, c+1);
441 /* table 2 has PRIVATE-PRIVATE+256 */
442 aryfil(temp1, 256, 0);
445 j = tokset[i].value - PRIVATE;
446 if(j >= 0 && j < 256) {
448 print("yacc bug -- cant have 2 different Ts with same value\n");
449 print(" %s and %s\n", tokset[i].name, tokset[temp1[j]].name);
457 warray("yytok2", temp1, c+1);
459 /* table 3 has everything else */
460 Bprint(ftable, "long yytok3[] =\n{\n");
464 if(j >= 0 && j < 256)
466 if(j >= PRIVATE && j < 256+PRIVATE)
469 Bprint(ftable, "%4d,%4d,", j, i);
472 Bprint(ftable, "\n");
474 Bprint(ftable, "%4d\n};\n", 0);
476 /* copy parser text */
477 while((c=Bgetrune(finput)) != Beof) {
479 if((c = Bgetrune(finput)) != 'A')
480 Bputrune(ftable, '$');
481 else { /* copy actions */
482 faction = Bopen(actname, OREAD);
484 error("cannot reopen action tempfile");
485 Blethal(faction, nil);
486 while((c=Bgetrune(faction)) != Beof)
490 c = Bgetrune(finput);
499 * copies string q into p, returning next free char ptr
502 chcopy(char* p, char* q)
517 * creates output string for item pointed to by pp
523 static char sarr[ISIZE];
529 q = chcopy(sarr, nontrst[*p-NTBASE].name);
541 q = chcopy(q, symnam(i));
542 if(q > &sarr[ISIZE-30])
543 error("item too big");
546 /* an item calling for a reduction */
550 sprint(q, "%d)", -i);
556 * return a pointer to the name of symbol i
563 cp = (i >= NTBASE)? nontrst[i-NTBASE].name: tokset[i].name;
570 * output the summary on y.output
577 Bprint(foutput, "\n%d/%d terminals, %d/%d nonterminals\n",
578 ntokens, NTERMS, nnonter, NNONTERM);
579 Bprint(foutput, "%d/%d grammar rules, %d/%d states\n",
580 nprod, NPROD, nstate, NSTATES);
581 Bprint(foutput, "%d shift/reduce, %d reduce/reduce conflicts reported\n",
583 Bprint(foutput, "%d/%d working sets used\n",
584 (int)(zzcwp-wsets), WSETSIZE);
585 Bprint(foutput, "memory: states,etc. %d/%d, parser %d/%d\n",
586 (int)(zzmemsz-mem0), MEMSIZE, (int)(memp-amem), ACTSIZE);
587 Bprint(foutput, "%d/%d distinct lookahead sets\n", nlset, LSETSIZE);
588 Bprint(foutput, "%d extra closures\n", zzclose - 2*nstate);
589 Bprint(foutput, "%d shift entries, %d exceptions\n", zzacent, zzexcp);
590 Bprint(foutput, "%d goto entries\n", zzgoent);
591 Bprint(foutput, "%d entries saved by goto default\n", zzgobest);
593 if(zzsrconf != 0 || zzrrconf != 0) {
594 print("\nconflicts: ");
596 print("%d shift/reduce", zzsrconf);
597 if(zzsrconf && zzrrconf)
600 print("%d reduce/reduce", zzrrconf);
614 * write out error comment -- NEEDS WORK
621 fprint(2, "\n fatal error:");
622 fprint(2, s, (&s)[1]);
623 fprint(2, ", %s:%d\n", infile, lineno);
632 * set elements 0 through n-1 to c
635 aryfil(int *v, int n, int c)
644 * set a to the union of a and b
645 * return 1 if b is not a subset of a, 0 otherwise
648 setunion(int *a, int *b)
671 Bprint(foutput, "\tNULL");
673 Bprint(foutput, " { ");
676 Bprint(foutput, "%s ", symnam(j));
677 Bprint(foutput, "}");
682 * compute an array with the beginnings of productions yielding given nonterminals
683 * The array pres points to these lists
684 * the array pyield has the lists: the total size is only NPROD+1
690 static int *pyield[NPROD];
696 fatfl = 0; /* make undefined symbols nonfatal */
699 *pmem++ = prdptr[j]+1;
701 error("nonterminal %s not defined!", nontrst[i].name);
710 if(pmem != &pyield[nprod])
711 error("internal Yacc error: pyield %d", pmem-&pyield[nprod]);
715 * compute an array with the first of nonterminals
720 int *p, **s, i, **t, ch, changes;
722 zzcwp = &wsets[nnonter];
724 aryfil(wsets[i].ws.lset, tbitset, 0);
726 /* initially fill the sets */
727 for(s=pres[i]; s<t; ++s)
728 for(p = *s; (ch = *p) > 0; ++p) {
730 SETBIT(wsets[i].ws.lset, ch);
733 if(!pempty[ch-NTBASE])
738 /* now, reflect transitivity */
744 for(s = pres[i]; s < t; ++s)
745 for(p = *s; (ch = (*p-NTBASE)) >= 0; ++p) {
746 changes |= setunion(wsets[i].ws.lset, wsets[ch].ws.lset);
754 pfirst[i] = flset(&wsets[i].ws);
759 Bprint(foutput, "\n%s: ", nontrst[i].name);
761 Bprint(foutput, " %d\n", pempty[i]);
766 * sorts last state,and sees if it equals earlier ones. returns state number
771 Item *p1, *p2, *k, *l, *q1, *q2;
775 p2 = pstate[nstate+1];
777 return 0; /* null state */
779 for(k = p2-1; k > p1; k--) /* make k the biggest */
780 for(l = k-1; l >= p1; --l)
781 if(l->pitem > k->pitem) {
792 size1 = p2 - p1; /* size of state */
794 for(i = (c>=NTBASE)? ntstates[c-NTBASE]: tstates[c]; i != 0; i = mstates[i]) {
802 for(l = q1; l < q2; l++) {
803 if(l->pitem != k->pitem)
810 pstate[nstate+1] = pstate[nstate]; /* delete last state */
811 /* fix up lookaheads */
814 for(l = q1, k = p1; l < q2; ++l, ++k ) {
818 clset.lset[s] = l->look->lset[s];
819 if(setunion(clset.lset, k->look->lset)) {
821 /* register the new set */
822 l->look = flset( &clset );
829 error("yacc state/nolook error");
830 pstate[nstate+2] = p2;
831 if(nstate+1 >= NSTATES)
832 error("too many states");
834 mstates[nstate] = ntstates[c-NTBASE];
835 ntstates[c-NTBASE] = nstate;
837 mstates[nstate] = tstates[c];
840 tystate[nstate] = MUSTDO;
845 putitem(int *ptr, Lkset *lptr)
849 if(pidebug && foutput != 0)
850 Bprint(foutput, "putitem(%s), state %d\n", writem(ptr), nstate);
851 j = pstate[nstate+1];
854 j->look = flset(lptr);
855 pstate[nstate+1] = ++j;
856 if((int*)j > zzmemsz) {
858 if(zzmemsz >= &mem0[MEMSIZE])
859 error("out of state space");
864 * mark nonterminals which derive the empty string
865 * also, look for nonterminals which don't derive any token strings
873 /* first, use the array pempty to detect productions that can never be reduced */
874 /* set pempty to WHONOWS */
875 aryfil(pempty, nnonter+1, WHOKNOWS);
877 /* now, look at productions, marking nonterminals which derive something */
880 if(pempty[*prdptr[i] - NTBASE])
882 for(p = prdptr[i]+1; *p >= 0; ++p)
883 if(*p >= NTBASE && pempty[*p-NTBASE] == WHOKNOWS)
885 /* production can be derived */
887 pempty[*prdptr[i]-NTBASE] = OK;
892 /* now, look at the nonterminals, to see if they are all OK */
894 /* the added production rises or falls as the start symbol ... */
897 if(pempty[i] != OK) {
899 error("nonterminal %s never derives any token string", nontrst[i].name);
909 /* now, compute the pempty array, to see which nonterminals derive the empty string */
910 /* set pempty to WHOKNOWS */
911 aryfil( pempty, nnonter+1, WHOKNOWS);
913 /* loop as long as we keep finding empty nonterminals */
917 /* not known to be empty */
918 if(pempty[*prdptr[i]-NTBASE] == WHOKNOWS) {
919 for(p = prdptr[i]+1; *p >= NTBASE && pempty[*p-NTBASE] == EMPTY ; ++p)
921 /* we have a nontrivially empty nonterminal */
923 pempty[*prdptr[i]-NTBASE] = EMPTY;
924 /* got one ... try for another */
932 * generate the states
944 /* THIS IS FUNNY from the standpoint of portability
945 * it represents the magic moment when the mem0 array, which has
946 * been holding the productions, starts to hold item pointers, of a
948 * someday, alloc should be used to allocate all this stuff... for now, we
949 * accept that if pointers don't fit in integers, there is a problem...
952 pstate[0] = pstate[1] = (Item*)mem;
953 aryfil(clset.lset, tbitset, 0);
954 putitem(prdptr[0]+1, &clset);
957 pstate[2] = pstate[1];
959 aryfil(amem, ACTSIZE, 0);
961 /* now, the main state generation loop */
965 if(tystate[i] != MUSTDO)
968 aryfil(temp1, nnonter+1, 0);
969 /* take state i, close it, and do gotos */
971 /* generate goto's */
978 if(pstate[i+1]-pstate[i] <= p-wsets)
979 tystate[i] = MUSTLOOKAHEAD;
984 /* this item contributes to the goto */
985 if(c == *(q->pitem)) {
986 putitem(q->pitem+1, &q->ws);
990 state(c); /* register new state */
992 temp1[c-NTBASE] = state(c);
994 if(gsdebug && foutput != 0) {
995 Bprint(foutput, "%d: ", i);
998 Bprint(foutput, "%s %d, ",
999 nontrst[j].name, temp1[j]);
1000 Bprint(foutput, "\n");
1002 indgo[i] = apack(&temp1[1], nnonter-1) - 1;
1010 * generate the closure of state i
1018 int c, ch, work, k, *pi, **s, **t;
1022 /* first, copy kernel of state i to wsets */
1025 cwp->pitem = p->pitem;
1026 cwp->flag = 1; /* this item must get closed */
1028 cwp->ws.lset[k] = p->look->lset[k];
1032 /* now, go through the loop, closing each item */
1039 /* dot is before c */
1043 /* only interesting case is where . is before nonterminal */
1047 /* compute the lookahead */
1048 aryfil(clset.lset, tbitset, 0);
1050 /* find items involving c */
1052 if(v->flag == 1 && *(pi=v->pitem) == c) {
1056 while((ch = *++pi) > 0) {
1057 /* terminal symbol */
1059 SETBIT(clset.lset, ch);
1062 /* nonterminal symbol */
1063 setunion(clset.lset, pfirst[ch-NTBASE]->lset);
1064 if(!pempty[ch-NTBASE])
1068 setunion(clset.lset, v->ws.lset);
1072 * now loop over productions derived from c
1073 * c is now nonterminal number
1077 for(s = pres[c]; s < t; ++s) {
1079 * put these items into the closure
1083 /* yes, it is there */
1084 if(v->pitem == *s) {
1087 if(setunion(v->ws.lset, clset.lset))
1092 /* not there; make a new entry */
1093 if(cwp-wsets+1 >= WSETSIZE)
1094 error( "working set overflow");
1099 SETLOOP(k) cwp->ws.lset[k] = clset.lset[k];
1108 /* have computed closure; flags are reset; return */
1111 if(cldebug && foutput != 0) {
1112 Bprint(foutput, "\nState %d, nolook = %d\n", i, nolook);
1115 Bprint(foutput, "flag set!\n");
1117 Bprint(foutput, "\t%s", writem(u->pitem));
1119 Bprint(foutput, "\n");
1125 * decide if the lookahead set pointed to by p is known
1126 * return pointer to a perminent location for the set
1134 for(q = &lkst[nlset]; q-- > lkst;) {
1141 /* we have matched */
1147 if(nlset >= LSETSIZE)
1148 error("too many lookahead sets");
1150 q->lset[j] = p->lset[j];
1165 exits("interrupted");
1171 fprint(2, "usage: yacc [-Dn] [-vdS] [-o outputfile] [-s stem] grammar\n");
1176 setup(int argc, char *argv[])
1179 int i, j, lev, ty, ytab, *p;
1180 int vflag, dflag, stem;
1181 char actnm[8], *stemc, *s, dirbuf[128];
1197 yydebug = EARGF(usage());
1204 ytabc = EARGF(usage());
1214 error("illegal option: %c", ARGC());
1216 openup(stemc, dflag, vflag, ytab, ytabc);
1218 ftemp = Bopen(tempname = mktemp(ttempname), OWRITE);
1219 faction = Bopen(actname = mktemp(tactname), OWRITE);
1220 if(ftemp == 0 || faction == 0)
1221 error("cannot open temp file");
1222 Blethal(ftemp, nil);
1223 Blethal(faction, nil);
1225 error("no input file");
1227 if(infile[0] != '/' && getwd(dirbuf, sizeof dirbuf)!=nil){
1228 i = strlen(infile)+1+strlen(dirbuf)+1+10;
1231 snprint(s, i, "%s/%s", dirbuf, infile);
1236 finput = Bopen(infile, OREAD);
1238 error("cannot open '%s'", argv[0]);
1239 Blethal(finput, nil);
1243 extval = PRIVATE; /* tokens start in unicode 'private use' */
1245 defin(1, "$accept");
1250 for(t = gettok(); t != MARK && t != ENDFILE;)
1257 if(gettok() != IDENTIFIER)
1258 error("bad %%start construction");
1259 start = chfind(1, tokname);
1264 if(gettok() != TYPENAME)
1265 error("bad syntax in %%type");
1271 if((t=chfind(1, tokname)) < NTBASE) {
1272 j = TYPE(toklev[t]);
1273 if(j != 0 && j != ty)
1274 error("type redeclaration of token %s",
1277 SETTYPE(toklev[t], ty);
1279 j = nontrst[t-NTBASE].value;
1280 if(j != 0 && j != ty)
1281 error("type redeclaration of nonterminal %s",
1282 nontrst[t-NTBASE].name );
1284 nontrst[t-NTBASE].value = ty;
1298 /* copy the union declaration to the output */
1309 /* nonzero means new prec. and assoc. */
1313 /* get identifiers so defined */
1316 /* there is a type defined */
1331 j = chfind(0, tokname);
1333 error("%s defined earlier as nonterminal", tokname);
1335 if(ASSOC(toklev[j]))
1336 error("redeclaration of precedence of %s", tokname);
1337 SETASC(toklev[j], lev);
1338 SETPLEV(toklev[j], i);
1342 error("redeclaration of type of %s", tokname);
1343 SETTYPE(toklev[j],ty);
1347 tokset[j].value = numbval;
1348 if(j < ndefout && j > 3)
1349 error("please define type number of %s earlier",
1366 error("syntax error");
1369 error("unexpected EOF before %%");
1372 Bprint(ftable, "extern int yyerrflag;\n");
1373 Bprint(ftable, "#ifndef YYMAXDEPTH\n");
1374 Bprint(ftable, "#define YYMAXDEPTH 150\n");
1375 Bprint(ftable, "#endif\n" );
1377 Bprint(ftable, "#ifndef YYSTYPE\n");
1378 Bprint(ftable, "#define YYSTYPE int\n");
1379 Bprint(ftable, "#endif\n");
1381 Bprint(ftable, "YYSTYPE yylval;\n");
1382 Bprint(ftable, "YYSTYPE yyval;\n");
1386 /* added production */
1389 /* if start is 0, we will overwrite with the lhs of the first rule */
1394 while((t=gettok()) == LCURLY)
1397 error("bad syntax on first rule");
1400 prdptr[0][1] = chfind(1, tokname);
1403 while(t != MARK && t != ENDFILE) {
1404 /* process a rule */
1405 rlines[nprod] = lineno;
1407 *mem++ = *prdptr[nprod-1];
1409 if(t == IDENTCOLON) {
1410 *mem = chfind(1, tokname);
1412 error("token illegal on LHS of grammar rule");
1415 error("illegal rule: missing semicolon or | ?");
1416 /* read rule body */
1420 while(t == IDENTIFIER) {
1421 *mem = chfind(1, tokname);
1423 levprd[nprod] = toklev[*mem];
1428 if(gettok() != IDENTIFIER)
1429 error("illegal %%prec syntax");
1430 j = chfind(2, tokname);
1432 error("nonterminal %s illegal after %%prec",
1433 nontrst[j-NTBASE].name);
1434 levprd[nprod] = toklev[j];
1438 levprd[nprod] |= ACTFLAG;
1439 Bprint(faction, "\ncase %d:", nprod);
1440 cpyact(mem-prdptr[nprod]-1);
1441 Bprint(faction, " break;");
1442 if((t=gettok()) == IDENTIFIER) {
1444 /* action within rule... */
1445 sprint(actnm, "$$%d", nprod);
1447 /* make it a nonterminal */
1448 j = chfind(1, actnm);
1451 * the current rule will become rule number nprod+1
1452 * move the contents down, and make room for the null
1454 for(p = mem; p >= prdptr[nprod]; --p)
1458 /* enter null production for action */
1463 /* update the production information */
1464 levprd[nprod+1] = levprd[nprod] & ~ACTFLAG;
1465 levprd[nprod] = ACTFLAG;
1466 if(++nprod >= NPROD)
1467 error("more than %d rules", NPROD);
1470 /* make the action appear in the original rule */
1473 /* get some more of the rule */
1482 /* check that default action is reasonable */
1483 if(ntypes && !(levprd[nprod]&ACTFLAG) && nontrst[*prdptr[nprod]-NTBASE].value) {
1485 /* no explicit action, LHS has value */
1488 tempty = prdptr[nprod][1];
1490 error("must return a value, since LHS has a type");
1492 if(tempty >= NTBASE)
1493 tempty = nontrst[tempty-NTBASE].value;
1495 tempty = TYPE(toklev[tempty]);
1496 if(tempty != nontrst[*prdptr[nprod]-NTBASE].value)
1497 error("default action causes potential type clash");
1501 error("more than %d rules", NPROD);
1502 prdptr[nprod] = mem;
1506 /* end of all rules */
1511 Bprint(ftable, "\n#line\t%d\t\"%s\"\n", lineno, infile);
1512 while((c=Bgetrune(finput)) != Beof)
1513 Bputrune(ftable, c);
1519 * finish action routine
1526 Bprint(ftable, "#define YYEOFCODE %d\n", 1);
1527 Bprint(ftable, "#define YYERRCODE %d\n", 2);
1531 * define s to be a terminal if t=0
1532 * or a nonterminal if t=1
1535 defin(int nt, char *s)
1543 if(nnonter >= NNONTERM)
1544 error("too many nonterminals, limit %d",NNONTERM);
1545 nontrst[nnonter].name = cstash(s);
1546 return NTBASE + nnonter;
1549 /* must be a token */
1551 if(ntokens >= NTERMS)
1552 error("too many terminals, limit %d", NTERMS);
1553 tokset[ntokens].name = cstash(s);
1555 /* establish value for token */
1556 /* single character literal */
1558 val = chartorune(&rune, &s[1]);
1565 /* escape sequence */
1566 if(s[0] == ' ' && s[1] == '\\') {
1568 /* single character escape sequence */
1570 case 'n': val = '\n'; break;
1571 case 'r': val = '\r'; break;
1572 case 'b': val = '\b'; break;
1573 case 't': val = '\t'; break;
1574 case 'f': val = '\f'; break;
1575 case '\'': val = '\''; break;
1576 case '"': val = '"'; break;
1577 case '\\': val = '\\'; break;
1578 default: error("invalid escape");
1584 if(s[2] >= '0' && s[2] <= '7') {
1590 error("illegal \\nnn construction");
1591 val = 64*s[2] + 8*s[3] + s[4] - 73*'0';
1593 error("'\\000' is illegal");
1596 error("unknown escape");
1601 tokset[ntokens].value = val;
1602 toklev[ntokens] = 0;
1607 * write out the defines (at the end of the declaration section)
1613 char sar[NAMESIZE+10];
1615 for(i=ndefout; i<=ntokens; i++) {
1617 c = tokset[i].name[0];
1618 if(c != ' ' && c != '$') {
1619 Bprint(ftable, "#define %s %d\n",
1620 tokset[i].name, tokset[i].value);
1622 Bprint(fdefine, "#define\t%s\t%d\n",
1623 tokset[i].name, tokset[i].value);
1626 ndefout = ntokens+1;
1627 if(last && fdebug) {
1628 Bprint(fdebug, "char* yytoknames[] =\n{\n");
1630 if(tokset[i].name) {
1631 chcopy(sar, tokset[i].name);
1632 Bprint(fdebug, "\t\"%s\",\n", sar);
1635 Bprint(fdebug, "\t0,\n");
1637 Bprint(fdebug, "};\n");
1648 if(cnamp >= &cnames[cnamsz])
1649 error("too many characters in id's and literals");
1661 int i, base, match, reserve;
1662 static int peekline;
1668 c = Bgetrune(finput);
1669 while(c == ' ' || c == '\n' || c == '\t' || c == '\f') {
1672 c = Bgetrune(finput);
1677 lineno += skipcom();
1689 /* get, and look up, a type name (union member name) */
1691 while((c=Bgetrune(finput)) != '>' && c >= 0 && c != '\n') {
1693 c = runetochar(&tokname[i], &rune);
1698 error("unterminated < ... > clause");
1700 for(i=1; i<=ntypes; i++)
1701 if(!strcmp(typeset[i], tokname)) {
1707 typeset[numbval] = cstash(tokname);
1716 c = Bgetrune(finput);
1717 if(c == '\n' || c <= 0)
1718 error("illegal or missing ' or \"" );
1723 c = Bgetrune(finput);
1728 c = runetochar(&tokname[i], &rune);
1736 switch(c = Bgetrune(finput)) {
1737 case '0': return TERM;
1738 case '<': return LEFT;
1739 case '2': return BINARY;
1740 case '>': return RIGHT;
1742 case '\\': return MARK;
1743 case '=': return PREC;
1744 case '{': return LCURLY;
1745 default: reserve = 1;
1752 base = (c=='0')? 8: 10;
1753 for(c = Bgetrune(finput); isdigit(c); c = Bgetrune(finput))
1754 numbval = numbval*base + (c-'0');
1758 if(islower(c) || isupper(c) || c=='_' || c=='.' || c=='$') {
1760 while(islower(c) || isupper(c) || isdigit(c) ||
1761 c == '-' || c=='_' || c=='.' || c=='$') {
1762 if(reserve && isupper(c))
1765 c = runetochar(&tokname[i], &rune);
1768 c = Bgetrune(finput);
1776 /* find a reserved word */
1778 for(c=0; resrv[c].name; c++)
1779 if(strcmp(tokname, resrv[c].name) == 0)
1780 return resrv[c].value;
1781 error("invalid escape, or illegal reserved word: %s", tokname);
1784 /* look ahead to distinguish IDENTIFIER from IDENTCOLON */
1785 c = Bgetrune(finput);
1786 while(c == ' ' || c == '\t'|| c == '\n' || c == '\f' || c == '/') {
1789 /* look for comments */
1791 peekline += skipcom();
1792 c = Bgetrune(finput);
1801 * determine the type of a symbol
1809 v = nontrst[t-NTBASE].value;
1811 v = TYPE(toklev[t]);
1813 error("must specify type for %s", (t>=NTBASE)?
1814 nontrst[t-NTBASE].name: tokset[t].name);
1819 chfind(int t, char *s)
1826 if(!strcmp(s, tokset[i].name))
1829 if(!strcmp(s, nontrst[i].name))
1832 /* cannot find name */
1834 error("%s should have been defined earlier", s);
1839 * copy the union declaration to the output, and the define file if present
1847 Bprint(ftable, "\n#line\t%d\t\"%s\"\n", lineno, infile);
1848 Bprint(ftable, "typedef union ");
1850 Bprint(fdefine, "\ntypedef union ");
1854 if((c=Bgetrune(finput)) == Beof)
1855 error("EOF encountered while processing %%union");
1856 Bputrune(ftable, c);
1858 Bputrune(fdefine, c);
1869 /* we are finished copying */
1871 Bprint(ftable, " YYSTYPE;\n");
1873 Bprint(fdefine, "\tYYSTYPE;\nextern\tYYSTYPE\tyylval;\n");
1881 * copies code between \{ and \}
1889 c = Bgetrune(finput);
1891 c = Bgetrune(finput);
1894 Bprint(ftable, "\n#line\t%d\t\"%s\"\n", lineno, infile);
1897 if((c=Bgetrune(finput)) == '}')
1899 Bputc(ftable, '\\');
1902 if((c=Bgetrune(finput)) == '}')
1906 Bputrune(ftable, c);
1909 c = Bgetrune(finput);
1911 error("eof before %%}");
1915 * skip over comments
1916 * skipcom is called after reading a '/'
1924 /* i is the number of lines skipped */
1926 c = Bgetrune(finput);
1927 if(c == '/'){ /* C++ //: skip to end of line */
1928 while((c = Bgetrune(finput)) != Beof)
1931 }else if(c == '*'){ /* normal C comment */
1932 while((c = Bgetrune(finput)) != Beof) {
1934 if((c = Bgetrune(finput)) == '/')
1940 error("illegal comment");
1942 error("EOF inside comment");
1947 * copy C action to the next ; or closing }
1953 int brac, match, j, s, fnd, tok;
1955 Bprint(faction, "\n#line\t%d\t\"%s\"\n", lineno, infile);
1959 c = Bgetrune(finput);
1964 Bputrune(faction, c);
1976 c = Bgetrune(finput);
1978 /* type description */
1981 if(gettok() != TYPENAME)
1982 error("bad syntax on $<ident> clause");
1984 c = Bgetrune(finput);
1987 Bprint(faction, "yyval");
1989 /* put out the proper tag... */
1992 tok = fdtype(*prdptr[nprod]);
1993 Bprint(faction, ".%s", typeset[tok]);
1999 c = Bgetrune(finput);
2005 c = Bgetrune(finput);
2010 error("Illegal use of $%d", j+offset);
2013 Bprint(faction, "yypt[-%d].yyv", -j);
2015 /* put out the proper tag */
2017 if(j+offset <= 0 && tok < 0)
2018 error("must specify type of $%d", j+offset);
2020 tok = fdtype(prdptr[nprod][j+offset]);
2021 Bprint(faction, ".%s", typeset[tok]);
2025 if(isupper(c) || islower(c) || c == '_' || c == '.') {
2026 int tok; /* tok used oustide for type info */
2028 /* look for $name */
2030 if(gettok() != IDENTIFIER)
2031 error("$ must be followed by an identifier");
2032 tok = chfind(2, tokname);
2033 if((c = Bgetrune(finput)) != '#') {
2037 if(gettok() != NUMBER) {
2038 error("# must be followed by number");
2042 for(j=1; j<=offset; ++j)
2043 if(tok == prdptr[nprod][j]) {
2049 error("$name or $name#number not found");
2051 Bputc(faction, '$');
2053 Bputc(faction, '-');
2060 Bputrune(faction, c);
2064 /* look for comments */
2065 Bputrune(faction, c);
2066 c = Bgetrune(finput);
2070 /* it really is a comment */
2071 Bputrune(faction, c);
2072 c = Bgetrune(finput);
2075 Bputrune(faction, c);
2076 if((c=Bgetrune(finput)) == '/')
2079 Bputrune(faction, c);
2082 c = Bgetrune(finput);
2084 error("EOF inside comment");
2087 /* character constant */
2092 /* character string */
2096 Bputrune(faction, c);
2097 while(c = Bgetrune(finput)) {
2099 Bputrune(faction, c);
2100 c = Bgetrune(finput);
2107 error("newline in string or char. const.");
2108 Bputrune(faction, c);
2110 error("EOF in string or character constant");
2113 error("action does not terminate");
2121 Bputrune(faction, c);
2126 openup(char *stem, int dflag, int vflag, int ytab, char *ytabc)
2131 snprint(buf, sizeof buf, "%s.%s", stem, FILEU);
2132 foutput = Bopen(buf, OWRITE);
2134 error("cannot open %s", buf);
2135 Blethal(foutput, nil);
2138 snprint(buf, sizeof buf, "%s.%s", stem, FILEDEBUG);
2139 if((fdebug = Bopen(buf, OWRITE)) == 0)
2140 error("can't open %s", buf);
2143 snprint(buf, sizeof buf, "%s.%s", stem, FILED);
2144 fdefine = Bopen(buf, OWRITE);
2146 error("can't create %s", buf);
2147 Blethal(fdefine, nil);
2150 snprint(buf, sizeof buf, "%s.%s", stem, OFILE);
2152 strecpy(buf, buf+sizeof buf, ytabc);
2153 ftable = Bopen(buf, OWRITE);
2155 error("cannot open table file %s", buf);
2156 Blethal(ftable, nil);
2160 * print the output for the states
2168 Bprint(ftable, "short yyexca[] =\n{");
2170 Bprint(fdebug, "char* yystates[] =\n{\n");
2172 /* output the stuff for state i */
2174 nolook = tystate[i]!=MUSTLOOKAHEAD;
2177 /* output actions */
2179 aryfil(temp1, ntokens+nnonter+1, 0);
2182 if(c > 1 && c < NTBASE && temp1[c] == 0) {
2184 if(c == *(v->pitem))
2185 putitem(v->pitem+1, (Lkset*)0);
2186 temp1[c] = state(c);
2188 if(c > NTBASE && temp1[(c -= NTBASE) + ntokens] == 0)
2189 temp1[c+ntokens] = amem[indgo[i]+c];
2192 temp1[1] = ACCEPTCODE;
2194 /* now, we have the shifts; look at the reductions */
2203 if(BIT(u->ws.lset, k)) {
2207 if(temp1[k] < 0) { /* reduce/reduce conflict */
2210 "\n%d: reduce/reduce conflict"
2211 " (red'ns %d and %d ) on %s",
2212 i, -temp1[k], lastred,
2214 if(-temp1[k] > lastred)
2215 temp1[k] = -lastred;
2218 /* potential shift/reduce conflict */
2219 precftn( lastred, k, i );
2227 Bprint(fdebug, "};\n");
2228 Bprint(ftable, "};\n");
2229 Bprint(ftable, "#define YYNPROD %d\n", nprod);
2230 Bprint(ftable, "#define YYPRIVATE %d\n", PRIVATE);
2232 Bprint(ftable, "#define yydebug %s\n", yydebug);
2236 * pack state i from temp1 into amem
2239 apack(int *p, int n)
2241 int *pp, *qq, *rr, off, *q, *r;
2243 /* we don't need to worry about checking because
2244 * we will only look at entries known to be there...
2245 * eliminate leading and trailing 0's
2249 for(pp = p, off = 0; *pp == 0 && pp <= q; ++pp, --off)
2256 /* now, find a place for the elements from p to q, inclusive */
2257 r = &amem[ACTSIZE-1];
2258 for(rr = amem; rr <= r; rr++, off++) {
2259 for(qq = rr, pp = p; pp <= q; pp++, qq++)
2261 if(*pp != *qq && *qq != 0)
2264 /* we have found an acceptable k */
2265 if(pkdebug && foutput != 0)
2266 Bprint(foutput, "off = %d, k = %d\n", off, (int)(rr-amem));
2267 for(qq = rr, pp = p; pp <= q; pp++, qq++)
2270 error("action table overflow");
2275 if(pkdebug && foutput != 0)
2276 for(pp = amem; pp <= memp; pp += 10) {
2277 Bprint(foutput, "\t");
2278 for(qq = pp; qq <= pp+9; qq++)
2279 Bprint(foutput, "%d ", *qq);
2280 Bprint(foutput, "\n");
2285 error("no space in action table");
2290 * output the gotos for the nontermninals
2295 int i, j, k, best, count, cbest, times;
2297 /* mark begining of gotos */
2298 Bprint(ftemp, "$\n");
2299 for(i = 1; i <= nnonter; i++) {
2302 /* find the best one to make default */
2306 /* is j the most frequent */
2307 for(j = 0; j <= nstate; j++) {
2310 if(tystate[j] == best)
2313 /* is tystate[j] the most frequent */
2316 for(k = j; k <= nstate; k++)
2317 if(tystate[k] == cbest)
2325 /* best is now the default entry */
2326 zzgobest += times-1;
2327 for(j = 0; j <= nstate; j++)
2328 if(tystate[j] != 0 && tystate[j] != best) {
2329 Bprint(ftemp, "%d,%d,", j, tystate[j]);
2333 /* now, the default */
2337 Bprint(ftemp, "%d\n", best);
2342 * output the gotos for nonterminal c
2351 /* first, find nonterminals with gotos on c */
2352 aryfil(temp1, nnonter+1, 0);
2359 /* cc is a nonterminal */
2360 if((cc=prdptr[i][1]-NTBASE) >= 0)
2361 /* cc has a goto on c */
2362 if(temp1[cc] != 0) {
2364 /* thus, the left side of production i does too */
2365 cc = *prdptr[i]-NTBASE;
2366 if(temp1[cc] == 0) {
2373 /* now, we have temp1[c] = 1 if a goto on c in closure of cc */
2374 if(g2debug && foutput != 0) {
2375 Bprint(foutput, "%s: gotos on ", nontrst[c].name);
2378 Bprint(foutput, "%s ", nontrst[i].name);
2379 Bprint(foutput, "\n");
2382 /* now, go through and put gotos into tystate */
2383 aryfil(tystate, nstate, 0);
2386 if((cc = *p->pitem) >= NTBASE)
2387 /* goto on c is possible */
2388 if(temp1[cc-NTBASE]) {
2389 tystate[i] = amem[indgo[i]+c];
2395 * decide a shift/reduce conflict by precedence.
2396 * r is a rule number, t a token number
2397 * the conflict is in state s
2398 * temp1[t] is changed to reflect the action
2401 precftn(int r, int t, int s)
2407 if(PLEVEL(lt) == 0 || PLEVEL(lp) == 0) {
2412 "\n%d: shift/reduce conflict (shift %d(%d), red'n %d(%d)) on %s",
2413 s, temp1[t], PLEVEL(lt), r, PLEVEL(lp), symnam(t));
2417 if(PLEVEL(lt) == PLEVEL(lp))
2420 if(PLEVEL(lt) > PLEVEL(lp))
2421 action = RASC; /* shift */
2423 action = LASC; /* reduce */
2425 case BASC: /* error action */
2428 case LASC: /* reduce */
2436 * temp1 has the actions, lastred the default
2441 int p, p0, p1, ntimes, tred, count, j, flag;
2443 /* find the best choice for lastred */
2449 if(temp1[j]+lastred == 0)
2451 /* count the number of appearances of temp1[j] */
2454 levprd[tred] |= REDFLAG;
2456 if(temp1[p]+tred == 0)
2458 if(count > ntimes) {
2465 * for error recovery, arrange that, if there is a shift on the
2466 * error recovery token, `error', that the default be the error action
2471 /* clear out entries in temp1 which equal lastred */
2473 if(temp1[p]+lastred == 0)
2477 defact[i] = lastred;
2480 if((p1=temp1[p0]) != 0) {
2485 if(p1 == ACCEPTCODE) {
2493 Bprint(ftable, "-1, %d,\n", i);
2494 Bprint(ftable, "\t%d, %d,\n", p0, p1);
2498 Bprint(ftemp, "%d,%d,", p0, p1);
2503 Bprint(ftable, "\t-2, %d,\n", lastred);
2505 Bprint(ftemp, "\n");
2520 Bprint(fdebug, " 0, /*%d*/\n", i);
2522 Bprint(fdebug, " \"");
2524 Bprint(fdebug, "%s\\n", writem(pp->pitem));
2525 if(tystate[i] == MUSTLOOKAHEAD)
2526 WSLOOP(wsets + (pstate[i+1] - pstate[i]), u)
2528 Bprint(fdebug, "%s\\n", writem(u->pitem));
2529 Bprint(fdebug, "\", /*%d*/\n", i);
2534 Bprint(foutput, "\nstate %d\n", i);
2536 Bprint(foutput, "\t%s\n", writem(pp->pitem));
2537 if(tystate[i] == MUSTLOOKAHEAD)
2538 /* print out empty productions in closure */
2539 WSLOOP(wsets+(pstate[i+1]-pstate[i]), u)
2541 Bprint(foutput, "\t%s\n", writem(u->pitem));
2543 /* check for state equal to another */
2545 if((j1=temp1[j0]) != 0) {
2546 Bprint(foutput, "\n\t%s ", symnam(j0));
2547 /* shift, error, or accept */
2549 if(j1 == ACCEPTCODE)
2550 Bprint(foutput, "accept");
2553 Bprint(foutput, "error");
2555 Bprint(foutput, "shift %d", j1);
2557 Bprint(foutput, "reduce %d (src line %d)", -j1, rlines[-j1]);
2560 /* output the final production */
2562 Bprint(foutput, "\n\t. reduce %d (src line %d)\n\n",
2563 lastred, rlines[lastred]);
2565 Bprint(foutput, "\n\t. error\n\n");
2567 /* now, output nonterminal actions */
2569 for(j0 = 1; j0 <= nnonter; j0++) {
2572 Bprint(foutput, "\t%s goto %d\n", symnam(j0+NTBASE), temp1[j1]);
2577 warray(char *s, int *v, int n)
2581 Bprint(ftable, "short %s[] =\n{", s);
2584 Bprint(ftable, "\n");
2585 Bprint(ftable, "%4d", v[i]);
2588 Bprint(ftable, "\n};\n");
2591 Bprint(ftable, ",");
2596 * in order to free up the mem and amem arrays for the optimizer,
2597 * and still be able to output yyr1, etc., after the sizes of
2598 * the action array is known, we hide the nonterminals
2599 * derived by productions in levprd.
2610 if(!(levprd[i] & REDFLAG)) {
2613 Bprint(foutput, "Rule not reduced: %s\n", writem(prdptr[i]));
2615 levprd[i] = *prdptr[i] - NTBASE;
2618 print("%d rules never reduced\n", j);
2624 int i, *p, j, k, *q;
2626 /* read the arrays from tempfile and set parameters */
2627 finput = Bopen(tempname, OREAD);
2629 error("optimizer cannot open tempfile");
2630 Blethal(finput, nil);
2641 temp1[nstate] = pmem - mem0;
2647 error("bad tempfile");
2653 temp1[nstate] = yypgo[0] = pmem - mem0;
2658 yypgo[nnonter] = pmem-mem0;
2664 error("bad tempfile");
2669 yypgo[nnonter--] = pmem - mem0;
2670 for(i = 0; i < nstate; i++) {
2673 q = mem0 + temp1[i+1];
2674 for(p = mem0 + temp1[i]; p < q ; p += 2) {
2680 /* nontrivial situation */
2682 /* j is now the range */
2683 /* j -= k; /* call scj */
2687 tystate[i] = (temp1[i+1]-temp1[i]) + 2*j;
2692 /* initialize ggreed table */
2693 for(i = 1; i <= nnonter; i++) {
2697 /* minimum entry index is always 0 */
2698 q = mem0 + yypgo[i+1] - 1;
2699 for(p = mem0+yypgo[i]; p < q ; p += 2) {
2704 ggreed[i] = ggreed[i] + 2*j;
2709 /* now, prepare to put the shift actions into the amem array */
2710 for(i = 0; i < ACTSIZE; i++)
2713 for(i = 0; i < nstate; i++) {
2714 if(tystate[i] == 0 && adb > 1)
2715 Bprint(ftable, "State %d: null\n", i);
2718 while((i = nxti()) != NOMORE)
2724 /* print amem array */
2726 for(p = amem; p <= maxa; p += 10) {
2727 Bprint(ftable, "%4d ", (int)(p-amem));
2728 for(i = 0; i < 10; ++i)
2729 Bprint(ftable, "%4d ", p[i]);
2730 Bprint(ftable, "\n");
2733 /* write out the output appropriate to the language */
2742 int *p, *r, *s, *q1, *q2;
2744 /* enter gotos on nonterminal i into array amem */
2747 q2 = mem0+ yypgo[i+1] - 1;
2748 q1 = mem0 + yypgo[i];
2750 /* now, find amem place for it */
2751 for(p = amem; p < &amem[ACTSIZE]; p++) {
2754 for(r = q1; r < q2; r += 2) {
2759 if((maxa = s) > &amem[ACTSIZE])
2760 error("a array overflow");
2762 /* we have found amem spot */
2765 if((maxa = p) > &amem[ACTSIZE])
2766 error("a array overflow");
2767 for(r = q1; r < q2; r += 2) {
2773 Bprint(ftable, "Nonterminal %d, entry at %d\n", i, pgo[i]);
2778 error("cannot place goto %d\n", i);
2784 int *r, *s, n, flag, j, *q1, *q2;
2788 /* enter state i into the amem array */
2789 q2 = mem0+temp1[i+1];
2791 /* find an acceptable place */
2792 for(n = -maxoff; n < ACTSIZE; n++) {
2794 for(r = q1; r < q2; r += 2) {
2795 if((s = *r + n + amem) < amem)
2804 /* check that the position equals another only if the states are identical */
2805 for(j=0; j<nstate; j++) {
2808 /* we have some disagreement */
2811 if(temp1[j+1]+temp1[i] == temp1[j]+temp1[i+1]) {
2813 /* states are equal */
2817 "State %d: entry at %d equals state %d\n",
2822 /* we have some disagreement */
2827 for(r = q1; r < q2; r += 2) {
2828 if((s = *r+n+amem) >= &amem[ACTSIZE])
2829 error("out of space in optimizer a array");
2832 if(*s != 0 && *s != r[1])
2833 error("clobber of a array, pos'n %d, by %d", s-amem, r[1]);
2838 Bprint(ftable, "State %d: entry at %d\n", i, indgo[i]);
2842 error("Error; failure to place state %d\n", i);
2855 for(i = 1; i <= nnonter; i++)
2856 if(ggreed[i] >= max) {
2860 for(i = 0; i < nstate; ++i)
2861 if(tystate[i] >= max) {
2866 Bprint(ftable, "nxti = %d, max = %d\n", maxi, max);
2884 for(p = maxa; p >= amem; p--)
2888 Bprint(foutput, "Optimizer space used: input %d/%d, output %d/%d\n",
2889 (int)(pmem-mem0+1), MEMSIZE, (int)(maxa-amem+1), ACTSIZE);
2890 Bprint(foutput, "%d table entries, %d zero\n", (int)(maxa-amem+1), i);
2891 Bprint(foutput, "maximum spread: %d, maximum offset: %d\n", maxspr, maxoff);
2895 * this version is for C
2896 * write out the optimized parser
2901 Bprint(ftable, "#define\tYYLAST\t%d\n", (int)(maxa-amem+1));
2902 arout("yyact", amem, (maxa-amem)+1);
2903 arout("yypact", indgo, nstate);
2904 arout("yypgo", pgo, nnonter+1);
2908 arout(char *s, int *v, int n)
2912 Bprint(ftable, "short %s[] =\n{", s);
2913 for(i = 0; i < n;) {
2915 Bprint(ftable, "\n");
2916 Bprint(ftable, "%4d", v[i]);
2919 Bprint(ftable, "\n};\n");
2921 Bprint(ftable, ",");
2926 * read and convert an integer from the standard input
2927 * return the terminating character
2928 * blanks, tabs, and newlines are ignored
2937 while((c=Bgetrune(finput)) != Beof) {
2939 val = val*10 + c-'0';
2951 if(pmem >= &mem0[MEMSIZE])
2952 error("out of space");