1 .\" $OpenBSD: yacc.1,v 1.32 2016/07/27 20:53:47 tedu Exp $
3 .\" Copyright (c) 1989, 1990 The Regents of the University of California.
4 .\" All rights reserved.
6 .\" This code is derived from software contributed to Berkeley by
7 .\" Robert Paul Corbett.
9 .\" Redistribution and use in source and binary forms, with or without
10 .\" modification, are permitted provided that the following conditions
12 .\" 1. Redistributions of source code must retain the above copyright
13 .\" notice, this list of conditions and the following disclaimer.
14 .\" 2. Redistributions in binary form must reproduce the above copyright
15 .\" notice, this list of conditions and the following disclaimer in the
16 .\" documentation and/or other materials provided with the distribution.
17 .\" 3. Neither the name of the University nor the names of its contributors
18 .\" may be used to endorse or promote products derived from this software
19 .\" without specific prior written permission.
21 .\" THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
22 .\" ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23 .\" IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
24 .\" ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
25 .\" FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
26 .\" DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
27 .\" OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
28 .\" HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
29 .\" LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
30 .\" OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
33 .\" from: @(#)yacc.1 5.7 (Berkeley) 7/30/91
35 .Dd $Mdocdate: July 27 2016 $
40 .Nd an LALR(1) parser generator
44 .Op Fl b Ar file_prefix
45 .Op Fl o Ar output_file
46 .Op Fl p Ar symbol_prefix
50 reads the grammar specification in
52 and generates an LR(1) parser for it.
53 The parsers consist of a set of LALR(1)
54 parsing tables and a driver routine
55 written in the C programming language.
57 normally writes the parse tables and the driver routine to the file
60 The options are as follows:
62 .It Fl b Ar file_prefix
65 option changes the prefix prepended to the output file names to
68 The default prefix is the character
73 option causes the header file
79 option is not specified,
81 will insert #line directives in the generated code.
82 The #line directives let the C compiler relate errors in the
83 generated code to the user's original code.
88 will not insert the #line directives.
89 #line directives specified by the user will be retained.
90 .It Fl o Ar output_file
93 option specifies an explicit name for the parser's output file name instead
95 The names of the other output files are constructed from
97 as described under the
102 .It Fl p Ar symbol_prefix
105 option changes the prefix prepended to yacc-generated symbols to
106 the string denoted by
108 The default prefix is the string
115 to produce separate files for code and tables.
116 The code file is named
118 and the tables file is named
123 option changes the preprocessor directives generated by
125 so that debugging statements will be incorporated in the compiled code.
129 option causes a human-readable description of the generated parser to
130 be written to the file
134 The names of the tables generated by this version of
147 Two additional tables,
153 is defined and non-zero.
155 .Bl -tag -width /tmp/yacc.uXXXXXXXXXX -compact
160 .It Pa /tmp/yacc.aXXXXXXXXXX
161 .It Pa /tmp/yacc.tXXXXXXXXXX
162 .It Pa /tmp/yacc.uXXXXXXXXXX
167 If there are rules that are never reduced, the number of such rules is
168 written to the standard error.
169 If there are any LALR(1)
170 conflicts, the number of conflicts is also written
171 to the standard error.
181 .%T Efficient Computation of LALR(1) Look-Ahead Sets
187 utility is compliant with the
190 though its presence is optional.
194 are extensions to that specification.
197 was originally developed at AT&T by
198 .An Stephen C. Johnson .
202 was originally developed using PCC on a VAX with the
203 intent of being as compatible as possible with
206 Much is owed to the unflagging efforts of Keith Bostic.
207 His badgering kept me working on
209 long after I was ready to quit.
213 is based on the excellent algorithm for computing
214 LALR(1) lookaheads developed by
218 The algorithm is described in their almost impenetrable article in
221 Finally, much credit must go to those who pointed out deficiencies
223 Among the most prolific contributors were
242 utility was written by