Manual page for YACC(1)
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.
The output file,
must be compiled by the C compiler
to produce a program
This program must be loaded with the lexical analyzer program,
as well as
an error handling routine.
These routines must be supplied by the user;
is useful for creating lexical analyzers usable by
flag is given, the file
is prepared, which contains a description of the parsing tables
and a report on
conflicts generated by ambiguities in the grammar.
If the -d flag is used, the file
is generated with the
statements that associate the
yacc-assigned `token codes' with the user-declared `token names'.
This allows source files other than
to access the token codes.
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.
YACC - Yet Another Compiler Compiler
by S. C. Johnson.
The number of reduce-reduce and shift-reduce conflicts
is reported on the standard output;
a more detailed report is
found in the
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
Created by unroff & hp-tools.
© by Hans-Peter Bischof. All Rights Reserved (1997).
Last modified 21/April/97