.TH YACC 1 "18 January 1983"
yacc \- yet another compiler-compiler
converts a context-free grammar into a set of
tables for a simple automaton which executes an LR(1) parsing
The grammar may be ambiguous;
specified precedence rules are used to break ambiguities.
must be compiled by the C compiler
This program must be loaded with the lexical analyzer program,
an error handling routine.
These routines must be supplied by the user;
is useful for creating lexical analyzers usable by
is prepared, which contains a description of the parsing tables
conflicts generated by ambiguities in the grammar.
If the \-\fBd\fR flag is used, the file
statements that associate the
-assigned `token codes' with the user-declared `token names'.
This allows source files other than
to access the token codes.
.ta \w'yacc.tmp, yacc.acts 'u
y.tab.h defines for token names
yacc.tmp, yacc.acts temporary files
/usr/lib/yaccpar parser prototype for C programs
by A. V. Aho and S. C. Johnson,
Computing Surveys, June, 1974.
.I "YACC \- Yet Another Compiler Compiler"
The number of reduce-reduce and shift-reduce conflicts
is reported on the standard output;
a more detailed report is
Similarly, if some rules are not reachable from the
start symbol, this is also reported.
Because file names are fixed, at most one
process can be active in a given directory at