pascal/eyacc/ey.h

*19568Smckusick/*
*19568Smckusick * Copyright (c) 1979 Regents of the University of California.
*19568Smckusick * All rights reserved.  The Berkeley software License Agreement
*19568Smckusick * specifies the terms and conditions for redistribution.
*19568Smckusick *
*19568Smckusick *	@(#)ey.h	5.1 (Berkeley) 04/29/85
*19568Smckusick */
*19568Smckusick
*19568Smckusick#include <stdio.h>
*19568Smckusick/*  MANIFEST CONSTANT DEFINITIONS */
*19568Smckusick
*19568Smckusick# define NTBASE 010000
*19568Smckusick
*19568Smckusick  /* internal codes for error and accept actions */
*19568Smckusick
*19568Smckusick# define ERRCODE  8190
*19568Smckusick# define ACCEPTCODE 8191
*19568Smckusick
*19568Smckusick# define errfileno stderr      /* file number for erros and reduction message */
*19568Smckusick# define _tbitset 6  /* 16*_tbitset - 1 >= _nterms */
*19568Smckusick
*19568Smckusickextern int tbitset;  /* number of wds of lookahead vector */
*19568Smckusickextern int nolook;  /* flag to turn off lookahed computations */
*19568Smckusickstruct looksets { int lset[ _tbitset ]; } ;
*19568Smckusickstruct item { int *pitem; struct looksets *look; } ;
*19568Smckusick
*19568Smckusick  /* output actions */
*19568Smckusick
*19568Smckusick# define ERRACT 4096
*19568Smckusick# define SHIFTACT 8192
*19568Smckusick# define REDUCACT 12288
*19568Smckusick# define ACCEPTACT 16384
*19568Smckusick
*19568Smckusick# define _REGISTER register
*19568Smckusick
*19568Smckusickextern int nstate ;		/* number of states */
*19568Smckusickextern struct item *pstate[];	/* pointers to the descriptions of the states */
*19568Smckusickextern int apstate[];		/* index to actions in amem by state */
*19568Smckusickextern int actsiz;  	/* size of the action table array */
*19568Smckusickextern int tystate[];	/* contains type information about the states */
*19568Smckusick  /* 0 = simple state, completely generated
*19568Smckusick     1 = state awaiting generation
*19568Smckusick     2 = state with an empty production in closure
*19568Smckusick     */
*19568Smckusickextern int stsize ;	/* maximum number of states, at present */
*19568Smckusickextern int memsiz ;	/* maximum size for productions and states */
*19568Smckusickextern int mem0[] ; /* added production */
*19568Smckusickextern int *mem ;
*19568Smckusickextern int amem[];  /* action table storage */
*19568Smckusickextern int actsiz;  /* action table size */
*19568Smckusickextern int memact ;		/* next free action table position */
*19568Smckusickextern int nprod ;	/* number of productions */
*19568Smckusickextern int *prdptr[];	/* pointers to descriptions of productions */
*19568Smckusickextern int prdlim; /* the number of productions allowed */
*19568Smckusickextern int levprd[] ;	/* contains production levels to break conflicts */
*19568Smckusick  /* last two bits code associativity:
*19568Smckusick       0 = no definition
*19568Smckusick       1 = left associative
*19568Smckusick       2 = binary
*19568Smckusick       3 = right associative
*19568Smckusick     bit 04 is 1 if the production has an action
*19568Smckusick     the high 13 bits have the production level
*19568Smckusick     */
*19568Smckusickextern int nterms ;	/* number of terminals */
*19568Smckusickextern int nerrors;	/* number of errors */
*19568Smckusickextern int fatfl;  	/* if on, error is fatal */
*19568Smckusick  /*	the ascii representations of the terminals	*/
*19568Smckusickextern int extval;  /* start of output values */
*19568Smckusickextern struct sxxx1 {char *name; int value;} trmset[];
*19568Smckusickextern char cnames[];
*19568Smckusickextern int cnamsz;
*19568Smckusickextern char *cnamp;
*19568Smckusickextern int maxtmp ;	/* the size of the temp arrays */
*19568Smckusick /* temporary vectors, indexable by states, terms, or nterms */
*19568Smckusickextern int temp1[];
*19568Smckusickextern int temp2[];
*19568Smckusickextern int trmlev[];	/* vector with the precedence of the terminals */
*19568Smckusick  /* The levels are the same as for levprd, but bit 04 is always 0 */
*19568Smckusick  /* the ascii representations of the nonterminals */
*19568Smckusickextern struct sxxx2 { char *name; } nontrst[];
*19568Smckusickextern int indgo[];		/* index to the stored goto table */
*19568Smckusickextern int ***pres; /* vector of pointers to the productions yielding each nonterminal */
*19568Smckusickextern struct looksets **pfirst; /* vector of pointers to first sets for each nonterminal */
*19568Smckusickextern char *pempty; /* table of nonterminals nontrivially deriving e */
*19568Smckusickextern char stateflags[]; /* flags defining properties of a state (see below) */
*19568Smckusick#define GENLAMBDA   1	/* the state can nontrivially derive lambda */
*19568Smckusick#define SINGLE_NT   2	/* the state has a single nonterminal before its dot */
*19568Smckusick#define NEEDSREDUCE 4	/* the state needs a full reduce state generated */
*19568Smckusickextern struct looksets lastate[]; /* saved lookahead sets */
*19568Smckusickextern unsigned char lookstate[]; /* index mapping states to saved lookaheads */
*19568Smckusickextern int savedlook; /* number of saved lookahead sets used */
*19568Smckusickextern int maxlastate; /* maximum number of saved lookahead sets */
*19568Smckusickextern int nnonter ;	/* the number of nonterminals */
*19568Smckusickextern int lastred ;	/* the number of the last reduction of a state */
*19568Smckusickextern FILE *ftable;		/* y.tab.c file */
*19568Smckusickextern FILE *foutput;		/* y.output file */
*19568Smckusickextern FILE *cin;		/* current input file */
*19568Smckusickextern FILE *cout;		/* current output file */
*19568Smckusickextern int arrndx;
*19568Smckusickextern int zzcwset;
*19568Smckusickextern int zzpairs ;
*19568Smckusickextern int zzgoent ;
*19568Smckusickextern int zzgobest ;
*19568Smckusickextern int zzacent ;
*19568Smckusickextern int zzacsave ;
*19568Smckusickextern int zznsave ;
*19568Smckusickextern int zzclose ;
*19568Smckusickextern int zzrrconf ;
*19568Smckusickextern int zzsrconf ;
*19568Smckusickextern char *ctokn;
*19568Smckusickstruct {int **ppi;} ;
*19568Smckusickextern int ntlim ;	/* maximum number of nonterminals */
*19568Smckusickextern int tlim ;	/* maximum number of terminals */
*19568Smckusickextern int lineno; /* current line number */
*19568Smckusickextern int peekc; /* look-ahead character */
*19568Smckusickextern int tstates[];
*19568Smckusickextern int ntstates[];
*19568Smckusickextern int mstates[];
*19568Smckusick
*19568Smckusickextern struct looksets clset;
*19568Smckusickextern struct looksets lkst[];
*19568Smckusickextern int nlset;  /* next lookahead set index */
*19568Smckusickextern int lsetsz; /* number of lookahead sets */
*19568Smckusick
*19568Smckusickextern struct wset { int *pitem, flag, ws[ _tbitset ]; } wsets[];
*19568Smckusickextern int cwset;
*19568Smckusickextern int wssize;
*19568Smckusickextern int lambdarule; /* index to rule that derives lambda */
*19568Smckusick
*19568Smckusickextern int numbval;  /* the value of an input number */
*19568Smckusickextern int rflag;  /* ratfor flag */
*19568Smckusickextern int oflag;  /* optimization flag */
*19568Smckusickextern int ndefout;  /* number of defined symbols output */
*19568Smckusick
*19568Smckusickextern int machine;
*19568Smckusick
*19568Smckusick# define UNIX 1
*19568Smckusick# define GCOS 2
*19568Smckusick# define IBM 3
*19568Smckusick
*19568Smckusickstruct looksets *flset();