export ROOT=`pwd`
-export BIN=$ROOT/cross/bin
export INCLUDE=$ROOT/cross/usr/include
export SCRIPTS=$ROOT/scripts
export PATH=$SCRIPTS:$PATH
while test $# -ge 1
do
- sed -e 's/ \(-\)\?cc / \1${CC} /; s/ \(-\)\?ld / \1${LD} /; s/\([ ]\)cc -M /\1${CC} -M /g; /^# DO NOT DELETE THIS LINE -- make depend uses it$/{N; q}' -i $1
+ sed -e 's/ \(-\)\?cc / \1${CC} /; s/ \(-\)\?ld / \1${LD} /; s/ \(-\)\?yacc / \1${YACC} /; s/ \(-\)\?lex / \1${LEX} /; s/\([ ]\)cc -M /\1${CC} -M /g; /^# DO NOT DELETE THIS LINE -- make depend uses it$/{N; q}' -i $1
if grep -q '\${LD}' $1 && ! grep -q '^LD[ ]*=' $1
then
sed -e '1iLD=ld' -i $1
fi
+ if grep -q '\${YACC}' $1 && ! grep -q '^YACC[ ]*=' $1
+ then
+ sed -e '1iYACC=yacc' -i $1
+ fi
+ if grep -q '\${LEX}' $1 && ! grep -q '^LEX[ ]*=' $1
+ then
+ sed -e '1iLEX=lex' -i $1
+ fi
shift
done
#!/bin/sh
ROOT=`dirname $0`/..
ROOT=`cd $ROOT && pwd`
-make CC="$ROOT/cross/bin/hostcc -Dvax" LD="$ROOT/cross/bin/hostld" DESTDIR="$ROOT/cross" $@
+make CC="$ROOT/cross/bin/hostcc -Dunix -Dvax" LD="$ROOT/cross/bin/hostld" DESTDIR="$ROOT/cross" $@
+YACC=yacc
# Makefile 4.1 83/08/11
#
CFLAGS = -O
all: lex
lex: lmain.o y.tab.o sub1.o sub2.o header.o
- cc lmain.o y.tab.o sub1.o sub2.o header.o -o lex
+ ${CC} lmain.o y.tab.o sub1.o sub2.o header.o -o lex
smallex:
- cc -DSMALL -O lmain.c y.tab.c sub1.c sub2.c header.c -o smallex
+ ${CC} -DSMALL -O lmain.c y.tab.c sub1.c sub2.c header.c -o smallex
y.tab.c: parser.y
- yacc parser.y
-lmain.o:lmain.c ldefs.c once.c
- cc -c -O lmain.c
-sub1.o: sub1.c ldefs.c
- cc -c -O sub1.c
-sub2.o: sub2.c ldefs.c
- cc -c -O sub2.c
-header.o: header.c ldefs.c
- cc -c -O header.c
+ ${YACC} parser.y
+lmain.o: lmain.c ldefs.h
+ ${CC} -c -O lmain.c
+sub1.o: sub1.c ldefs.h
+ ${CC} -c -O sub1.c
+sub2.o: sub2.c ldefs.h
+ ${CC} -c -O sub2.c
+header.o: header.c ldefs.h
+ ${CC} -c -O header.c
install: all
install -s lex $(DESTDIR)/usr/bin
--- /dev/null
+ldefs.h vax/reg.h
+sub2.c vax/reg.h
#ifndef lint
static char sccsid[] = "@(#)header.c 4.1 (Berkeley) 8/11/83";
#endif
-# include "ldefs.c"
+# include "ldefs.h"
phead1(){
ratfor ? rhd1() : chd1();
}
# define PP 1
# ifdef unix
-# define CWIDTH 7
-# define CMASK 0177
+/*# define CWIDTH 7*/
+/*# define CMASK 0177*/
# define ASCII 1
# endif
# ifdef gcos
-# define CWIDTH 9
-# define CMASK 0777
+/*# define CWIDTH 9*/
+/*# define CMASK 0777*/
# define ASCII 1
# endif
# ifdef ibm
-# define CWIDTH 8
-# define CMASK 0377
+/*# define CWIDTH 8*/
+/*# define CMASK 0377*/
# define EBCDIC 1
# endif
static char sccsid[] = "@(#)lmain.c 4.3 (Berkeley) 2/21/85";
#endif
-# include "ldefs.c"
-# include "once.c"
+# include "ldefs.h"
/* lex [-[drcyvntf]] [file] ... [file] */
/* Copyright 1976, Bell Telephone Laboratories, Inc.,
written by Eric Schmidt, August 27, 1976 */
+/* because of external definitions, this code should occur only once */
+# ifdef ASCII
+int ctable[2*NCH] = {
+ 0, 1, 2, 3, 4, 5, 6, 7, 8, 9,
+ 10, 11, 12, 13, 14, 15, 16, 17, 18, 19,
+ 20, 21, 22, 23, 24, 25, 26, 27, 28, 29,
+ 30, 31, 32, 33, 34, 35, 36, 37, 38, 39,
+ 40, 41, 42, 43, 44, 45, 46, 47, 48, 49,
+ 50, 51, 52, 53, 54, 55, 56, 57, 58, 59,
+ 60, 61, 62, 63, 64, 65, 66, 67, 68, 69,
+ 70, 71, 72, 73, 74, 75, 76, 77, 78, 79,
+ 80, 81, 82, 83, 84, 85, 86, 87, 88, 89,
+ 90, 91, 92, 93, 94, 95, 96, 97, 98, 99,
+100,101,102,103,104,105,106,107,108,109,
+110,111,112,113,114,115,116,117,118,119,
+120,121,122,123,124,125,126,127};
+# endif
+# ifdef EBCDIC
+int ctable[2*NCH] = {
+ 0, 1, 2, 3, 4, 5, 6, 7, 8, 9,
+ 10, 11, 12, 13, 14, 15, 16, 17, 18, 19,
+ 20, 21, 22, 23, 24, 25, 26, 27, 28, 29,
+ 30, 31, 32, 33, 34, 35, 36, 37, 38, 39,
+ 40, 41, 42, 43, 44, 45, 46, 47, 48, 49,
+ 50, 51, 52, 53, 54, 55, 56, 57, 58, 59,
+ 60, 61, 62, 63, 64, 65, 66, 67, 68, 69,
+ 70, 71, 72, 73, 74, 75, 76, 77, 78, 79,
+ 80, 81, 82, 83, 84, 85, 86, 87, 88, 89,
+ 90, 91, 92, 93, 94, 95, 96, 97, 98, 99,
+100,101,102,103,104,105,106,107,108,109,
+110,111,112,113,114,115,116,117,118,119,
+120,121,122,123,124,125,126,127,128,129,
+130,131,132,133,134,135,136,137,138,139,
+140,141,142,143,144,145,146,147,148,149,
+150,151,152,153,154,155,156,157,158,159,
+160,161,162,163,164,165,166,167,168,169,
+170,171,172,173,174,175,176,177,178,179,
+180,181,182,183,184,185,186,187,188,189,
+190,191,192,193,194,195,196,197,198,199,
+200,201,202,203,204,205,206,207,208,209,
+210,211,212,213,214,215,216,217,218,219,
+220,221,222,223,224,225,226,227,228,229,
+230,231,232,233,234,235,236,237,238,239,
+240,241,242,243,244,245,246,247,248,249,
+250,251,252,253,254,255};
+# endif
+int ZCH = NCH;
+FILE *fout = NULL, *errorf = {stdout};
+int sect = DEFSECTION;
+int prev = '\n'; /* previous input character */
+int pres = '\n'; /* present input character */
+int peek = '\n'; /* next input character */
+char *pushptr = pushc;
+char *slptr = slist;
+
+# if (unix || ibm)
+char *cname = "/usr/lib/lex/ncform";
+char *ratname = "/usr/lib/lex/nrform";
+# endif
+
+# ifdef gcos
+char *cname = "pounce/lexcform";
+char *ratname = "pounce/lexrform";
+# endif
+int ccount = 1;
+int casecount = 1;
+int aptr = 1;
+int nstates = NSTATES, maxpos = MAXPOS;
+int treesize = TREESIZE, ntrans = NTRANS;
+int yytop;
+int outsize = NOUTPUT;
+int sptr = 1;
+int optim = TRUE;
+int report = 2;
+int debug; /* 1 = on */
+int charc;
+int sargc;
+char **sargv;
+char buf[520];
+int ratfor; /* 1 = ratfor, 0 = C */
+int yyline; /* line number of file */
+int eof;
+int lgatflg;
+int divflg;
+int funcflag;
+int pflag;
+int chset; /* 1 = char set modified */
+FILE *fin, *fother;
+int fptr;
+int *name;
+int *left;
+int *right;
+int *parent;
+char *nullstr;
+int tptr;
+char pushc[TOKENSIZE];
+char slist[STARTSIZE];
+char **def, **subs, *dchar;
+char **sname, *schar;
+char *ccl;
+char *ccptr;
+char *dp, *sp;
+int dptr;
+char *bptr; /* store input position */
+char *tmpstat;
+int count;
+int **foll;
+int *nxtpos;
+int *positions;
+int *gotof;
+int *nexts;
+char *nchar;
+int **state;
+int *sfall; /* fallback state num */
+char *cpackflg; /* true if state has been character packed */
+int *atable;
+int nptr;
+char symbol[NCH];
+char cindex[NCH];
+int xstate;
+int stnum;
+char match[NCH];
+char extra[NACTIONS];
+char *pchar, *pcptr;
+int pchlen = TOKENSIZE;
+ long rcount;
+int *verify, *advance, *stoff;
+int scon;
+char *psave;
+int buserr(), segviol();
+
main(argc,argv)
int argc;
char **argv; {
sname[0] = sp;
sp += slength("INITIAL") + 1;
sname[1] = 0;
- if(yyparse(0)) exit(1); /* error return code */
+ if(yyparse()) exit(1); /* error return code */
/* may be disposed of: def, subs, dchar */
free1core();
/* may be gotten: tmpstat, foll, positions, gotof, nexts, nchar, state, atable, sfall, cpackflg */
error("Too little core to begin");
}
free1core(){
- cfree(def,DEFSIZE,sizeof(*def));
- cfree(subs,DEFSIZE,sizeof(*subs));
- cfree(dchar,DEFCHAR,sizeof(*dchar));
+ free(def);
+ free(subs);
+ free(dchar);
}
get2core(){
register int i, val;
for(i=0;i<=tptr;i++)foll[i] = 0;
}
free2core(){
- cfree(positions,maxpos,sizeof(*positions));
- cfree(tmpstat,tptr+1,sizeof(*tmpstat));
- cfree(foll,tptr+1,sizeof(*foll));
- cfree(name,treesize,sizeof(*name));
- cfree(left,treesize,sizeof(*left));
- cfree(right,treesize,sizeof(*right));
- cfree(parent,treesize,sizeof(*parent));
- cfree(nullstr,treesize,sizeof(*nullstr));
- cfree(state,nstates,sizeof(*state));
- cfree(sname,STARTSIZE,sizeof(*sname));
- cfree(schar,STARTCHAR,sizeof(*schar));
- cfree(ccl,CCLSIZE,sizeof(*ccl));
+ free(positions);
+ free(tmpstat);
+ free(foll);
+ free(name);
+ free(left);
+ free(right);
+ free(parent);
+ free(nullstr);
+ free(state);
+ free(sname);
+ free(schar);
+ free(ccl);
}
get3core(){
register int i, val;
}
# ifdef DEBUG
free3core(){
- cfree(advance,outsize,sizeof(*advance));
- cfree(verify,outsize,sizeof(*verify));
- cfree(stoff,stnum+1,sizeof(*stoff));
- cfree(gotof,nstates,sizeof(*gotof));
- cfree(nexts,ntrans,sizeof(*nexts));
- cfree(nchar,ntrans,sizeof(*nchar));
- cfree(atable,nstates,sizeof(*atable));
- cfree(sfall,nstates,sizeof(*sfall));
- cfree(cpackflg,nstates,sizeof(*cpackflg));
+ free(advance);
+ free(verify);
+ free(stoff);
+ free(gotof);
+ free(nexts);
+ free(nchar);
+ free(atable);
+ free(sfall);
+ free(cpackflg);
}
# endif
char *myalloc(a,b)
+++ /dev/null
-/* once.c 4.1 83/08/11 */
- /* because of external definitions, this code should occur only once */
-# ifdef ASCII
-int ctable[2*NCH] = {
- 0, 1, 2, 3, 4, 5, 6, 7, 8, 9,
- 10, 11, 12, 13, 14, 15, 16, 17, 18, 19,
- 20, 21, 22, 23, 24, 25, 26, 27, 28, 29,
- 30, 31, 32, 33, 34, 35, 36, 37, 38, 39,
- 40, 41, 42, 43, 44, 45, 46, 47, 48, 49,
- 50, 51, 52, 53, 54, 55, 56, 57, 58, 59,
- 60, 61, 62, 63, 64, 65, 66, 67, 68, 69,
- 70, 71, 72, 73, 74, 75, 76, 77, 78, 79,
- 80, 81, 82, 83, 84, 85, 86, 87, 88, 89,
- 90, 91, 92, 93, 94, 95, 96, 97, 98, 99,
-100,101,102,103,104,105,106,107,108,109,
-110,111,112,113,114,115,116,117,118,119,
-120,121,122,123,124,125,126,127};
-# endif
-# ifdef EBCDIC
-int ctable[2*NCH] = {
- 0, 1, 2, 3, 4, 5, 6, 7, 8, 9,
- 10, 11, 12, 13, 14, 15, 16, 17, 18, 19,
- 20, 21, 22, 23, 24, 25, 26, 27, 28, 29,
- 30, 31, 32, 33, 34, 35, 36, 37, 38, 39,
- 40, 41, 42, 43, 44, 45, 46, 47, 48, 49,
- 50, 51, 52, 53, 54, 55, 56, 57, 58, 59,
- 60, 61, 62, 63, 64, 65, 66, 67, 68, 69,
- 70, 71, 72, 73, 74, 75, 76, 77, 78, 79,
- 80, 81, 82, 83, 84, 85, 86, 87, 88, 89,
- 90, 91, 92, 93, 94, 95, 96, 97, 98, 99,
-100,101,102,103,104,105,106,107,108,109,
-110,111,112,113,114,115,116,117,118,119,
-120,121,122,123,124,125,126,127,128,129,
-130,131,132,133,134,135,136,137,138,139,
-140,141,142,143,144,145,146,147,148,149,
-150,151,152,153,154,155,156,157,158,159,
-160,161,162,163,164,165,166,167,168,169,
-170,171,172,173,174,175,176,177,178,179,
-180,181,182,183,184,185,186,187,188,189,
-190,191,192,193,194,195,196,197,198,199,
-200,201,202,203,204,205,206,207,208,209,
-210,211,212,213,214,215,216,217,218,219,
-220,221,222,223,224,225,226,227,228,229,
-230,231,232,233,234,235,236,237,238,239,
-240,241,242,243,244,245,246,247,248,249,
-250,251,252,253,254,255};
-# endif
-int ZCH = NCH;
-FILE *fout = NULL, *errorf = {stdout};
-int sect = DEFSECTION;
-int prev = '\n'; /* previous input character */
-int pres = '\n'; /* present input character */
-int peek = '\n'; /* next input character */
-char *pushptr = pushc;
-char *slptr = slist;
-
-# if (unix || ibm)
-char *cname = "/usr/lib/lex/ncform";
-char *ratname = "/usr/lib/lex/nrform";
-# endif
-
-# ifdef gcos
-char *cname = "pounce/lexcform";
-char *ratname = "pounce/lexrform";
-# endif
-int ccount = 1;
-int casecount = 1;
-int aptr = 1;
-int nstates = NSTATES, maxpos = MAXPOS;
-int treesize = TREESIZE, ntrans = NTRANS;
-int yytop;
-int outsize = NOUTPUT;
-int sptr = 1;
-int optim = TRUE;
-int report = 2;
-int debug; /* 1 = on */
-int charc;
-int sargc;
-char **sargv;
-char buf[520];
-int ratfor; /* 1 = ratfor, 0 = C */
-int yyline; /* line number of file */
-int eof;
-int lgatflg;
-int divflg;
-int funcflag;
-int pflag;
-int chset; /* 1 = char set modified */
-FILE *fin, *fother;
-int fptr;
-int *name;
-int *left;
-int *right;
-int *parent;
-char *nullstr;
-int tptr;
-char pushc[TOKENSIZE];
-char slist[STARTSIZE];
-char **def, **subs, *dchar;
-char **sname, *schar;
-char *ccl;
-char *ccptr;
-char *dp, *sp;
-int dptr;
-char *bptr; /* store input position */
-char *tmpstat;
-int count;
-int **foll;
-int *nxtpos;
-int *positions;
-int *gotof;
-int *nexts;
-char *nchar;
-int **state;
-int *sfall; /* fallback state num */
-char *cpackflg; /* true if state has been character packed */
-int *atable;
-int nptr;
-char symbol[NCH];
-char cindex[NCH];
-int xstate;
-int stnum;
-char match[NCH];
-char extra[NACTIONS];
-char *pchar, *pcptr;
-int pchlen = TOKENSIZE;
- long rcount;
-int *verify, *advance, *stoff;
-int scon;
-char *psave;
-int buserr(), segviol();
static char sccsid[] = "@(#)parser.y 4.1 (Berkeley) 8/11/83";
#endif
-# include "ldefs.c"
+# include "ldefs.h"
%}
%%
%{
if(c == 0)
error("Too little core for parse tree");
p = c;
- cfree(p,i,1);
+ free(p);
name = myalloc(treesize,sizeof(*name));
left = myalloc(treesize,sizeof(*left));
right = myalloc(treesize,sizeof(*right));
case 'k': case 'K': /* overriden packed char classes */
while (*p && !digit(*p))p++;
if (report==2) report=1;
- cfree(pchar, pchlen, sizeof(*pchar));
+ free(pchar);
pchlen = siconv(p);
# ifdef DEBUG
if (debug) printf( "Size classes (%%k) now %d\n",pchlen);
static char sccsid[] = "@(#)sub1.c 4.2 (Berkeley) 2/21/85";
#endif
-# include "ldefs.c"
+# include <varargs.h>
+# include "ldefs.h"
char *
getl(p) /* return next line of input, throw away trailing '\n' */
/* returns 0 if eof is had immediately */
{
return(c>='0' && c <= '9');
}
-error(s,p,d)
+error(s,va_alist)
+ char *s;
+ va_dcl
{
+ va_list argp;
+
fprintf(errorf,"\"%s\", line %d: (Error) ",
fptr > 0 ? sargv[fptr] : "<stdin>", yyline);
- fprintf(errorf,s,p,d);
+ va_start(argp);
+ vfprintf(errorf,s,argp);
+ va_end(argp);
putc('\n',errorf);
# ifdef DEBUG
if(debug && sect != ENDSECTION) {
exit(1); /* error return code */
}
-warning(s,p,d)
+warning(s,va_alist)
+ char *s;
+ va_dcl
{
+ va_list argp;
+
fprintf(errorf,"\"%s\", line %d: (Warning) ",
fptr > 0 ? sargv[fptr] : "<stdin>", yyline);
- fprintf(errorf,s,p,d);
+ va_start(argp);
+ vfprintf(errorf,s,argp);
+ va_end(argp);
putc('\n',errorf);
fflush(errorf);
fflush(fout);
static char sccsid[] = "@(#)sub2.c 4.1 (Berkeley) 8/11/83";
#endif
-# include "ldefs.c"
+# include "ldefs.h"
cfoll(v)
int v;
{
fprintf(fout, "0%-3o,",fbarr[i+j]);
putc('\n',fout);
}
- cfree(fbarr, 2*NCH, 1);
+ free(fbarr);
}
fprintf(fout,"0};\n");
}
--- /dev/null
+# define CHAR 257
+# define CCL 258
+# define NCCL 259
+# define STR 260
+# define DELIM 261
+# define SCON 262
+# define ITER 263
+# define NEWE 264
+# define NULLS 265
+# define CAT 266
+
+# line 11 "parser.y"
+#ifndef lint
+static char sccsid[] = "@(#)parser.y 4.1 (Berkeley) 8/11/83";
+#endif
+
+# include "ldefs.h"
+#define yyclearin yychar = -1
+#define yyerrok yyerrflag = 0
+extern int yychar;
+extern short yyerrflag;
+#ifndef YYMAXDEPTH
+#define YYMAXDEPTH 150
+#endif
+#ifndef YYSTYPE
+#define YYSTYPE int
+#endif
+YYSTYPE yylval, yyval;
+
+# line 19 "parser.y"
+int i;
+int j,k;
+int g;
+char *p;
+# define YYERRCODE 256
+
+# line 215 "parser.y"
+
+yylex(){
+ register char *p;
+ register int c, i;
+ char *t, *xp;
+ int n, j, k, x;
+ static int sectbegin;
+ static char token[TOKENSIZE];
+ static int iter;
+
+# ifdef DEBUG
+ yylval = 0;
+# endif
+
+ if(sect == DEFSECTION) { /* definitions section */
+ while(!eof) {
+ if(prev == '\n'){ /* next char is at beginning of line */
+ getl(p=buf);
+ switch(*p){
+ case '%':
+ switch(c= *(p+1)){
+ case '%':
+ lgate();
+ if(!ratfor)fprintf(fout,"# ");
+ fprintf(fout,"define YYNEWLINE %d\n",ctable['\n']);
+ if(!ratfor)fprintf(fout,"yylex(){\nint nstr; extern int yyprevious;\n");
+ sectbegin = TRUE;
+ i = treesize*(sizeof(*name)+sizeof(*left)+
+ sizeof(*right)+sizeof(*nullstr)+sizeof(*parent))+ALITTLEEXTRA;
+ c = myalloc(i,1);
+ if(c == 0)
+ error("Too little core for parse tree");
+ p = c;
+ free(p);
+ name = myalloc(treesize,sizeof(*name));
+ left = myalloc(treesize,sizeof(*left));
+ right = myalloc(treesize,sizeof(*right));
+ nullstr = myalloc(treesize,sizeof(*nullstr));
+ parent = myalloc(treesize,sizeof(*parent));
+ if(name == 0 || left == 0 || right == 0 || parent == 0 || nullstr == 0)
+ error("Too little core for parse tree");
+ return(freturn(DELIM));
+ case 'p': case 'P': /* has overridden number of positions */
+ while(*p && !digit(*p))p++;
+ maxpos = siconv(p);
+# ifdef DEBUG
+ if (debug) printf("positions (%%p) now %d\n",maxpos);
+# endif
+ if(report == 2)report = 1;
+ continue;
+ case 'n': case 'N': /* has overridden number of states */
+ while(*p && !digit(*p))p++;
+ nstates = siconv(p);
+# ifdef DEBUG
+ if(debug)printf( " no. states (%%n) now %d\n",nstates);
+# endif
+ if(report == 2)report = 1;
+ continue;
+ case 'e': case 'E': /* has overridden number of tree nodes */
+ while(*p && !digit(*p))p++;
+ treesize = siconv(p);
+# ifdef DEBUG
+ if (debug) printf("treesize (%%e) now %d\n",treesize);
+# endif
+ if(report == 2)report = 1;
+ continue;
+ case 'o': case 'O':
+ while (*p && !digit(*p))p++;
+ outsize = siconv(p);
+ if (report ==2) report=1;
+ continue;
+ case 'a': case 'A': /* has overridden number of transitions */
+ while(*p && !digit(*p))p++;
+ if(report == 2)report = 1;
+ ntrans = siconv(p);
+# ifdef DEBUG
+ if (debug)printf("N. trans (%%a) now %d\n",ntrans);
+# endif
+ continue;
+ case 'k': case 'K': /* overriden packed char classes */
+ while (*p && !digit(*p))p++;
+ if (report==2) report=1;
+ free(pchar);
+ pchlen = siconv(p);
+# ifdef DEBUG
+ if (debug) printf( "Size classes (%%k) now %d\n",pchlen);
+# endif
+ pchar=pcptr=myalloc(pchlen, sizeof(*pchar));
+ continue;
+ case 't': case 'T': /* character set specifier */
+ ZCH = atoi(p+2);
+ if (ZCH < NCH) ZCH = NCH;
+ if (ZCH > 2*NCH) error("ch table needs redeclaration");
+ chset = TRUE;
+ for(i = 0; i<ZCH; i++)
+ ctable[i] = 0;
+ while(getl(p) && scomp(p,"%T") != 0 && scomp(p,"%t") != 0){
+ if((n = siconv(p)) <= 0 || n > ZCH){
+ warning("Character value %d out of range",n);
+ continue;
+ }
+ while(!space(*p) && *p) p++;
+ while(space(*p)) p++;
+ t = p;
+ while(*t){
+ c = ctrans(&t);
+ if(ctable[c]){
+ if (printable(c))
+ warning("Character '%c' used twice",c);
+ else
+ warning("Character %o used twice",c);
+ }
+ else ctable[c] = n;
+ t++;
+ }
+ p = buf;
+ }
+ {
+ char chused[2*NCH]; int kr;
+ for(i=0; i<ZCH; i++)
+ chused[i]=0;
+ for(i=0; i<NCH; i++)
+ chused[ctable[i]]=1;
+ for(kr=i=1; i<NCH; i++)
+ if (ctable[i]==0)
+ {
+ while (chused[kr] == 0)
+ kr++;
+ ctable[i]=kr;
+ chused[kr]=1;
+ }
+ }
+ lgate();
+ continue;
+ case 'r': case 'R':
+ c = 'r';
+ case 'c': case 'C':
+ if(lgatflg)
+ error("Too late for language specifier");
+ ratfor = (c == 'r');
+ continue;
+ case '{':
+ lgate();
+ while(getl(p) && scomp(p,"%}") != 0)
+ fprintf(fout, "%s\n",p);
+ if(p[0] == '%') continue;
+ error("Premature eof");
+ case 's': case 'S': /* start conditions */
+ lgate();
+ while(*p && index(*p," \t,") < 0) p++;
+ n = TRUE;
+ while(n){
+ while(*p && index(*p," \t,") >= 0) p++;
+ t = p;
+ while(*p && index(*p," \t,") < 0)p++;
+ if(!*p) n = FALSE;
+ *p++ = 0;
+ if (*t == 0) continue;
+ i = sptr*2;
+ if(!ratfor)fprintf(fout,"# ");
+ fprintf(fout,"define %s %d\n",t,i);
+ scopy(t,sp);
+ sname[sptr++] = sp;
+ sname[sptr] = 0; /* required by lookup */
+ if(sptr >= STARTSIZE)
+ error("Too many start conditions");
+ sp += slength(sp) + 1;
+ if(sp >= schar+STARTCHAR)
+ error("Start conditions too long");
+ }
+ continue;
+ default:
+ warning("Invalid request %s",p);
+ continue;
+ } /* end of switch after seeing '%' */
+ case ' ': case '\t': /* must be code */
+ lgate();
+ fprintf(fout, "%s\n",p);
+ continue;
+ default: /* definition */
+ while(*p && !space(*p)) p++;
+ if(*p == 0)
+ continue;
+ prev = *p;
+ *p = 0;
+ bptr = p+1;
+ yylval = buf;
+ if(digit(buf[0]))
+ warning("Substitution strings may not begin with digits");
+ return(freturn(STR));
+ }
+ }
+ /* still sect 1, but prev != '\n' */
+ else {
+ p = bptr;
+ while(*p && space(*p)) p++;
+ if(*p == 0)
+ warning("No translation given - null string assumed");
+ scopy(p,token);
+ yylval = token;
+ prev = '\n';
+ return(freturn(STR));
+ }
+ }
+ /* end of section one processing */
+ }
+ else if(sect == RULESECTION){ /* rules and actions */
+ while(!eof){
+ switch(c=gch()){
+ case '\0':
+ return(freturn(0));
+ case '\n':
+ if(prev == '\n') continue;
+ x = NEWE;
+ break;
+ case ' ':
+ case '\t':
+ if(sectbegin == TRUE){
+ cpyact();
+ while((c=gch()) && c != '\n');
+ continue;
+ }
+ if(!funcflag)phead2();
+ funcflag = TRUE;
+ if(ratfor)fprintf(fout,"%d\n",30000+casecount);
+ else fprintf(fout,"case %d:\n",casecount);
+ if(cpyact()){
+ if(ratfor)fprintf(fout,"goto 30997\n");
+ else fprintf(fout,"break;\n");
+ }
+ while((c=gch()) && c != '\n');
+ if(peek == ' ' || peek == '\t' || sectbegin == TRUE){
+ warning("Executable statements should occur right after %%");
+ continue;
+ }
+ x = NEWE;
+ break;
+ case '%':
+ if(prev != '\n') goto character;
+ if(peek == '{'){ /* included code */
+ getl(buf);
+ while(!eof && getl(buf) && scomp("%}",buf) != 0)
+ fprintf(fout,"%s\n",buf);
+ continue;
+ }
+ if(peek == '%'){
+ c = gch();
+ c = gch();
+ x = DELIM;
+ break;
+ }
+ goto character;
+ case '|':
+ if(peek == ' ' || peek == '\t' || peek == '\n'){
+ if(ratfor)fprintf(fout,"%d\n",30000+casecount++);
+ else fprintf(fout,"case %d:\n",casecount++);
+ continue;
+ }
+ x = '|';
+ break;
+ case '$':
+ if(peek == '\n' || peek == ' ' || peek == '\t' || peek == '|' || peek == '/'){
+ x = c;
+ break;
+ }
+ goto character;
+ case '^':
+ if(prev != '\n' && scon != TRUE) goto character; /* valid only at line begin */
+ x = c;
+ break;
+ case '?':
+ case '+':
+ case '.':
+ case '*':
+ case '(':
+ case ')':
+ case ',':
+ case '/':
+ x = c;
+ break;
+ case '}':
+ iter = FALSE;
+ x = c;
+ break;
+ case '{': /* either iteration or definition */
+ if(digit(c=gch())){ /* iteration */
+ iter = TRUE;
+ ieval:
+ i = 0;
+ while(digit(c)){
+ token[i++] = c;
+ c = gch();
+ }
+ token[i] = 0;
+ yylval = siconv(token);
+ munput('c',c);
+ x = ITER;
+ break;
+ }
+ else { /* definition */
+ i = 0;
+ while(c && c!='}'){
+ token[i++] = c;
+ c = gch();
+ }
+ token[i] = 0;
+ i = lookup(token,def);
+ if(i < 0)
+ warning("Definition %s not found",token);
+ else
+ munput('s',subs[i]);
+ continue;
+ }
+ case '<': /* start condition ? */
+ if(prev != '\n') /* not at line begin, not start */
+ goto character;
+ t = slptr;
+ do {
+ i = 0;
+ c = gch();
+ while(c != ',' && c && c != '>'){
+ token[i++] = c;
+ c = gch();
+ }
+ token[i] = 0;
+ if(i == 0)
+ goto character;
+ i = lookup(token,sname);
+ if(i < 0) {
+ warning("Undefined start condition %s",token);
+ continue;
+ }
+ *slptr++ = i+1;
+ } while(c && c != '>');
+ *slptr++ = 0;
+ /* check if previous value re-usable */
+ for (xp=slist; xp<t; )
+ {
+ if (strcmp(xp, t)==0)
+ break;
+ while (*xp++);
+ }
+ if (xp<t)
+ {
+ /* re-use previous pointer to string */
+ slptr=t;
+ t=xp;
+ }
+ if(slptr > slist+STARTSIZE) /* note not packed ! */
+ error("Too many start conditions used");
+ yylval = t;
+ x = SCON;
+ break;
+ case '"':
+ i = 0;
+ while((c=gch()) && c != '"' && c != '\n'){
+ if(c == '\\') c = usescape(c=gch());
+ token[i++] = c;
+ if(i > TOKENSIZE){
+ warning("String too long");
+ i = TOKENSIZE-1;
+ break;
+ }
+ }
+ if(c == '\n') {
+ yyline--;
+ warning("Non-terminated string");
+ yyline++;
+ }
+ token[i] = 0;
+ if(i == 0)x = NULLS;
+ else if(i == 1){
+ yylval = token[0];
+ x = CHAR;
+ }
+ else {
+ yylval = token;
+ x = STR;
+ }
+ break;
+ case '[':
+ for(i=1;i<NCH;i++) symbol[i] = 0;
+ x = CCL;
+ if((c = gch()) == '^'){
+ x = NCCL;
+ c = gch();
+ }
+ while(c != ']' && c){
+ if(c == '\\') c = usescape(c=gch());
+ symbol[c] = 1;
+ j = c;
+ if((c=gch()) == '-' && peek != ']'){ /* range specified */
+ c = gch();
+ if(c == '\\') c = usescape(c=gch());
+ k = c;
+ if(j > k) {
+ n = j;
+ j = k;
+ k = n;
+ }
+ if(!(('A' <= j && k <= 'Z') ||
+ ('a' <= j && k <= 'z') ||
+ ('0' <= j && k <= '9')))
+ warning("Non-portable Character Class");
+ for(n=j+1;n<=k;n++)
+ symbol[n] = 1; /* implementation dependent */
+ c = gch();
+ }
+ }
+ /* try to pack ccl's */
+ i = 0;
+ for(j=0;j<NCH;j++)
+ if(symbol[j])token[i++] = j;
+ token[i] = 0;
+ p = ccptr;
+ if(optim){
+ p = ccl;
+ while(p <ccptr && scomp(token,p) != 0)p++;
+ }
+ if(p < ccptr) /* found it */
+ yylval = p;
+ else {
+ yylval = ccptr;
+ scopy(token,ccptr);
+ ccptr += slength(token) + 1;
+ if(ccptr >= ccl+CCLSIZE)
+ error("Too many large character classes");
+ }
+ cclinter(x==CCL);
+ break;
+ case '\\':
+ c = usescape(c=gch());
+ default:
+ character:
+ if(iter){ /* second part of an iteration */
+ iter = FALSE;
+ if('0' <= c && c <= '9')
+ goto ieval;
+ }
+ if(alpha(peek)){
+ i = 0;
+ yylval = token;
+ token[i++] = c;
+ while(alpha(peek))
+ token[i++] = gch();
+ if(peek == '?' || peek == '*' || peek == '+')
+ munput('c',token[--i]);
+ token[i] = 0;
+ if(i == 1){
+ yylval = token[0];
+ x = CHAR;
+ }
+ else x = STR;
+ }
+ else {
+ yylval = c;
+ x = CHAR;
+ }
+ }
+ scon = FALSE;
+ if(x == SCON)scon = TRUE;
+ sectbegin = FALSE;
+ return(freturn(x));
+ }
+ }
+ /* section three */
+ ptail();
+# ifdef DEBUG
+ if(debug)
+ fprintf(fout,"\n/*this comes from section three - debug */\n");
+# endif
+ while(getl(buf) && !eof)
+ fprintf(fout,"%s\n",buf);
+ return(freturn(0));
+ }
+/* end of yylex */
+# ifdef DEBUG
+XXXfreturn(i)
+ int i; {
+ if(yydebug) {
+ printf("now return ");
+ if(i < NCH) allprint(i);
+ else printf("%d",i);
+ printf(" yylval = ");
+ switch(i){
+ case STR: case CCL: case NCCL:
+ strpt(yylval);
+ break;
+ case CHAR:
+ allprint(yylval);
+ break;
+ default:
+ printf("%d",yylval);
+ break;
+ }
+ putchar('\n');
+ }
+ return(i);
+ }
+# endif
+short yyexca[] ={
+-1, 1,
+ 0, -1,
+ -2, 0,
+ };
+# define YYNPROD 33
+# define YYLAST 291
+short yyact[]={
+
+ 34, 45, 35, 23, 21, 43, 27, 28, 4, 34,
+ 16, 32, 41, 21, 46, 27, 28, 10, 34, 16,
+ 32, 8, 21, 9, 27, 28, 25, 29, 16, 6,
+ 7, 3, 24, 34, 27, 28, 29, 21, 11, 27,
+ 28, 2, 5, 16, 1, 29, 21, 0, 27, 28,
+ 0, 0, 16, 0, 0, 29, 21, 0, 20, 0,
+ 29, 0, 16, 0, 0, 21, 0, 20, 0, 29,
+ 0, 16, 0, 0, 31, 0, 20, 0, 0, 0,
+ 12, 0, 0, 12, 0, 0, 0, 0, 30, 0,
+ 0, 20, 0, 42, 36, 37, 38, 30, 0, 0,
+ 0, 0, 0, 0, 0, 39, 30, 40, 0, 0,
+ 20, 0, 0, 0, 0, 0, 0, 0, 0, 20,
+ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
+ 0, 0, 0, 0, 0, 0, 0, 0, 0, 44,
+ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
+ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
+ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
+ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
+ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
+ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
+ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
+ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
+ 0, 14, 17, 18, 15, 0, 19, 33, 0, 22,
+ 14, 17, 18, 15, 0, 19, 33, 26, 22, 14,
+ 17, 18, 15, 0, 0, 33, 0, 22, 0, 0,
+ 0, 0, 0, 0, 14, 17, 18, 15, 0, 0,
+ 33, 0, 22, 14, 17, 18, 15, 0, 0, 33,
+ 0, 22, 13, 14, 17, 18, 15, 7, 19, 0,
+ 0, 22, 14, 17, 18, 15, 0, 19, 0, 0,
+ 22 };
+short yypact[]={
+
+-248,-1000,-1000,-231,-1000, 16,-257,-1000, 16,-1000,
+-1000,-1000, -27,-262,-1000,-1000,-1000,-1000,-1000, 25,
+ 25, 25,-1000,-1000,-1000,-1000,-1000,-1000,-1000,-1000,
+ 25, -8, 25, -32,-1000,-1000, -18, 6, -36, -3,
+ -18,-124,-1000,-1000,-111,-1000,-1000 };
+short yypgo[]={
+
+ 0, 44, 41, 31, 38, 21, 23, 17, 74 };
+short yyr1[]={
+
+ 0, 1, 2, 2, 2, 6, 6, 3, 3, 4,
+ 5, 5, 7, 7, 8, 8, 8, 8, 8, 8,
+ 8, 8, 8, 8, 8, 8, 8, 8, 8, 8,
+ 8, 8, 8 };
+short yyr2[]={
+
+ 0, 1, 4, 3, 1, 1, 0, 3, 0, 1,
+ 2, 1, 2, 2, 1, 1, 1, 1, 1, 2,
+ 2, 2, 3, 2, 3, 5, 3, 4, 2, 2,
+ 2, 3, 1 };
+short yychk[]={
+
+-1000, -1, -2, -3, 256, -4, 260, 261, -5, -6,
+ -7, -4, -8, 256, 257, 260, 46, 258, 259, 262,
+ 94, 40, 265, 260, -6, -7, 264, 42, 43, 63,
+ 124, -8, 47, 263, 36, 264, -8, -8, -8, -8,
+ -8, 44, 125, 41, 263, 125, 125 };
+short yydef[]={
+
+ 8, -2, 1, 0, 4, 6, 0, 9, 6, 3,
+ 11, 5, 0, 0, 14, 15, 16, 17, 18, 0,
+ 0, 0, 32, 7, 2, 10, 12, 19, 20, 21,
+ 0, 23, 0, 0, 30, 13, 28, 29, 0, 22,
+ 24, 0, 26, 31, 0, 27, 25 };
+#ifndef lint
+static char yaccpar_sccsid[] = "@(#)yaccpar 4.1 (Berkeley) 2/11/83";
+#endif not lint
+
+#
+# define YYFLAG -1000
+# define YYERROR goto yyerrlab
+# define YYACCEPT return(0)
+# define YYABORT return(1)
+
+/* parser for yacc output */
+
+#ifdef YYDEBUG
+int yydebug = 0; /* 1 for debugging */
+#endif
+YYSTYPE yyv[YYMAXDEPTH]; /* where the values are stored */
+int yychar = -1; /* current input token number */
+int yynerrs = 0; /* number of errors */
+short yyerrflag = 0; /* error recovery flag */
+
+yyparse() {
+
+ short yys[YYMAXDEPTH];
+ short yyj, yym;
+ register YYSTYPE *yypvt;
+ register short yystate, *yyps, yyn;
+ register YYSTYPE *yypv;
+ register short *yyxi;
+
+ yystate = 0;
+ yychar = -1;
+ yynerrs = 0;
+ yyerrflag = 0;
+ yyps= &yys[-1];
+ yypv= &yyv[-1];
+
+ yystack: /* put a state and value onto the stack */
+
+#ifdef YYDEBUG
+ if( yydebug ) printf( "state %d, char 0%o\n", yystate, yychar );
+#endif
+ if( ++yyps> &yys[YYMAXDEPTH] ) { yyerror( "yacc stack overflow" ); return(1); }
+ *yyps = yystate;
+ ++yypv;
+ *yypv = yyval;
+
+ yynewstate:
+
+ yyn = yypact[yystate];
+
+ if( yyn<= YYFLAG ) goto yydefault; /* simple state */
+
+ if( yychar<0 ) if( (yychar=yylex())<0 ) yychar=0;
+ if( (yyn += yychar)<0 || yyn >= YYLAST ) goto yydefault;
+
+ if( yychk[ yyn=yyact[ yyn ] ] == yychar ){ /* valid shift */
+ yychar = -1;
+ yyval = yylval;
+ yystate = yyn;
+ if( yyerrflag > 0 ) --yyerrflag;
+ goto yystack;
+ }
+
+ yydefault:
+ /* default state action */
+
+ if( (yyn=yydef[yystate]) == -2 ) {
+ if( yychar<0 ) if( (yychar=yylex())<0 ) yychar = 0;
+ /* look through exception table */
+
+ for( yyxi=yyexca; (*yyxi!= (-1)) || (yyxi[1]!=yystate) ; yyxi += 2 ) ; /* VOID */
+
+ while( *(yyxi+=2) >= 0 ){
+ if( *yyxi == yychar ) break;
+ }
+ if( (yyn = yyxi[1]) < 0 ) return(0); /* accept */
+ }
+
+ if( yyn == 0 ){ /* error */
+ /* error ... attempt to resume parsing */
+
+ switch( yyerrflag ){
+
+ case 0: /* brand new error */
+
+ yyerror( "syntax error" );
+ yyerrlab:
+ ++yynerrs;
+
+ case 1:
+ case 2: /* incompletely recovered error ... try again */
+
+ yyerrflag = 3;
+
+ /* find a state where "error" is a legal shift action */
+
+ while ( yyps >= yys ) {
+ yyn = yypact[*yyps] + YYERRCODE;
+ if( yyn>= 0 && yyn < YYLAST && yychk[yyact[yyn]] == YYERRCODE ){
+ yystate = yyact[yyn]; /* simulate a shift of "error" */
+ goto yystack;
+ }
+ yyn = yypact[*yyps];
+
+ /* the current yyps has no shift onn "error", pop stack */
+
+#ifdef YYDEBUG
+ if( yydebug ) printf( "error recovery pops state %d, uncovers %d\n", *yyps, yyps[-1] );
+#endif
+ --yyps;
+ --yypv;
+ }
+
+ /* there is no state on the stack with an error shift ... abort */
+
+ yyabort:
+ return(1);
+
+
+ case 3: /* no shift yet; clobber input char */
+
+#ifdef YYDEBUG
+ if( yydebug ) printf( "error recovery discards char %d\n", yychar );
+#endif
+
+ if( yychar == 0 ) goto yyabort; /* don't discard EOF, quit */
+ yychar = -1;
+ goto yynewstate; /* try again in the same state */
+
+ }
+
+ }
+
+ /* reduction by production yyn */
+
+#ifdef YYDEBUG
+ if( yydebug ) printf("reduce %d\n",yyn);
+#endif
+ yyps -= yyr2[yyn];
+ yypvt = yypv;
+ yypv -= yyr2[yyn];
+ yyval = yypv[1];
+ yym=yyn;
+ /* consult goto table to find next state */
+ yyn = yyr1[yyn];
+ yyj = yypgo[yyn] + *yyps + 1;
+ if( yyj>=YYLAST || yychk[ yystate = yyact[yyj] ] != -yyn ) yystate = yyact[yypgo[yyn]];
+ switch(yym){
+
+case 1:
+# line 25 "parser.y"
+{
+# ifdef DEBUG
+ if(debug) sect2dump();
+# endif
+ } break;
+case 3:
+# line 33 "parser.y"
+{
+ if(!funcflag)phead2();
+ funcflag = TRUE;
+ } break;
+case 4:
+# line 38 "parser.y"
+{
+# ifdef DEBUG
+ if(debug) {
+ sect1dump();
+ sect2dump();
+ }
+# endif
+ } break;
+case 7:
+# line 49 "parser.y"
+{ scopy(yypvt[-1],dp);
+ def[dptr] = dp;
+ dp += slength(yypvt[-1]) + 1;
+ scopy(yypvt[-0],dp);
+ subs[dptr++] = dp;
+ if(dptr >= DEFSIZE)
+ error("Too many definitions");
+ dp += slength(yypvt[-0]) + 1;
+ if(dp >= dchar+DEFCHAR)
+ error("Definitions too long");
+ subs[dptr]=def[dptr]=0; /* for lookup - require ending null */
+ } break;
+case 9:
+# line 64 "parser.y"
+{
+# ifdef DEBUG
+ if(sect == DEFSECTION && debug) sect1dump();
+# endif
+ sect++;
+ } break;
+case 10:
+# line 72 "parser.y"
+{ yyval = mn2(RNEWE,yypvt[-1],yypvt[-0]);
+ } break;
+case 11:
+# line 75 "parser.y"
+{ yyval = yypvt[-0];} break;
+case 12:
+# line 78 "parser.y"
+{
+ if(divflg == TRUE)
+ i = mn1(S1FINAL,casecount);
+ else i = mn1(FINAL,casecount);
+ yyval = mn2(RCAT,yypvt[-1],i);
+ divflg = FALSE;
+ casecount++;
+ } break;
+case 13:
+# line 87 "parser.y"
+{
+# ifdef DEBUG
+ if(debug) sect2dump();
+# endif
+ } break;
+case 14:
+# line 93 "parser.y"
+{ yyval = mn0(yypvt[-0]); } break;
+case 15:
+# line 95 "parser.y"
+{
+ p = yypvt[-0];
+ i = mn0(*p++);
+ while(*p)
+ i = mn2(RSTR,i,*p++);
+ yyval = i;
+ } break;
+case 16:
+# line 103 "parser.y"
+{ symbol['\n'] = 0;
+ if(psave == FALSE){
+ p = ccptr;
+ psave = ccptr;
+ for(i=1;i<'\n';i++){
+ symbol[i] = 1;
+ *ccptr++ = i;
+ }
+ for(i='\n'+1;i<NCH;i++){
+ symbol[i] = 1;
+ *ccptr++ = i;
+ }
+ *ccptr++ = 0;
+ if(ccptr > ccl+CCLSIZE)
+ error("Too many large character classes");
+ }
+ else
+ p = psave;
+ yyval = mn1(RCCL,p);
+ cclinter(1);
+ } break;
+case 17:
+# line 125 "parser.y"
+{ yyval = mn1(RCCL,yypvt[-0]); } break;
+case 18:
+# line 127 "parser.y"
+{ yyval = mn1(RNCCL,yypvt[-0]); } break;
+case 19:
+# line 129 "parser.y"
+{ yyval = mn1(STAR,yypvt[-1]); } break;
+case 20:
+# line 131 "parser.y"
+{ yyval = mn1(PLUS,yypvt[-1]); } break;
+case 21:
+# line 133 "parser.y"
+{ yyval = mn1(QUEST,yypvt[-1]); } break;
+case 22:
+# line 135 "parser.y"
+{ yyval = mn2(BAR,yypvt[-2],yypvt[-0]); } break;
+case 23:
+# line 137 "parser.y"
+{ yyval = mn2(RCAT,yypvt[-1],yypvt[-0]); } break;
+case 24:
+# line 139 "parser.y"
+{ if(!divflg){
+ j = mn1(S2FINAL,-casecount);
+ i = mn2(RCAT,yypvt[-2],j);
+ yyval = mn2(DIV,i,yypvt[-0]);
+ }
+ else {
+ yyval = mn2(RCAT,yypvt[-2],yypvt[-0]);
+ warning("Extra slash removed");
+ }
+ divflg = TRUE;
+ } break;
+case 25:
+# line 151 "parser.y"
+{ if(yypvt[-3] > yypvt[-1]){
+ i = yypvt[-3];
+ yypvt[-3] = yypvt[-1];
+ yypvt[-1] = i;
+ }
+ if(yypvt[-1] <= 0)
+ warning("Iteration range must be positive");
+ else {
+ j = yypvt[-4];
+ for(k = 2; k<=yypvt[-3];k++)
+ j = mn2(RCAT,j,dupl(yypvt[-4]));
+ for(i = yypvt[-3]+1; i<=yypvt[-1]; i++){
+ g = dupl(yypvt[-4]);
+ for(k=2;k<=i;k++)
+ g = mn2(RCAT,g,dupl(yypvt[-4]));
+ j = mn2(BAR,j,g);
+ }
+ yyval = j;
+ }
+ } break;
+case 26:
+# line 172 "parser.y"
+{
+ if(yypvt[-1] < 0)warning("Can't have negative iteration");
+ else if(yypvt[-1] == 0) yyval = mn0(RNULLS);
+ else {
+ j = yypvt[-2];
+ for(k=2;k<=yypvt[-1];k++)
+ j = mn2(RCAT,j,dupl(yypvt[-2]));
+ yyval = j;
+ }
+ } break;
+case 27:
+# line 183 "parser.y"
+{
+ /* from n to infinity */
+ if(yypvt[-2] < 0)warning("Can't have negative iteration");
+ else if(yypvt[-2] == 0) yyval = mn1(STAR,yypvt[-3]);
+ else if(yypvt[-2] == 1)yyval = mn1(PLUS,yypvt[-3]);
+ else { /* >= 2 iterations minimum */
+ j = yypvt[-3];
+ for(k=2;k<yypvt[-2];k++)
+ j = mn2(RCAT,j,dupl(yypvt[-3]));
+ k = mn1(PLUS,dupl(yypvt[-3]));
+ yyval = mn2(RCAT,j,k);
+ }
+ } break;
+case 28:
+# line 197 "parser.y"
+{ yyval = mn2(RSCON,yypvt[-0],yypvt[-1]); } break;
+case 29:
+# line 199 "parser.y"
+{ yyval = mn1(CARAT,yypvt[-0]); } break;
+case 30:
+# line 201 "parser.y"
+{ i = mn0('\n');
+ if(!divflg){
+ j = mn1(S2FINAL,-casecount);
+ k = mn2(RCAT,yypvt[-1],j);
+ yyval = mn2(DIV,k,i);
+ }
+ else yyval = mn2(RCAT,yypvt[-1],i);
+ divflg = TRUE;
+ } break;
+case 31:
+# line 211 "parser.y"
+{ yyval = yypvt[-1]; } break;
+case 32:
+# line 213 "parser.y"
+{ yyval = mn0(RNULLS); } break;
+ }
+ goto yystack; /* stack new state and value */
+
+ }
y1.o y2.o y3.o y4.o: dextern.h files.h
install:
install -s yacc $(DESTDIR)/usr/bin
- install -c yaccpar $(DESTDIR)/usr/lib
+ install -c -m 644 yaccpar $(DESTDIR)/usr/lib
clean :
-rm -f *.o yacc
#include "dextern.h"
/*#include "files.h" dextern.h*/
+#ifdef X_
+#include <string.h>
+#endif
+
#if defined(DOSCCS) && !defined(lint)
static char sccsid[] = "@(#)y1.c 4.1 (Berkeley) 2/11/83";
#endif
struct looksets *pfirst[NNONTERM+2]; /* vector of pointers to first sets for each nonterminal */
int pempty[NNONTERM+1]; /* vector of nonterminals nontrivially deriving e */
+#ifdef X_
+static char parser[MAXPATHLEN];
+#else
+static char parser[] = PARSER;
+#endif
+
int main(argc, argv) int argc; char *argv[]; {
+#ifdef X_
+ int i;
+
+ for (i = strlen(argv[0]); i > 0 && argv[0][i - 1] != '/'; --i)
+ ;
+ bcopy(argv[0], parser, i);
+ strcpy(parser + i, "../lib/yaccpar");
+#endif
setup(argc,argv); /* initialize and read productions */
tbitset = NWORDS(ntokens);
void others() { /* put out other arrays, copy the parsers */
register c, i, j;
- finput = fopen( PARSER, "r" );
- if( finput == NULL ) error( "cannot find parser %s", PARSER );
+ finput = fopen( parser, "r" );
+ if( finput == NULL ) error( "cannot find parser %s", parser );
warray( "yyr1", levprd, nprod );
public / 43bsd.git / commitdiff