ossp-adm/autotools/bison.html
<HTML>
<HEAD>
<!-- Created by texi2html 1.56k from bison.texinfo on 9 November 2002 -->
<TITLE>Bison 1.75</TITLE>
</HEAD>
<BODY>
<H1>Bison</H1>
<H2>The YACC-compatible Parser Generator</H2>
<H2>14 October 2002, Bison Version 1.75</H2>
<ADDRESS>by Charles Donnelly and Richard Stallman</ADDRESS>
<P>
<P><HR><P>
<H1><A NAME="SEC1" HREF="bison_toc.html#TOC1">Introduction</A></H1>
<P>
<A NAME="IDX1"></A>
<P>
<EM>Bison</EM> is a general-purpose parser generator that converts a
grammar description for an LALR(1) context-free grammar into a C
program to parse that grammar. Once you are proficient with Bison,
you may use it to develop a wide range of language parsers, from those
used in simple desk calculators to complex programming languages.
<P>
Bison is upward compatible with Yacc: all properly-written Yacc grammars
ought to work with Bison with no change. Anyone familiar with Yacc
should be able to use Bison with little trouble. You need to be fluent in
C programming in order to use Bison or to understand this manual.
<P>
We begin with tutorial chapters that explain the basic concepts of using
Bison and show three explained examples, each building on the last. If you
don't know Bison or Yacc, start by reading these chapters. Reference
chapters follow which describe specific aspects of Bison in detail.
<P>
Bison was written primarily by Robert Corbett; Richard Stallman made it
Yacc-compatible. Wilfred Hansen of Carnegie Mellon University added
multi-character string literals and other features.
<P>
This edition corresponds to version 1.75 of Bison.
<H1><A NAME="SEC2" HREF="bison_toc.html#TOC2">Conditions for Using Bison</A></H1>
<P>
As of Bison version 1.24, we have changed the distribution terms for
<CODE>yyparse</CODE> to permit using Bison's output in nonfree programs when
Bison is generating C code for LALR(1) parsers. Formerly, these
parsers could be used only in programs that were free software.
<P>
The other GNU programming tools, such as the GNU C compiler, have never
had such a requirement. They could always be used for nonfree
software. The reason Bison was different was not due to a special
policy decision; it resulted from applying the usual General Public
License to all of the Bison source code.
<P>
The output of the Bison utility--the Bison parser file--contains a
verbatim copy of a sizable piece of Bison, which is the code for the
<CODE>yyparse</CODE> function. (The actions from your grammar are inserted
into this function at one point, but the rest of the function is not
changed.) When we applied the GPL terms to the code for <CODE>yyparse</CODE>,
the effect was to restrict the use of Bison output to free software.
<P>
We didn't change the terms because of sympathy for people who want to
make software proprietary. <STRONG>Software should be free.</STRONG> But we
concluded that limiting Bison's use to free software was doing little to
encourage people to make other software free. So we decided to make the
practical conditions for using Bison match the practical conditions for
using the other GNU tools.
<P>
This exception applies only when Bison is generating C code for a
LALR(1) parser; otherwise, the GPL terms operate as usual. You can
tell whether the exception applies to your <SAMP>`.c'</SAMP> output file by
inspecting it to see whether it says "As a special exception, when
this file is copied by Bison into a Bison output file, you may use
that output file without restriction."
<H1><A NAME="SEC3" HREF="bison_toc.html#TOC3">GNU GENERAL PUBLIC LICENSE</A></H1>
<P>
Version 2, June 1991
<PRE>
Copyright (C) 1989, 1991 Free Software Foundation, Inc.
59 Temple Place - Suite 330, Boston, MA 02111-1307, USA
Everyone is permitted to copy and distribute verbatim copies
of this license document, but changing it is not allowed.
</PRE>
<H2><A NAME="SEC4" HREF="bison_toc.html#TOC4">Preamble</A></H2>
<P>
The licenses for most software are designed to take away your
freedom to share and change it. By contrast, the GNU General Public
License is intended to guarantee your freedom to share and change free
software--to make sure the software is free for all its users. This
General Public License applies to most of the Free Software
Foundation's software and to any other program whose authors commit to
using it. (Some other Free Software Foundation software is covered by
the GNU Library General Public License instead.) You can apply it to
your programs, too.
<P>
When we speak of free software, we are referring to freedom, not
price. Our General Public Licenses are designed to make sure that you
have the freedom to distribute copies of free software (and charge for
this service if you wish), that you receive source code or can get it
if you want it, that you can change the software or use pieces of it
in new free programs; and that you know you can do these things.
<P>
To protect your rights, we need to make restrictions that forbid
anyone to deny you these rights or to ask you to surrender the rights.
These restrictions translate to certain responsibilities for you if you
distribute copies of the software, or if you modify it.
<P>
For example, if you distribute copies of such a program, whether
gratis or for a fee, you must give the recipients all the rights that
you have. You must make sure that they, too, receive or can get the
source code. And you must show them these terms so they know their
rights.
<P>
We protect your rights with two steps: (1) copyright the software, and
(2) offer you this license which gives you legal permission to copy,
distribute and/or modify the software.
<P>
Also, for each author's protection and ours, we want to make certain
that everyone understands that there is no warranty for this free
software. If the software is modified by someone else and passed on, we
want its recipients to know that what they have is not the original, so
that any problems introduced by others will not reflect on the original
authors' reputations.
<P>
Finally, any free program is threatened constantly by software
patents. We wish to avoid the danger that redistributors of a free
program will individually obtain patent licenses, in effect making the
program proprietary. To prevent this, we have made it clear that any
patent must be licensed for everyone's free use or not licensed at all.
<P>
The precise terms and conditions for copying, distribution and
modification follow.
<H2><A NAME="SEC5" HREF="bison_toc.html#TOC5">TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION</A></H2>
<OL>
<LI>
This License applies to any program or other work which contains
a notice placed by the copyright holder saying it may be distributed
under the terms of this General Public License. The "Program", below,
refers to any such program or work, and a "work based on the Program"
means either the Program or any derivative work under copyright law:
that is to say, a work containing the Program or a portion of it,
either verbatim or with modifications and/or translated into another
language. (Hereinafter, translation is included without limitation in
the term "modification".) Each licensee is addressed as "you".
Activities other than copying, distribution and modification are not
covered by this License; they are outside its scope. The act of
running the Program is not restricted, and the output from the Program
is covered only if its contents constitute a work based on the
Program (independent of having been made by running the Program).
Whether that is true depends on what the Program does.
<LI>
You may copy and distribute verbatim copies of the Program's
source code as you receive it, in any medium, provided that you
conspicuously and appropriately publish on each copy an appropriate
copyright notice and disclaimer of warranty; keep intact all the
notices that refer to this License and to the absence of any warranty;
and give any other recipients of the Program a copy of this License
along with the Program.
You may charge a fee for the physical act of transferring a copy, and
you may at your option offer warranty protection in exchange for a fee.
<LI>
You may modify your copy or copies of the Program or any portion
of it, thus forming a work based on the Program, and copy and
distribute such modifications or work under the terms of Section 1
above, provided that you also meet all of these conditions:
<OL>
<LI>
You must cause the modified files to carry prominent notices
stating that you changed the files and the date of any change.
<LI>
You must cause any work that you distribute or publish, that in
whole or in part contains or is derived from the Program or any
part thereof, to be licensed as a whole at no charge to all third
parties under the terms of this License.
<LI>
If the modified program normally reads commands interactively
when run, you must cause it, when started running for such
interactive use in the most ordinary way, to print or display an
announcement including an appropriate copyright notice and a
notice that there is no warranty (or else, saying that you provide
a warranty) and that users may redistribute the program under
these conditions, and telling the user how to view a copy of this
License. (Exception: if the Program itself is interactive but
does not normally print such an announcement, your work based on
the Program is not required to print an announcement.)
</OL>
These requirements apply to the modified work as a whole. If
identifiable sections of that work are not derived from the Program,
and can be reasonably considered independent and separate works in
themselves, then this License, and its terms, do not apply to those
sections when you distribute them as separate works. But when you
distribute the same sections as part of a whole which is a work based
on the Program, the distribution of the whole must be on the terms of
this License, whose permissions for other licensees extend to the
entire whole, and thus to each and every part regardless of who wrote it.
Thus, it is not the intent of this section to claim rights or contest
your rights to work written entirely by you; rather, the intent is to
exercise the right to control the distribution of derivative or
collective works based on the Program.
In addition, mere aggregation of another work not based on the Program
with the Program (or with a work based on the Program) on a volume of
a storage or distribution medium does not bring the other work under
the scope of this License.
<LI>
You may copy and distribute the Program (or a work based on it,
under Section 2) in object code or executable form under the terms of
Sections 1 and 2 above provided that you also do one of the following:
<OL>
<LI>
Accompany it with the complete corresponding machine-readable
source code, which must be distributed under the terms of Sections
1 and 2 above on a medium customarily used for software interchange; or,
<LI>
Accompany it with a written offer, valid for at least three
years, to give any third party, for a charge no more than your
cost of physically performing source distribution, a complete
machine-readable copy of the corresponding source code, to be
distributed under the terms of Sections 1 and 2 above on a medium
customarily used for software interchange; or,
<LI>
Accompany it with the information you received as to the offer
to distribute corresponding source code. (This alternative is
allowed only for noncommercial distribution and only if you
received the program in object code or executable form with such
an offer, in accord with Subsection b above.)
</OL>
The source code for a work means the preferred form of the work for
making modifications to it. For an executable work, complete source
code means all the source code for all modules it contains, plus any
associated interface definition files, plus the scripts used to
control compilation and installation of the executable. However, as a
special exception, the source code distributed need not include
anything that is normally distributed (in either source or binary
form) with the major components (compiler, kernel, and so on) of the
operating system on which the executable runs, unless that component
itself accompanies the executable.
If distribution of executable or object code is made by offering
access to copy from a designated place, then offering equivalent
access to copy the source code from the same place counts as
distribution of the source code, even though third parties are not
compelled to copy the source along with the object code.
<LI>
You may not copy, modify, sublicense, or distribute the Program
except as expressly provided under this License. Any attempt
otherwise to copy, modify, sublicense or distribute the Program is
void, and will automatically terminate your rights under this License.
However, parties who have received copies, or rights, from you under
this License will not have their licenses terminated so long as such
parties remain in full compliance.
<LI>
You are not required to accept this License, since you have not
signed it. However, nothing else grants you permission to modify or
distribute the Program or its derivative works. These actions are
prohibited by law if you do not accept this License. Therefore, by
modifying or distributing the Program (or any work based on the
Program), you indicate your acceptance of this License to do so, and
all its terms and conditions for copying, distributing or modifying
the Program or works based on it.
<LI>
Each time you redistribute the Program (or any work based on the
Program), the recipient automatically receives a license from the
original licensor to copy, distribute or modify the Program subject to
these terms and conditions. You may not impose any further
restrictions on the recipients' exercise of the rights granted herein.
You are not responsible for enforcing compliance by third parties to
this License.
<LI>
If, as a consequence of a court judgment or allegation of patent
infringement or for any other reason (not limited to patent issues),
conditions are imposed on you (whether by court order, agreement or
otherwise) that contradict the conditions of this License, they do not
excuse you from the conditions of this License. If you cannot
distribute so as to satisfy simultaneously your obligations under this
License and any other pertinent obligations, then as a consequence you
may not distribute the Program at all. For example, if a patent
license would not permit royalty-free redistribution of the Program by
all those who receive copies directly or indirectly through you, then
the only way you could satisfy both it and this License would be to
refrain entirely from distribution of the Program.
If any portion of this section is held invalid or unenforceable under
any particular circumstance, the balance of the section is intended to
apply and the section as a whole is intended to apply in other
circumstances.
It is not the purpose of this section to induce you to infringe any
patents or other property right claims or to contest validity of any
such claims; this section has the sole purpose of protecting the
integrity of the free software distribution system, which is
implemented by public license practices. Many people have made
generous contributions to the wide range of software distributed
through that system in reliance on consistent application of that
system; it is up to the author/donor to decide if he or she is willing
to distribute software through any other system and a licensee cannot
impose that choice.
This section is intended to make thoroughly clear what is believed to
be a consequence of the rest of this License.
<LI>
If the distribution and/or use of the Program is restricted in
certain countries either by patents or by copyrighted interfaces, the
original copyright holder who places the Program under this License
may add an explicit geographical distribution limitation excluding
those countries, so that distribution is permitted only in or among
countries not thus excluded. In such case, this License incorporates
the limitation as if written in the body of this License.
<LI>
The Free Software Foundation may publish revised and/or new versions
of the General Public License from time to time. Such new versions will
be similar in spirit to the present version, but may differ in detail to
address new problems or concerns.
Each version is given a distinguishing version number. If the Program
specifies a version number of this License which applies to it and "any
later version", you have the option of following the terms and conditions
either of that version or of any later version published by the Free
Software Foundation. If the Program does not specify a version number of
this License, you may choose any version ever published by the Free Software
Foundation.
<LI>
If you wish to incorporate parts of the Program into other free
programs whose distribution conditions are different, write to the author
to ask for permission. For software which is copyrighted by the Free
Software Foundation, write to the Free Software Foundation; we sometimes
make exceptions for this. Our decision will be guided by the two goals
of preserving the free status of all derivatives of our free software and
of promoting the sharing and reuse of software generally.
<P><STRONG>NO WARRANTY</STRONG>
<LI>
BECAUSE THE PROGRAM IS LICENSED FREE OF CHARGE, THERE IS NO WARRANTY
FOR THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE LAW. EXCEPT WHEN
OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES
PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED
OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. THE ENTIRE RISK AS
TO THE QUALITY AND PERFORMANCE OF THE PROGRAM IS WITH YOU. SHOULD THE
PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING,
REPAIR OR CORRECTION.
<LI>
IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY AND/OR
REDISTRIBUTE THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES,
INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING
OUT OF THE USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED
TO LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY
YOU OR THIRD PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER
PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE
POSSIBILITY OF SUCH DAMAGES.
</OL>
<H2>END OF TERMS AND CONDITIONS</H2>
<H2><A NAME="SEC6" HREF="bison_toc.html#TOC6">Appendix: How to Apply These Terms to Your New Programs</A></H2>
<P>
If you develop a new program, and you want it to be of the greatest
possible use to the public, the best way to achieve this is to make it
free software which everyone can redistribute and change under these terms.
<P>
To do so, attach the following notices to the program. It is safest
to attach them to the start of each source file to most effectively
convey the exclusion of warranty; and each file should have at least
the "copyright" line and a pointer to where the full notice is found.
<PRE>
<VAR>one line to give the program's name and a brief idea of what it does.</VAR>
Copyright (C) <VAR>yyyy</VAR> <VAR>name of author</VAR>
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
</PRE>
<P>
Also add information on how to contact you by electronic and paper mail.
<P>
If the program is interactive, make it output a short notice like this
when it starts in an interactive mode:
<PRE>
Gnomovision version 69, Copyright (C) 19<VAR>yy</VAR> <VAR>name of author</VAR>
Gnomovision comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
This is free software, and you are welcome to redistribute it
under certain conditions; type `show c' for details.
</PRE>
<P>
The hypothetical commands <SAMP>`show w'</SAMP> and <SAMP>`show c'</SAMP> should show
the appropriate parts of the General Public License. Of course, the
commands you use may be called something other than <SAMP>`show w'</SAMP> and
<SAMP>`show c'</SAMP>; they could even be mouse-clicks or menu items--whatever
suits your program.
<P>
You should also get your employer (if you work as a programmer) or your
school, if any, to sign a "copyright disclaimer" for the program, if
necessary. Here is a sample; alter the names:
<PRE>
Yoyodyne, Inc., hereby disclaims all copyright interest in the program
`Gnomovision' (which makes passes at compilers) written by James Hacker.
<VAR>signature of Ty Coon</VAR>, 1 April 1989
Ty Coon, President of Vice
</PRE>
<P>
This General Public License does not permit incorporating your program into
proprietary programs. If your program is a subroutine library, you may
consider it more useful to permit linking proprietary applications with the
library. If this is what you want to do, use the GNU Library General
Public License instead of this License.
<H1><A NAME="SEC7" HREF="bison_toc.html#TOC7">The Concepts of Bison</A></H1>
<P>
This chapter introduces many of the basic concepts without which the
details of Bison will not make sense. If you do not already know how to
use Bison or Yacc, we suggest you start by reading this chapter carefully.
<H2><A NAME="SEC8" HREF="bison_toc.html#TOC8">Languages and Context-Free Grammars</A></H2>
<P>
<A NAME="IDX2"></A>
<A NAME="IDX3"></A>
In order for Bison to parse a language, it must be described by a
<EM>context-free grammar</EM>. This means that you specify one or more
<EM>syntactic groupings</EM> and give rules for constructing them from their
parts. For example, in the C language, one kind of grouping is called an
`expression'. One rule for making an expression might be, "An expression
can be made of a minus sign and another expression". Another would be,
"An expression can be an integer". As you can see, rules are often
recursive, but there must be at least one rule which leads out of the
recursion.
<P>
<A NAME="IDX4"></A>
<A NAME="IDX5"></A>
The most common formal system for presenting such rules for humans to read
is <EM>Backus-Naur Form</EM> or "BNF", which was developed in order to
specify the language Algol 60. Any grammar expressed in BNF is a
context-free grammar. The input to Bison is essentially machine-readable
BNF.
<P>
<A NAME="IDX6"></A>
<A NAME="IDX7"></A>
There are various important subclasses of context-free grammar. Although it
can handle almost all context-free grammars, Bison is optimized for what
are called LALR(1) grammars.
In brief, in these grammars, it must be possible to
tell how to parse any portion of an input string with just a single
token of look-ahead. Strictly speaking, that is a description of an
LR(1) grammar, and LALR(1) involves additional restrictions that are
hard to explain simply; but it is rare in actual practice to find an
LR(1) grammar that fails to be LALR(1). See section <A HREF="bison.html#SEC89">Mysterious Reduce/Reduce Conflicts</A>, for more information on this.
<P>
<A NAME="IDX8"></A>
<A NAME="IDX9"></A>
<A NAME="IDX10"></A>
<A NAME="IDX11"></A>
Parsers for LALR(1) grammars are <EM>deterministic</EM>, meaning roughly that
the next grammar rule to apply at any point in the input is uniquely
determined by the preceding input and a fixed, finite portion (called
a <EM>look-ahead</EM>) of the remaining input.
A context-free grammar can be <EM>ambiguous</EM>, meaning that
there are multiple ways to apply the grammar rules to get the some inputs.
Even unambiguous grammars can be <EM>non-deterministic</EM>, meaning that no
fixed look-ahead always suffices to determine the next grammar rule to apply.
With the proper declarations, Bison is also able to parse these more general
context-free grammars, using a technique known as GLR parsing (for
Generalized LR). Bison's GLR parsers are able to handle any context-free
grammar for which the number of possible parses of any given string
is finite.
<P>
<A NAME="IDX12"></A>
<A NAME="IDX13"></A>
<A NAME="IDX14"></A>
<A NAME="IDX15"></A>
In the formal grammatical rules for a language, each kind of syntactic unit
or grouping is named by a <EM>symbol</EM>. Those which are built by grouping
smaller constructs according to grammatical rules are called
<EM>nonterminal symbols</EM>; those which can't be subdivided are called
<EM>terminal symbols</EM> or <EM>token types</EM>. We call a piece of input
corresponding to a single terminal symbol a <EM>token</EM>, and a piece
corresponding to a single nonterminal symbol a <EM>grouping</EM>.
<P>
We can use the C language as an example of what symbols, terminal and
nonterminal, mean. The tokens of C are identifiers, constants (numeric and
string), and the various keywords, arithmetic operators and punctuation
marks. So the terminal symbols of a grammar for C include `identifier',
`number', `string', plus one symbol for each keyword, operator or
punctuation mark: `if', `return', `const', `static', `int', `char',
`plus-sign', `open-brace', `close-brace', `comma' and many more. (These
tokens can be subdivided into characters, but that is a matter of
lexicography, not grammar.)
<P>
Here is a simple C function subdivided into tokens:
<P>
@ifnotinfo
<PRE>
int /* keyword `int' */
square (int x) /* identifier, open-paren, identifier, identifier, close-paren */
{ /* open-brace */
return x * x; /* keyword `return', identifier, asterisk, identifier, semicolon */
} /* close-brace */
</PRE>
<P>
The syntactic groupings of C include the expression, the statement, the
declaration, and the function definition. These are represented in the
grammar of C by nonterminal symbols `expression', `statement',
`declaration' and `function definition'. The full grammar uses dozens of
additional language constructs, each with its own nonterminal symbol, in
order to express the meanings of these four. The example above is a
function definition; it contains one declaration, and one statement. In
the statement, each <SAMP>`x'</SAMP> is an expression and so is <SAMP>`x * x'</SAMP>.
<P>
Each nonterminal symbol must have grammatical rules showing how it is made
out of simpler constructs. For example, one kind of C statement is the
<CODE>return</CODE> statement; this would be described with a grammar rule which
reads informally as follows:
<BLOCKQUOTE>
<P>
A `statement' can be made of a `return' keyword, an `expression' and a
`semicolon'.
</BLOCKQUOTE>
<P>
There would be many other rules for `statement', one for each kind of
statement in C.
<P>
<A NAME="IDX16"></A>
One nonterminal symbol must be distinguished as the special one which
defines a complete utterance in the language. It is called the <EM>start
symbol</EM>. In a compiler, this means a complete input program. In the C
language, the nonterminal symbol `sequence of definitions and declarations'
plays this role.
<P>
For example, <SAMP>`1 + 2'</SAMP> is a valid C expression--a valid part of a C
program--but it is not valid as an <EM>entire</EM> C program. In the
context-free grammar of C, this follows from the fact that `expression' is
not the start symbol.
<P>
The Bison parser reads a sequence of tokens as its input, and groups the
tokens using the grammar rules. If the input is valid, the end result is
that the entire token sequence reduces to a single grouping whose symbol is
the grammar's start symbol. If we use a grammar for C, the entire input
must be a `sequence of definitions and declarations'. If not, the parser
reports a syntax error.
<H2><A NAME="SEC9" HREF="bison_toc.html#TOC9">From Formal Rules to Bison Input</A></H2>
<P>
<A NAME="IDX17"></A>
<A NAME="IDX18"></A>
<A NAME="IDX19"></A>
<P>
A formal grammar is a mathematical construct. To define the language
for Bison, you must write a file expressing the grammar in Bison syntax:
a <EM>Bison grammar</EM> file. See section <A HREF="bison.html#SEC40">Bison Grammar Files</A>.
<P>
A nonterminal symbol in the formal grammar is represented in Bison input
as an identifier, like an identifier in C. By convention, it should be
in lower case, such as <CODE>expr</CODE>, <CODE>stmt</CODE> or <CODE>declaration</CODE>.
<P>
The Bison representation for a terminal symbol is also called a <EM>token
type</EM>. Token types as well can be represented as C-like identifiers. By
convention, these identifiers should be upper case to distinguish them from
nonterminals: for example, <CODE>INTEGER</CODE>, <CODE>IDENTIFIER</CODE>, <CODE>IF</CODE> or
<CODE>RETURN</CODE>. A terminal symbol that stands for a particular keyword in
the language should be named after that keyword converted to upper case.
The terminal symbol <CODE>error</CODE> is reserved for error recovery.
See section <A HREF="bison.html#SEC46">Symbols, Terminal and Nonterminal</A>.
<P>
A terminal symbol can also be represented as a character literal, just like
a C character constant. You should do this whenever a token is just a
single character (parenthesis, plus-sign, etc.): use that same character in
a literal as the terminal symbol for that token.
<P>
A third way to represent a terminal symbol is with a C string constant
containing several characters. See section <A HREF="bison.html#SEC46">Symbols, Terminal and Nonterminal</A>, for more information.
<P>
The grammar rules also have an expression in Bison syntax. For example,
here is the Bison rule for a C <CODE>return</CODE> statement. The semicolon in
quotes is a literal character token, representing part of the C syntax for
the statement; the naked semicolon, and the colon, are Bison punctuation
used in every rule.
<PRE>
stmt: RETURN expr ';'
;
</PRE>
<P>
See section <A HREF="bison.html#SEC47">Syntax of Grammar Rules</A>.
<H2><A NAME="SEC10" HREF="bison_toc.html#TOC10">Semantic Values</A></H2>
<P>
<A NAME="IDX20"></A>
<A NAME="IDX21"></A>
<P>
A formal grammar selects tokens only by their classifications: for example,
if a rule mentions the terminal symbol `integer constant', it means that
<EM>any</EM> integer constant is grammatically valid in that position. The
precise value of the constant is irrelevant to how to parse the input: if
<SAMP>`x+4'</SAMP> is grammatical then <SAMP>`x+1'</SAMP> or <SAMP>`x+3989'</SAMP> is equally
grammatical.
<P>
But the precise value is very important for what the input means once it is
parsed. A compiler is useless if it fails to distinguish between 4, 1 and
3989 as constants in the program! Therefore, each token in a Bison grammar
has both a token type and a <EM>semantic value</EM>. See section <A HREF="bison.html#SEC49">Defining Language Semantics</A>,
for details.
<P>
The token type is a terminal symbol defined in the grammar, such as
<CODE>INTEGER</CODE>, <CODE>IDENTIFIER</CODE> or <CODE>','</CODE>. It tells everything
you need to know to decide where the token may validly appear and how to
group it with other tokens. The grammar rules know nothing about tokens
except their types.
<P>
The semantic value has all the rest of the information about the
meaning of the token, such as the value of an integer, or the name of an
identifier. (A token such as <CODE>','</CODE> which is just punctuation doesn't
need to have any semantic value.)
<P>
For example, an input token might be classified as token type
<CODE>INTEGER</CODE> and have the semantic value 4. Another input token might
have the same token type <CODE>INTEGER</CODE> but value 3989. When a grammar
rule says that <CODE>INTEGER</CODE> is allowed, either of these tokens is
acceptable because each is an <CODE>INTEGER</CODE>. When the parser accepts the
token, it keeps track of the token's semantic value.
<P>
Each grouping can also have a semantic value as well as its nonterminal
symbol. For example, in a calculator, an expression typically has a
semantic value that is a number. In a compiler for a programming
language, an expression typically has a semantic value that is a tree
structure describing the meaning of the expression.
<H2><A NAME="SEC11" HREF="bison_toc.html#TOC11">Semantic Actions</A></H2>
<P>
<A NAME="IDX22"></A>
<A NAME="IDX23"></A>
<P>
In order to be useful, a program must do more than parse input; it must
also produce some output based on the input. In a Bison grammar, a grammar
rule can have an <EM>action</EM> made up of C statements. Each time the
parser recognizes a match for that rule, the action is executed.
See section <A HREF="bison.html#SEC52">Actions</A>.
<P>
Most of the time, the purpose of an action is to compute the semantic value
of the whole construct from the semantic values of its parts. For example,
suppose we have a rule which says an expression can be the sum of two
expressions. When the parser recognizes such a sum, each of the
subexpressions has a semantic value which describes how it was built up.
The action for this rule should create a similar sort of value for the
newly recognized larger expression.
<P>
For example, here is a rule that says an expression can be the sum of
two subexpressions:
<PRE>
expr: expr '+' expr { $$ = $1 + $3; }
;
</PRE>
<P>
The action says how to produce the semantic value of the sum expression
from the values of the two subexpressions.
<H2><A NAME="SEC12" HREF="bison_toc.html#TOC12">Writing GLR Parsers</A></H2>
<P>
<A NAME="IDX24"></A>
<A NAME="IDX25"></A>
<A NAME="IDX26"></A>
<A NAME="IDX27"></A>
<A NAME="IDX28"></A>
<P>
In some grammars, there will be cases where Bison's standard LALR(1)
parsing algorithm cannot decide whether to apply a certain grammar rule
at a given point. That is, it may not be able to decide (on the basis
of the input read so far) which of two possible reductions (applications
of a grammar rule) applies, or whether to apply a reduction or read more
of the input and apply a reduction later in the input. These are known
respectively as <EM>reduce/reduce</EM> conflicts (see section <A HREF="bison.html#SEC88">Reduce/Reduce Conflicts</A>),
and <EM>shift/reduce</EM> conflicts (see section <A HREF="bison.html#SEC80">Shift/Reduce Conflicts</A>).
<P>
To use a grammar that is not easily modified to be LALR(1), a more
general parsing algorithm is sometimes necessary. If you include
<CODE>%glr-parser</CODE> among the Bison declarations in your file
(see section <A HREF="bison.html#SEC41">Outline of a Bison Grammar</A>), the result will be a Generalized LR (GLR)
parser. These parsers handle Bison grammars that contain no unresolved
conflicts (i.e., after applying precedence declarations) identically to
LALR(1) parsers. However, when faced with unresolved shift/reduce and
reduce/reduce conflicts, GLR parsers use the simple expedient of doing
both, effectively cloning the parser to follow both possibilities. Each
of the resulting parsers can again split, so that at any given time,
there can be any number of possible parses being explored. The parsers
proceed in lockstep; that is, all of them consume (shift) a given input
symbol before any of them proceed to the next. Each of the cloned
parsers eventually meets one of two possible fates: either it runs into
a parsing error, in which case it simply vanishes, or it merges with
another parser, because the two of them have reduced the input to an
identical set of symbols.
<P>
During the time that there are multiple parsers, semantic actions are
recorded, but not performed. When a parser disappears, its recorded
semantic actions disappear as well, and are never performed. When a
reduction makes two parsers identical, causing them to merge, Bison
records both sets of semantic actions. Whenever the last two parsers
merge, reverting to the single-parser case, Bison resolves all the
outstanding actions either by precedences given to the grammar rules
involved, or by performing both actions, and then calling a designated
user-defined function on the resulting values to produce an arbitrary
merged result.
<P>
Let's consider an example, vastly simplified from C++.
<PRE>
%{
#define YYSTYPE const char*
%}
%token TYPENAME ID
%right '='
%left '+'
%glr-parser
%%
prog :
| prog stmt { printf ("\n"); }
;
stmt : expr ';' %dprec 1
| decl %dprec 2
;
expr : ID { printf ("%s ", $$); }
| TYPENAME '(' expr ')'
{ printf ("%s <cast> ", $1); }
| expr '+' expr { printf ("+ "); }
| expr '=' expr { printf ("= "); }
;
decl : TYPENAME declarator ';'
{ printf ("%s <declare> ", $1); }
| TYPENAME declarator '=' expr ';'
{ printf ("%s <init-declare> ", $1); }
;
declarator : ID { printf ("\"%s\" ", $1); }
| '(' declarator ')'
;
</PRE>
<P>
This models a problematic part of the C++ grammar--the ambiguity between
certain declarations and statements. For example,
<PRE>
T (x) = y+z;
</PRE>
<P>
parses as either an <CODE>expr</CODE> or a <CODE>stmt</CODE>
(assuming that <SAMP>`T'</SAMP> is recognized as a TYPENAME and <SAMP>`x'</SAMP> as an ID).
Bison detects this as a reduce/reduce conflict between the rules
<CODE>expr : ID</CODE> and <CODE>declarator : ID</CODE>, which it cannot resolve at the
time it encounters <CODE>x</CODE> in the example above. The two <CODE>%dprec</CODE>
declarations, however, give precedence to interpreting the example as a
<CODE>decl</CODE>, which implies that <CODE>x</CODE> is a declarator.
The parser therefore prints
<PRE>
"x" y z + T <init-declare>
</PRE>
<P>
Consider a different input string for this parser:
<PRE>
T (x) + y;
</PRE>
<P>
Here, there is no ambiguity (this cannot be parsed as a declaration).
However, at the time the Bison parser encounters <CODE>x</CODE>, it does not
have enough information to resolve the reduce/reduce conflict (again,
between <CODE>x</CODE> as an <CODE>expr</CODE> or a <CODE>declarator</CODE>). In this
case, no precedence declaration is used. Instead, the parser splits
into two, one assuming that <CODE>x</CODE> is an <CODE>expr</CODE>, and the other
assuming <CODE>x</CODE> is a <CODE>declarator</CODE>. The second of these parsers
then vanishes when it sees <CODE>+</CODE>, and the parser prints
<PRE>
x T <cast> y +
</PRE>
<P>
Suppose that instead of resolving the ambiguity, you wanted to see all
the possibilities. For this purpose, we must <EM>merge</EM> the semantic
actions of the two possible parsers, rather than choosing one over the
other. To do so, you could change the declaration of <CODE>stmt</CODE> as
follows:
<PRE>
stmt : expr ';' %merge <stmtMerge>
| decl %merge <stmtMerge>
;
</PRE>
<P>
<P>
and define the <CODE>stmtMerge</CODE> function as:
<PRE>
static YYSTYPE stmtMerge (YYSTYPE x0, YYSTYPE x1)
{
printf ("<OR> ");
return "";
}
</PRE>
<P>
with an accompanying forward declaration
in the C declarations at the beginning of the file:
<PRE>
%{
#define YYSTYPE const char*
static YYSTYPE stmtMerge (YYSTYPE x0, YYSTYPE x1);
%}
</PRE>
<P>
With these declarations, the resulting parser will parse the first example
as both an <CODE>expr</CODE> and a <CODE>decl</CODE>, and print
<PRE>
"x" y z + T <init-declare> x T <cast> y z + = <OR>
</PRE>
<H2><A NAME="SEC13" HREF="bison_toc.html#TOC13">Locations</A></H2>
<P>
<A NAME="IDX29"></A>
<A NAME="IDX30"></A>
<A NAME="IDX31"></A>
<P>
Many applications, like interpreters or compilers, have to produce verbose
and useful error messages. To achieve this, one must be able to keep track of
the <EM>textual position</EM>, or <EM>location</EM>, of each syntactic construct.
Bison provides a mechanism for handling these locations.
<P>
Each token has a semantic value. In a similar fashion, each token has an
associated location, but the type of locations is the same for all tokens and
groupings. Moreover, the output parser is equipped with a default data
structure for storing locations (see section <A HREF="bison.html#SEC55">Tracking Locations</A>, for more details).
<P>
Like semantic values, locations can be reached in actions using a dedicated
set of constructs. In the example above, the location of the whole grouping
is <CODE>@$</CODE>, while the locations of the subexpressions are <CODE>@1</CODE> and
<CODE>@3</CODE>.
<P>
When a rule is matched, a default action is used to compute the semantic value
of its left hand side (see section <A HREF="bison.html#SEC52">Actions</A>). In the same way, another default
action is used for locations. However, the action for locations is general
enough for most cases, meaning there is usually no need to describe for each
rule how <CODE>@$</CODE> should be formed. When building a new location for a given
grouping, the default behavior of the output parser is to take the beginning
of the first symbol, and the end of the last symbol.
<H2><A NAME="SEC14" HREF="bison_toc.html#TOC14">Bison Output: the Parser File</A></H2>
<P>
<A NAME="IDX32"></A>
<A NAME="IDX33"></A>
<A NAME="IDX34"></A>
<A NAME="IDX35"></A>
<P>
When you run Bison, you give it a Bison grammar file as input. The output
is a C source file that parses the language described by the grammar.
This file is called a <EM>Bison parser</EM>. Keep in mind that the Bison
utility and the Bison parser are two distinct programs: the Bison utility
is a program whose output is the Bison parser that becomes part of your
program.
<P>
The job of the Bison parser is to group tokens into groupings according to
the grammar rules--for example, to build identifiers and operators into
expressions. As it does this, it runs the actions for the grammar rules it
uses.
<P>
The tokens come from a function called the <EM>lexical analyzer</EM> that
you must supply in some fashion (such as by writing it in C). The Bison
parser calls the lexical analyzer each time it wants a new token. It
doesn't know what is "inside" the tokens (though their semantic values
may reflect this). Typically the lexical analyzer makes the tokens by
parsing characters of text, but Bison does not depend on this.
See section <A HREF="bison.html#SEC71">The Lexical Analyzer Function <CODE>yylex</CODE></A>.
<P>
The Bison parser file is C code which defines a function named
<CODE>yyparse</CODE> which implements that grammar. This function does not make
a complete C program: you must supply some additional functions. One is
the lexical analyzer. Another is an error-reporting function which the
parser calls to report an error. In addition, a complete C program must
start with a function called <CODE>main</CODE>; you have to provide this, and
arrange for it to call <CODE>yyparse</CODE> or the parser will never run.
See section <A HREF="bison.html#SEC69">Parser C-Language Interface</A>.
<P>
Aside from the token type names and the symbols in the actions you
write, all symbols defined in the Bison parser file itself
begin with <SAMP>`yy'</SAMP> or <SAMP>`YY'</SAMP>. This includes interface functions
such as the lexical analyzer function <CODE>yylex</CODE>, the error reporting
function <CODE>yyerror</CODE> and the parser function <CODE>yyparse</CODE> itself.
This also includes numerous identifiers used for internal purposes.
Therefore, you should avoid using C identifiers starting with <SAMP>`yy'</SAMP>
or <SAMP>`YY'</SAMP> in the Bison grammar file except for the ones defined in
this manual.
<P>
In some cases the Bison parser file includes system headers, and in
those cases your code should respect the identifiers reserved by those
headers. On some non-GNU hosts, <CODE><alloca.h></CODE>,
<CODE><stddef.h></CODE>, and <CODE><stdlib.h></CODE> are included as needed to
declare memory allocators and related types. Other system headers may
be included if you define <CODE>YYDEBUG</CODE> to a nonzero value
(see section <A HREF="bison.html#SEC99">Tracing Your Parser</A>).
<H2><A NAME="SEC15" HREF="bison_toc.html#TOC15">Stages in Using Bison</A></H2>
<P>
<A NAME="IDX36"></A>
<A NAME="IDX37"></A>
<P>
The actual language-design process using Bison, from grammar specification
to a working compiler or interpreter, has these parts:
<OL>
<LI>
Formally specify the grammar in a form recognized by Bison
(see section <A HREF="bison.html#SEC40">Bison Grammar Files</A>). For each grammatical rule
in the language, describe the action that is to be taken when an
instance of that rule is recognized. The action is described by a
sequence of C statements.
<LI>
Write a lexical analyzer to process input and pass tokens to the parser.
The lexical analyzer may be written by hand in C (see section <A HREF="bison.html#SEC71">The Lexical Analyzer Function <CODE>yylex</CODE></A>). It could also be produced
using Lex, but the use of Lex is not discussed in this manual.
<LI>
Write a controlling function that calls the Bison-produced parser.
<LI>
Write error-reporting routines.
</OL>
<P>
To turn this source code as written into a runnable program, you
must follow these steps:
<OL>
<LI>
Run Bison on the grammar to produce the parser.
<LI>
Compile the code output by Bison, as well as any other source files.
<LI>
Link the object files to produce the finished product.
</OL>
<H2><A NAME="SEC16" HREF="bison_toc.html#TOC16">The Overall Layout of a Bison Grammar</A></H2>
<P>
<A NAME="IDX38"></A>
<A NAME="IDX39"></A>
<A NAME="IDX40"></A>
<A NAME="IDX41"></A>
<P>
The input file for the Bison utility is a <EM>Bison grammar file</EM>. The
general form of a Bison grammar file is as follows:
<PRE>
%{
<VAR>Prologue</VAR>
%}
<VAR>Bison declarations</VAR>
%%
<VAR>Grammar rules</VAR>
%%
<VAR>Epilogue</VAR>
</PRE>
<P>
The <SAMP>`%%'</SAMP>, <SAMP>`%{'</SAMP> and <SAMP>`%}'</SAMP> are punctuation that appears
in every Bison grammar file to separate the sections.
<P>
The prologue may define types and variables used in the actions. You can
also use preprocessor commands to define macros used there, and use
<CODE>#include</CODE> to include header files that do any of these things.
<P>
The Bison declarations declare the names of the terminal and nonterminal
symbols, and may also describe operator precedence and the data types of
semantic values of various symbols.
<P>
The grammar rules define how to construct each nonterminal symbol from its
parts.
<P>
The epilogue can contain any code you want to use. Often the definition of
the lexical analyzer <CODE>yylex</CODE> goes here, plus subroutines called by the
actions in the grammar rules. In a simple program, all the rest of the
program can go here.
<H1><A NAME="SEC17" HREF="bison_toc.html#TOC17">Examples</A></H1>
<P>
<A NAME="IDX42"></A>
<A NAME="IDX43"></A>
<P>
Now we show and explain three sample programs written using Bison: a
reverse polish notation calculator, an algebraic (infix) notation
calculator, and a multi-function calculator. All three have been tested
under BSD Unix 4.3; each produces a usable, though limited, interactive
desk-top calculator.
<P>
These examples are simple, but Bison grammars for real programming
languages are written the same way.
<H2><A NAME="SEC18" HREF="bison_toc.html#TOC18">Reverse Polish Notation Calculator</A></H2>
<P>
<A NAME="IDX44"></A>
<A NAME="IDX45"></A>
<A NAME="IDX46"></A>
<A NAME="IDX47"></A>
<P>
The first example is that of a simple double-precision <EM>reverse polish
notation</EM> calculator (a calculator using postfix operators). This example
provides a good starting point, since operator precedence is not an issue.
The second example will illustrate how operator precedence is handled.
<P>
The source code for this calculator is named <TT>`rpcalc.y'</TT>. The
<SAMP>`.y'</SAMP> extension is a convention used for Bison input files.
<H3><A NAME="SEC19" HREF="bison_toc.html#TOC19">Declarations for <CODE>rpcalc</CODE></A></H3>
<P>
Here are the C and Bison declarations for the reverse polish notation
calculator. As in C, comments are placed between <SAMP>`/*...*/'</SAMP>.
<PRE>
/* Reverse polish notation calculator. */
%{
#define YYSTYPE double
#include <math.h>
%}
%token NUM
%% /* Grammar rules and actions follow. */
</PRE>
<P>
The declarations section (see section <A HREF="bison.html#SEC42">The prologue</A>) contains two
preprocessor directives.
<P>
The <CODE>#define</CODE> directive defines the macro <CODE>YYSTYPE</CODE>, thus
specifying the C data type for semantic values of both tokens and
groupings (see section <A HREF="bison.html#SEC50">Data Types of Semantic Values</A>). The
Bison parser will use whatever type <CODE>YYSTYPE</CODE> is defined as; if you
don't define it, <CODE>int</CODE> is the default. Because we specify
<CODE>double</CODE>, each token and each expression has an associated value,
which is a floating point number.
<P>
The <CODE>#include</CODE> directive is used to declare the exponentiation
function <CODE>pow</CODE>.
<P>
The second section, Bison declarations, provides information to Bison
about the token types (see section <A HREF="bison.html#SEC43">The Bison Declarations Section</A>). Each terminal symbol that is not a
single-character literal must be declared here. (Single-character
literals normally don't need to be declared.) In this example, all the
arithmetic operators are designated by single-character literals, so the
only terminal symbol that needs to be declared is <CODE>NUM</CODE>, the token
type for numeric constants.
<H3><A NAME="SEC20" HREF="bison_toc.html#TOC20">Grammar Rules for <CODE>rpcalc</CODE></A></H3>
<P>
Here are the grammar rules for the reverse polish notation calculator.
<PRE>
input: /* empty */
| input line
;
line: '\n'
| exp '\n' { printf ("\t%.10g\n", $1); }
;
exp: NUM { $$ = $1; }
| exp exp '+' { $$ = $1 + $2; }
| exp exp '-' { $$ = $1 - $2; }
| exp exp '*' { $$ = $1 * $2; }
| exp exp '/' { $$ = $1 / $2; }
/* Exponentiation */
| exp exp '^' { $$ = pow ($1, $2); }
/* Unary minus */
| exp 'n' { $$ = -$1; }
;
%%
</PRE>
<P>
The groupings of the rpcalc "language" defined here are the expression
(given the name <CODE>exp</CODE>), the line of input (<CODE>line</CODE>), and the
complete input transcript (<CODE>input</CODE>). Each of these nonterminal
symbols has several alternate rules, joined by the <SAMP>`|'</SAMP> punctuator
which is read as "or". The following sections explain what these rules
mean.
<P>
The semantics of the language is determined by the actions taken when a
grouping is recognized. The actions are the C code that appears inside
braces. See section <A HREF="bison.html#SEC52">Actions</A>.
<P>
You must specify these actions in C, but Bison provides the means for
passing semantic values between the rules. In each action, the
pseudo-variable <CODE>$$</CODE> stands for the semantic value for the grouping
that the rule is going to construct. Assigning a value to <CODE>$$</CODE> is the
main job of most actions. The semantic values of the components of the
rule are referred to as <CODE>$1</CODE>, <CODE>$2</CODE>, and so on.
<H4><A NAME="SEC21" HREF="bison_toc.html#TOC21">Explanation of <CODE>input</CODE></A></H4>
<P>
Consider the definition of <CODE>input</CODE>:
<PRE>
input: /* empty */
| input line
;
</PRE>
<P>
This definition reads as follows: "A complete input is either an empty
string, or a complete input followed by an input line". Notice that
"complete input" is defined in terms of itself. This definition is said
to be <EM>left recursive</EM> since <CODE>input</CODE> appears always as the
leftmost symbol in the sequence. See section <A HREF="bison.html#SEC48">Recursive Rules</A>.
<P>
The first alternative is empty because there are no symbols between the
colon and the first <SAMP>`|'</SAMP>; this means that <CODE>input</CODE> can match an
empty string of input (no tokens). We write the rules this way because it
is legitimate to type <KBD>Ctrl-d</KBD> right after you start the calculator.
It's conventional to put an empty alternative first and write the comment
<SAMP>`/* empty */'</SAMP> in it.
<P>
The second alternate rule (<CODE>input line</CODE>) handles all nontrivial input.
It means, "After reading any number of lines, read one more line if
possible." The left recursion makes this rule into a loop. Since the
first alternative matches empty input, the loop can be executed zero or
more times.
<P>
The parser function <CODE>yyparse</CODE> continues to process input until a
grammatical error is seen or the lexical analyzer says there are no more
input tokens; we will arrange for the latter to happen at end-of-input.
<H4><A NAME="SEC22" HREF="bison_toc.html#TOC22">Explanation of <CODE>line</CODE></A></H4>
<P>
Now consider the definition of <CODE>line</CODE>:
<PRE>
line: '\n'
| exp '\n' { printf ("\t%.10g\n", $1); }
;
</PRE>
<P>
The first alternative is a token which is a newline character; this means
that rpcalc accepts a blank line (and ignores it, since there is no
action). The second alternative is an expression followed by a newline.
This is the alternative that makes rpcalc useful. The semantic value of
the <CODE>exp</CODE> grouping is the value of <CODE>$1</CODE> because the <CODE>exp</CODE> in
question is the first symbol in the alternative. The action prints this
value, which is the result of the computation the user asked for.
<P>
This action is unusual because it does not assign a value to <CODE>$$</CODE>. As
a consequence, the semantic value associated with the <CODE>line</CODE> is
uninitialized (its value will be unpredictable). This would be a bug if
that value were ever used, but we don't use it: once rpcalc has printed the
value of the user's input line, that value is no longer needed.
<H4><A NAME="SEC23" HREF="bison_toc.html#TOC23">Explanation of <CODE>expr</CODE></A></H4>
<P>
The <CODE>exp</CODE> grouping has several rules, one for each kind of expression.
The first rule handles the simplest expressions: those that are just numbers.
The second handles an addition-expression, which looks like two expressions
followed by a plus-sign. The third handles subtraction, and so on.
<PRE>
exp: NUM
| exp exp '+' { $$ = $1 + $2; }
| exp exp '-' { $$ = $1 - $2; }
...
;
</PRE>
<P>
We have used <SAMP>`|'</SAMP> to join all the rules for <CODE>exp</CODE>, but we could
equally well have written them separately:
<PRE>
exp: NUM ;
exp: exp exp '+' { $$ = $1 + $2; } ;
exp: exp exp '-' { $$ = $1 - $2; } ;
...
</PRE>
<P>
Most of the rules have actions that compute the value of the expression in
terms of the value of its parts. For example, in the rule for addition,
<CODE>$1</CODE> refers to the first component <CODE>exp</CODE> and <CODE>$2</CODE> refers to
the second one. The third component, <CODE>'+'</CODE>, has no meaningful
associated semantic value, but if it had one you could refer to it as
<CODE>$3</CODE>. When <CODE>yyparse</CODE> recognizes a sum expression using this
rule, the sum of the two subexpressions' values is produced as the value of
the entire expression. See section <A HREF="bison.html#SEC52">Actions</A>.
<P>
You don't have to give an action for every rule. When a rule has no
action, Bison by default copies the value of <CODE>$1</CODE> into <CODE>$$</CODE>.
This is what happens in the first rule (the one that uses <CODE>NUM</CODE>).
<P>
The formatting shown here is the recommended convention, but Bison does
not require it. You can add or change white space as much as you wish.
For example, this:
<PRE>
exp : NUM | exp exp '+' {$$ = $1 + $2; } | ...
</PRE>
<P>
means the same thing as this:
<PRE>
exp: NUM
| exp exp '+' { $$ = $1 + $2; }
| ...
</PRE>
<P>
The latter, however, is much more readable.
<H3><A NAME="SEC24" HREF="bison_toc.html#TOC24">The <CODE>rpcalc</CODE> Lexical Analyzer</A></H3>
<P>
<A NAME="IDX48"></A>
<A NAME="IDX49"></A>
<P>
The lexical analyzer's job is low-level parsing: converting characters
or sequences of characters into tokens. The Bison parser gets its
tokens by calling the lexical analyzer. See section <A HREF="bison.html#SEC71">The Lexical Analyzer Function <CODE>yylex</CODE></A>.
<P>
Only a simple lexical analyzer is needed for the RPN calculator. This
lexical analyzer skips blanks and tabs, then reads in numbers as
<CODE>double</CODE> and returns them as <CODE>NUM</CODE> tokens. Any other character
that isn't part of a number is a separate token. Note that the token-code
for such a single-character token is the character itself.
<P>
The return value of the lexical analyzer function is a numeric code which
represents a token type. The same text used in Bison rules to stand for
this token type is also a C expression for the numeric code for the type.
This works in two ways. If the token type is a character literal, then its
numeric code is that of the character; you can use the same
character literal in the lexical analyzer to express the number. If the
token type is an identifier, that identifier is defined by Bison as a C
macro whose definition is the appropriate number. In this example,
therefore, <CODE>NUM</CODE> becomes a macro for <CODE>yylex</CODE> to use.
<P>
The semantic value of the token (if it has one) is stored into the
global variable <CODE>yylval</CODE>, which is where the Bison parser will look
for it. (The C data type of <CODE>yylval</CODE> is <CODE>YYSTYPE</CODE>, which was
defined at the beginning of the grammar; see section <A HREF="bison.html#SEC19">Declarations for <CODE>rpcalc</CODE></A>.)
<P>
A token type code of zero is returned if the end-of-input is encountered.
(Bison recognizes any nonpositive value as indicating end-of-input.)
<P>
Here is the code for the lexical analyzer:
<PRE>
/* The lexical analyzer returns a double floating point
number on the stack and the token NUM, or the numeric code
of the character read if not a number. It skips all blanks
and tabs, and returns 0 for end-of-input. */
#include <ctype.h>
int
yylex (void)
{
int c;
/* Skip white space. */
while ((c = getchar ()) == ' ' || c == '\t')
;
/* Process numbers. */
if (c == '.' || isdigit (c))
{
ungetc (c, stdin);
scanf ("%lf", &yylval);
return NUM;
}
/* Return end-of-input. */
if (c == EOF)
return 0;
/* Return a single char. */
return c;
}
</PRE>
<H3><A NAME="SEC25" HREF="bison_toc.html#TOC25">The Controlling Function</A></H3>
<P>
<A NAME="IDX50"></A>
<A NAME="IDX51"></A>
<P>
In keeping with the spirit of this example, the controlling function is
kept to the bare minimum. The only requirement is that it call
<CODE>yyparse</CODE> to start the process of parsing.
<PRE>
int
main (void)
{
return yyparse ();
}
</PRE>
<H3><A NAME="SEC26" HREF="bison_toc.html#TOC26">The Error Reporting Routine</A></H3>
<P>
<A NAME="IDX52"></A>
<P>
When <CODE>yyparse</CODE> detects a syntax error, it calls the error reporting
function <CODE>yyerror</CODE> to print an error message (usually but not
always <CODE>"parse error"</CODE>). It is up to the programmer to supply
<CODE>yyerror</CODE> (see section <A HREF="bison.html#SEC69">Parser C-Language Interface</A>), so
here is the definition we will use:
<PRE>
#include <stdio.h>
void
yyerror (const char *s) /* called by yyparse on error */
{
printf ("%s\n", s);
}
</PRE>
<P>
After <CODE>yyerror</CODE> returns, the Bison parser may recover from the error
and continue parsing if the grammar contains a suitable error rule
(see section <A HREF="bison.html#SEC92">Error Recovery</A>). Otherwise, <CODE>yyparse</CODE> returns nonzero. We
have not written any error rules in this example, so any invalid input will
cause the calculator program to exit. This is not clean behavior for a
real calculator, but it is adequate for the first example.
<H3><A NAME="SEC27" HREF="bison_toc.html#TOC27">Running Bison to Make the Parser</A></H3>
<P>
<A NAME="IDX53"></A>
<P>
Before running Bison to produce a parser, we need to decide how to
arrange all the source code in one or more source files. For such a
simple example, the easiest thing is to put everything in one file. The
definitions of <CODE>yylex</CODE>, <CODE>yyerror</CODE> and <CODE>main</CODE> go at the
end, in the epilogue of the file
(see section <A HREF="bison.html#SEC16">The Overall Layout of a Bison Grammar</A>).
<P>
For a large project, you would probably have several source files, and use
<CODE>make</CODE> to arrange to recompile them.
<P>
With all the source in a single file, you use the following command to
convert it into a parser file:
<PRE>
bison <VAR>file_name</VAR>.y
</PRE>
<P>
In this example the file was called <TT>`rpcalc.y'</TT> (for "Reverse Polish
CALCulator"). Bison produces a file named <TT>`<VAR>file_name</VAR>.tab.c'</TT>,
removing the <SAMP>`.y'</SAMP> from the original file name. The file output by
Bison contains the source code for <CODE>yyparse</CODE>. The additional
functions in the input file (<CODE>yylex</CODE>, <CODE>yyerror</CODE> and <CODE>main</CODE>)
are copied verbatim to the output.
<H3><A NAME="SEC28" HREF="bison_toc.html#TOC28">Compiling the Parser File</A></H3>
<P>
<A NAME="IDX54"></A>
<P>
Here is how to compile and run the parser file:
<PRE>
# List files in current directory.
$ <KBD>ls</KBD>
rpcalc.tab.c rpcalc.y
# Compile the Bison parser.
# <SAMP>`-lm'</SAMP> tells compiler to search math library for <CODE>pow</CODE>.
$ <KBD>cc -lm -o rpcalc rpcalc.tab.c</KBD>
# List files again.
$ <KBD>ls</KBD>
rpcalc rpcalc.tab.c rpcalc.y
</PRE>
<P>
The file <TT>`rpcalc'</TT> now contains the executable code. Here is an
example session using <CODE>rpcalc</CODE>.
<PRE>
$ <KBD>rpcalc</KBD>
<KBD>4 9 +</KBD>
13
<KBD>3 7 + 3 4 5 *+-</KBD>
-13
<KBD>3 7 + 3 4 5 * + - n</KBD> Note the unary minus, <SAMP>`n'</SAMP>
13
<KBD>5 6 / 4 n +</KBD>
-3.166666667
<KBD>3 4 ^</KBD> Exponentiation
81
<KBD>^D</KBD> End-of-file indicator
$
</PRE>
<H2><A NAME="SEC29" HREF="bison_toc.html#TOC29">Infix Notation Calculator: <CODE>calc</CODE></A></H2>
<P>
<A NAME="IDX55"></A>
<A NAME="IDX56"></A>
<A NAME="IDX57"></A>
<P>
We now modify rpcalc to handle infix operators instead of postfix. Infix
notation involves the concept of operator precedence and the need for
parentheses nested to arbitrary depth. Here is the Bison code for
<TT>`calc.y'</TT>, an infix desk-top calculator.
<PRE>
/* Infix notation calculator--calc */
%{
#define YYSTYPE double
#include <math.h>
%}
/* BISON Declarations */
%token NUM
%left '-' '+'
%left '*' '/'
%left NEG /* negation--unary minus */
%right '^' /* exponentiation */
/* Grammar follows */
%%
input: /* empty string */
| input line
;
line: '\n'
| exp '\n' { printf ("\t%.10g\n", $1); }
;
exp: NUM { $$ = $1; }
| exp '+' exp { $$ = $1 + $3; }
| exp '-' exp { $$ = $1 - $3; }
| exp '*' exp { $$ = $1 * $3; }
| exp '/' exp { $$ = $1 / $3; }
| '-' exp %prec NEG { $$ = -$2; }
| exp '^' exp { $$ = pow ($1, $3); }
| '(' exp ')' { $$ = $2; }
;
%%
</PRE>
<P>
The functions <CODE>yylex</CODE>, <CODE>yyerror</CODE> and <CODE>main</CODE> can be the
same as before.
<P>
There are two important new features shown in this code.
<P>
In the second section (Bison declarations), <CODE>%left</CODE> declares token
types and says they are left-associative operators. The declarations
<CODE>%left</CODE> and <CODE>%right</CODE> (right associativity) take the place of
<CODE>%token</CODE> which is used to declare a token type name without
associativity. (These tokens are single-character literals, which
ordinarily don't need to be declared. We declare them here to specify
the associativity.)
<P>
Operator precedence is determined by the line ordering of the
declarations; the higher the line number of the declaration (lower on
the page or screen), the higher the precedence. Hence, exponentiation
has the highest precedence, unary minus (<CODE>NEG</CODE>) is next, followed
by <SAMP>`*'</SAMP> and <SAMP>`/'</SAMP>, and so on. See section <A HREF="bison.html#SEC81">Operator Precedence</A>.
<P>
The other important new feature is the <CODE>%prec</CODE> in the grammar
section for the unary minus operator. The <CODE>%prec</CODE> simply instructs
Bison that the rule <SAMP>`| '-' exp'</SAMP> has the same precedence as
<CODE>NEG</CODE>---in this case the next-to-highest. See section <A HREF="bison.html#SEC86">Context-Dependent Precedence</A>.
<P>
Here is a sample run of <TT>`calc.y'</TT>:
<PRE>
$ <KBD>calc</KBD>
<KBD>4 + 4.5 - (34/(8*3+-3))</KBD>
6.880952381
<KBD>-56 + 2</KBD>
-54
<KBD>3 ^ 2</KBD>
9
</PRE>
<H2><A NAME="SEC30" HREF="bison_toc.html#TOC30">Simple Error Recovery</A></H2>
<P>
<A NAME="IDX58"></A>
<P>
Up to this point, this manual has not addressed the issue of <EM>error
recovery</EM>---how to continue parsing after the parser detects a syntax
error. All we have handled is error reporting with <CODE>yyerror</CODE>.
Recall that by default <CODE>yyparse</CODE> returns after calling
<CODE>yyerror</CODE>. This means that an erroneous input line causes the
calculator program to exit. Now we show how to rectify this deficiency.
<P>
The Bison language itself includes the reserved word <CODE>error</CODE>, which
may be included in the grammar rules. In the example below it has
been added to one of the alternatives for <CODE>line</CODE>:
<PRE>
line: '\n'
| exp '\n' { printf ("\t%.10g\n", $1); }
| error '\n' { yyerrok; }
;
</PRE>
<P>
This addition to the grammar allows for simple error recovery in the
event of a parse error. If an expression that cannot be evaluated is
read, the error will be recognized by the third rule for <CODE>line</CODE>,
and parsing will continue. (The <CODE>yyerror</CODE> function is still called
upon to print its message as well.) The action executes the statement
<CODE>yyerrok</CODE>, a macro defined automatically by Bison; its meaning is
that error recovery is complete (see section <A HREF="bison.html#SEC92">Error Recovery</A>). Note the
difference between <CODE>yyerrok</CODE> and <CODE>yyerror</CODE>; neither one is a
misprint.
<P>
This form of error recovery deals with syntax errors. There are other
kinds of errors; for example, division by zero, which raises an exception
signal that is normally fatal. A real calculator program must handle this
signal and use <CODE>longjmp</CODE> to return to <CODE>main</CODE> and resume parsing
input lines; it would also have to discard the rest of the current line of
input. We won't discuss this issue further because it is not specific to
Bison programs.
<H2><A NAME="SEC31" HREF="bison_toc.html#TOC31">Location Tracking Calculator: <CODE>ltcalc</CODE></A></H2>
<P>
<A NAME="IDX59"></A>
<A NAME="IDX60"></A>
<A NAME="IDX61"></A>
<P>
This example extends the infix notation calculator with location
tracking. This feature will be used to improve the error messages. For
the sake of clarity, this example is a simple integer calculator, since
most of the work needed to use locations will be done in the lexical
analyzer.
<H3><A NAME="SEC32" HREF="bison_toc.html#TOC32">Declarations for <CODE>ltcalc</CODE></A></H3>
<P>
The C and Bison declarations for the location tracking calculator are
the same as the declarations for the infix notation calculator.
<PRE>
/* Location tracking calculator. */
%{
#define YYSTYPE int
#include <math.h>
%}
/* Bison declarations. */
%token NUM
%left '-' '+'
%left '*' '/'
%left NEG
%right '^'
%% /* Grammar follows */
</PRE>
<P>
Note there are no declarations specific to locations. Defining a data
type for storing locations is not needed: we will use the type provided
by default (see section <A HREF="bison.html#SEC56">Data Type of Locations</A>), which is a
four member structure with the following integer fields:
<CODE>first_line</CODE>, <CODE>first_column</CODE>, <CODE>last_line</CODE> and
<CODE>last_column</CODE>.
<H3><A NAME="SEC33" HREF="bison_toc.html#TOC33">Grammar Rules for <CODE>ltcalc</CODE></A></H3>
<P>
Whether handling locations or not has no effect on the syntax of your
language. Therefore, grammar rules for this example will be very close
to those of the previous example: we will only modify them to benefit
from the new information.
<P>
Here, we will use locations to report divisions by zero, and locate the
wrong expressions or subexpressions.
<PRE>
input : /* empty */
| input line
;
line : '\n'
| exp '\n' { printf ("%d\n", $1); }
;
exp : NUM { $$ = $1; }
| exp '+' exp { $$ = $1 + $3; }
| exp '-' exp { $$ = $1 - $3; }
| exp '*' exp { $$ = $1 * $3; }
| exp '/' exp
{
if ($3)
$$ = $1 / $3;
else
{
$$ = 1;
fprintf (stderr, "%d.%d-%d.%d: division by zero",
@3.first_line, @3.first_column,
@3.last_line, @3.last_column);
}
}
| '-' exp %preg NEG { $$ = -$2; }
| exp '^' exp { $$ = pow ($1, $3); }
| '(' exp ')' { $$ = $2; }
</PRE>
<P>
This code shows how to reach locations inside of semantic actions, by
using the pseudo-variables <CODE>@<VAR>n</VAR></CODE> for rule components, and the
pseudo-variable <CODE>@$</CODE> for groupings.
<P>
We don't need to assign a value to <CODE>@$</CODE>: the output parser does it
automatically. By default, before executing the C code of each action,
<CODE>@$</CODE> is set to range from the beginning of <CODE>@1</CODE> to the end
of <CODE>@<VAR>n</VAR></CODE>, for a rule with <VAR>n</VAR> components. This behavior
can be redefined (see section <A HREF="bison.html#SEC58">Default Action for Locations</A>), and for very specific rules, <CODE>@$</CODE> can be computed by
hand.
<H3><A NAME="SEC34" HREF="bison_toc.html#TOC34">The <CODE>ltcalc</CODE> Lexical Analyzer.</A></H3>
<P>
Until now, we relied on Bison's defaults to enable location
tracking. The next step is to rewrite the lexical analyzer, and make it
able to feed the parser with the token locations, as it already does for
semantic values.
<P>
To this end, we must take into account every single character of the
input text, to avoid the computed locations of being fuzzy or wrong:
<PRE>
int
yylex (void)
{
int c;
/* Skip white space. */
while ((c = getchar ()) == ' ' || c == '\t')
++yylloc.last_column;
/* Step. */
yylloc.first_line = yylloc.last_line;
yylloc.first_column = yylloc.last_column;
/* Process numbers. */
if (isdigit (c))
{
yylval = c - '0';
++yylloc.last_column;
while (isdigit (c = getchar ()))
{
++yylloc.last_column;
yylval = yylval * 10 + c - '0';
}
ungetc (c, stdin);
return NUM;
}
/* Return end-of-input. */
if (c == EOF)
return 0;
/* Return a single char, and update location. */
if (c == '\n')
{
++yylloc.last_line;
yylloc.last_column = 0;
}
else
++yylloc.last_column;
return c;
}
</PRE>
<P>
Basically, the lexical analyzer performs the same processing as before:
it skips blanks and tabs, and reads numbers or single-character tokens.
In addition, it updates <CODE>yylloc</CODE>, the global variable (of type
<CODE>YYLTYPE</CODE>) containing the token's location.
<P>
Now, each time this function returns a token, the parser has its number
as well as its semantic value, and its location in the text. The last
needed change is to initialize <CODE>yylloc</CODE>, for example in the
controlling function:
<PRE>
int
main (void)
{
yylloc.first_line = yylloc.last_line = 1;
yylloc.first_column = yylloc.last_column = 0;
return yyparse ();
}
</PRE>
<P>
Remember that computing locations is not a matter of syntax. Every
character must be associated to a location update, whether it is in
valid input, in comments, in literal strings, and so on.
<H2><A NAME="SEC35" HREF="bison_toc.html#TOC35">Multi-Function Calculator: <CODE>mfcalc</CODE></A></H2>
<P>
<A NAME="IDX62"></A>
<A NAME="IDX63"></A>
<A NAME="IDX64"></A>
<P>
Now that the basics of Bison have been discussed, it is time to move on to
a more advanced problem. The above calculators provided only five
functions, <SAMP>`+'</SAMP>, <SAMP>`-'</SAMP>, <SAMP>`*'</SAMP>, <SAMP>`/'</SAMP> and <SAMP>`^'</SAMP>. It would
be nice to have a calculator that provides other mathematical functions such
as <CODE>sin</CODE>, <CODE>cos</CODE>, etc.
<P>
It is easy to add new operators to the infix calculator as long as they are
only single-character literals. The lexical analyzer <CODE>yylex</CODE> passes
back all nonnumber characters as tokens, so new grammar rules suffice for
adding a new operator. But we want something more flexible: built-in
functions whose syntax has this form:
<PRE>
<VAR>function_name</VAR> (<VAR>argument</VAR>)
</PRE>
<P>
At the same time, we will add memory to the calculator, by allowing you
to create named variables, store values in them, and use them later.
Here is a sample session with the multi-function calculator:
<PRE>
$ <KBD>mfcalc</KBD>
<KBD>pi = 3.141592653589</KBD>
3.1415926536
<KBD>sin(pi)</KBD>
0.0000000000
<KBD>alpha = beta1 = 2.3</KBD>
2.3000000000
<KBD>alpha</KBD>
2.3000000000
<KBD>ln(alpha)</KBD>
0.8329091229
<KBD>exp(ln(beta1))</KBD>
2.3000000000
$
</PRE>
<P>
Note that multiple assignment and nested function calls are permitted.
<H3><A NAME="SEC36" HREF="bison_toc.html#TOC36">Declarations for <CODE>mfcalc</CODE></A></H3>
<P>
Here are the C and Bison declarations for the multi-function calculator.
<PRE>
%{
#include <math.h> /* For math functions, cos(), sin(), etc. */
#include "calc.h" /* Contains definition of `symrec' */
%}
%union {
double val; /* For returning numbers. */
symrec *tptr; /* For returning symbol-table pointers */
}
%token <val> NUM /* Simple double precision number */
%token <tptr> VAR FNCT /* Variable and Function */
%type <val> exp
%right '='
%left '-' '+'
%left '*' '/'
%left NEG /* Negation--unary minus */
%right '^' /* Exponentiation */
/* Grammar follows */
%%
</PRE>
<P>
The above grammar introduces only two new features of the Bison language.
These features allow semantic values to have various data types
(see section <A HREF="bison.html#SEC51">More Than One Value Type</A>).
<P>
The <CODE>%union</CODE> declaration specifies the entire list of possible types;
this is instead of defining <CODE>YYSTYPE</CODE>. The allowable types are now
double-floats (for <CODE>exp</CODE> and <CODE>NUM</CODE>) and pointers to entries in
the symbol table. See section <A HREF="bison.html#SEC62">The Collection of Value Types</A>.
<P>
Since values can now have various types, it is necessary to associate a
type with each grammar symbol whose semantic value is used. These symbols
are <CODE>NUM</CODE>, <CODE>VAR</CODE>, <CODE>FNCT</CODE>, and <CODE>exp</CODE>. Their
declarations are augmented with information about their data type (placed
between angle brackets).
<P>
The Bison construct <CODE>%type</CODE> is used for declaring nonterminal
symbols, just as <CODE>%token</CODE> is used for declaring token types. We
have not used <CODE>%type</CODE> before because nonterminal symbols are
normally declared implicitly by the rules that define them. But
<CODE>exp</CODE> must be declared explicitly so we can specify its value type.
See section <A HREF="bison.html#SEC63">Nonterminal Symbols</A>.
<H3><A NAME="SEC37" HREF="bison_toc.html#TOC37">Grammar Rules for <CODE>mfcalc</CODE></A></H3>
<P>
Here are the grammar rules for the multi-function calculator.
Most of them are copied directly from <CODE>calc</CODE>; three rules,
those which mention <CODE>VAR</CODE> or <CODE>FNCT</CODE>, are new.
<PRE>
input: /* empty */
| input line
;
line:
'\n'
| exp '\n' { printf ("\t%.10g\n", $1); }
| error '\n' { yyerrok; }
;
exp: NUM { $$ = $1; }
| VAR { $$ = $1->value.var; }
| VAR '=' exp { $$ = $3; $1->value.var = $3; }
| FNCT '(' exp ')' { $$ = (*($1->value.fnctptr))($3); }
| exp '+' exp { $$ = $1 + $3; }
| exp '-' exp { $$ = $1 - $3; }
| exp '*' exp { $$ = $1 * $3; }
| exp '/' exp { $$ = $1 / $3; }
| '-' exp %prec NEG { $$ = -$2; }
| exp '^' exp { $$ = pow ($1, $3); }
| '(' exp ')' { $$ = $2; }
;
/* End of grammar */
%%
</PRE>
<H3><A NAME="SEC38" HREF="bison_toc.html#TOC38">The <CODE>mfcalc</CODE> Symbol Table</A></H3>
<P>
<A NAME="IDX65"></A>
<P>
The multi-function calculator requires a symbol table to keep track of the
names and meanings of variables and functions. This doesn't affect the
grammar rules (except for the actions) or the Bison declarations, but it
requires some additional C functions for support.
<P>
The symbol table itself consists of a linked list of records. Its
definition, which is kept in the header <TT>`calc.h'</TT>, is as follows. It
provides for either functions or variables to be placed in the table.
<PRE>
/* Function type. */
typedef double (*func_t) (double);
/* Data type for links in the chain of symbols. */
struct symrec
{
char *name; /* name of symbol */
int type; /* type of symbol: either VAR or FNCT */
union
{
double var; /* value of a VAR */
func_t fnctptr; /* value of a FNCT */
} value;
struct symrec *next; /* link field */
};
typedef struct symrec symrec;
/* The symbol table: a chain of `struct symrec'. */
extern symrec *sym_table;
symrec *putsym (const char *, func_t);
symrec *getsym (const char *);
</PRE>
<P>
The new version of <CODE>main</CODE> includes a call to <CODE>init_table</CODE>, a
function that initializes the symbol table. Here it is, and
<CODE>init_table</CODE> as well:
<PRE>
#include <stdio.h>
int
main (void)
{
init_table ();
return yyparse ();
}
void
yyerror (const char *s) /* Called by yyparse on error */
{
printf ("%s\n", s);
}
struct init
{
char *fname;
double (*fnct)(double);
};
struct init arith_fncts[] =
{
"sin", sin,
"cos", cos,
"atan", atan,
"ln", log,
"exp", exp,
"sqrt", sqrt,
0, 0
};
/* The symbol table: a chain of `struct symrec'. */
symrec *sym_table = (symrec *) 0;
/* Put arithmetic functions in table. */
void
init_table (void)
{
int i;
symrec *ptr;
for (i = 0; arith_fncts[i].fname != 0; i++)
{
ptr = putsym (arith_fncts[i].fname, FNCT);
ptr->value.fnctptr = arith_fncts[i].fnct;
}
}
</PRE>
<P>
By simply editing the initialization list and adding the necessary include
files, you can add additional functions to the calculator.
<P>
Two important functions allow look-up and installation of symbols in the
symbol table. The function <CODE>putsym</CODE> is passed a name and the type
(<CODE>VAR</CODE> or <CODE>FNCT</CODE>) of the object to be installed. The object is
linked to the front of the list, and a pointer to the object is returned.
The function <CODE>getsym</CODE> is passed the name of the symbol to look up. If
found, a pointer to that symbol is returned; otherwise zero is returned.
<PRE>
symrec *
putsym (char *sym_name, int sym_type)
{
symrec *ptr;
ptr = (symrec *) malloc (sizeof (symrec));
ptr->name = (char *) malloc (strlen (sym_name) + 1);
strcpy (ptr->name,sym_name);
ptr->type = sym_type;
ptr->value.var = 0; /* Set value to 0 even if fctn. */
ptr->next = (struct symrec *)sym_table;
sym_table = ptr;
return ptr;
}
symrec *
getsym (const char *sym_name)
{
symrec *ptr;
for (ptr = sym_table; ptr != (symrec *) 0;
ptr = (symrec *)ptr->next)
if (strcmp (ptr->name,sym_name) == 0)
return ptr;
return 0;
}
</PRE>
<P>
The function <CODE>yylex</CODE> must now recognize variables, numeric values, and
the single-character arithmetic operators. Strings of alphanumeric
characters with a leading non-digit are recognized as either variables or
functions depending on what the symbol table says about them.
<P>
The string is passed to <CODE>getsym</CODE> for look up in the symbol table. If
the name appears in the table, a pointer to its location and its type
(<CODE>VAR</CODE> or <CODE>FNCT</CODE>) is returned to <CODE>yyparse</CODE>. If it is not
already in the table, then it is installed as a <CODE>VAR</CODE> using
<CODE>putsym</CODE>. Again, a pointer and its type (which must be <CODE>VAR</CODE>) is
returned to <CODE>yyparse</CODE>.
<P>
No change is needed in the handling of numeric values and arithmetic
operators in <CODE>yylex</CODE>.
<PRE>
#include <ctype.h>
int
yylex (void)
{
int c;
/* Ignore white space, get first nonwhite character. */
while ((c = getchar ()) == ' ' || c == '\t');
if (c == EOF)
return 0;
/* Char starts a number => parse the number. */
if (c == '.' || isdigit (c))
{
ungetc (c, stdin);
scanf ("%lf", &yylval.val);
return NUM;
}
/* Char starts an identifier => read the name. */
if (isalpha (c))
{
symrec *s;
static char *symbuf = 0;
static int length = 0;
int i;
/* Initially make the buffer long enough
for a 40-character symbol name. */
if (length == 0)
length = 40, symbuf = (char *)malloc (length + 1);
i = 0;
do
{
/* If buffer is full, make it bigger. */
if (i == length)
{
length *= 2;
symbuf = (char *)realloc (symbuf, length + 1);
}
/* Add this character to the buffer. */
symbuf[i++] = c;
/* Get another character. */
c = getchar ();
}
while (isalnum (c));
ungetc (c, stdin);
symbuf[i] = '\0';
s = getsym (symbuf);
if (s == 0)
s = putsym (symbuf, VAR);
yylval.tptr = s;
return s->type;
}
/* Any other character is a token by itself. */
return c;
}
</PRE>
<P>
This program is both powerful and flexible. You may easily add new
functions, and it is a simple job to modify this code to install
predefined variables such as <CODE>pi</CODE> or <CODE>e</CODE> as well.
<H2><A NAME="SEC39" HREF="bison_toc.html#TOC39">Exercises</A></H2>
<P>
<A NAME="IDX66"></A>
<OL>
<LI>
Add some new functions from <TT>`math.h'</TT> to the initialization list.
<LI>
Add another array that contains constants and their values. Then
modify <CODE>init_table</CODE> to add these constants to the symbol table.
It will be easiest to give the constants type <CODE>VAR</CODE>.
<LI>
Make the program report an error if the user refers to an
uninitialized variable in any way except to store a value in it.
</OL>
<H1><A NAME="SEC40" HREF="bison_toc.html#TOC40">Bison Grammar Files</A></H1>
<P>
Bison takes as input a context-free grammar specification and produces a
C-language function that recognizes correct instances of the grammar.
<P>
The Bison grammar input file conventionally has a name ending in <SAMP>`.y'</SAMP>.
See section <A HREF="bison.html#SEC100">Invoking Bison</A>.
<H2><A NAME="SEC41" HREF="bison_toc.html#TOC41">Outline of a Bison Grammar</A></H2>
<P>
A Bison grammar file has four main sections, shown here with the
appropriate delimiters:
<PRE>
%{
<VAR>Prologue</VAR>
%}
<VAR>Bison declarations</VAR>
%%
<VAR>Grammar rules</VAR>
%%
<VAR>Epilogue</VAR>
</PRE>
<P>
Comments enclosed in <SAMP>`/* ... */'</SAMP> may appear in any of the sections.
<H3><A NAME="SEC42" HREF="bison_toc.html#TOC42">The prologue</A></H3>
<P>
<A NAME="IDX67"></A>
<A NAME="IDX68"></A>
<A NAME="IDX69"></A>
<P>
The <VAR>Prologue</VAR> section contains macro definitions and
declarations of functions and variables that are used in the actions in the
grammar rules. These are copied to the beginning of the parser file so
that they precede the definition of <CODE>yyparse</CODE>. You can use
<SAMP>`#include'</SAMP> to get the declarations from a header file. If you don't
need any C declarations, you may omit the <SAMP>`%{'</SAMP> and <SAMP>`%}'</SAMP>
delimiters that bracket this section.
<P>
You may have more than one <VAR>Prologue</VAR> section, intermixed with the
<VAR>Bison declarations</VAR>. This allows you to have C and Bison
declarations that refer to each other. For example, the <CODE>%union</CODE>
declaration may use types defined in a header file, and you may wish to
prototype functions that take arguments of type <CODE>YYSTYPE</CODE>. This
can be done with two <VAR>Prologue</VAR> blocks, one before and one after the
<CODE>%union</CODE> declaration.
<PRE>
%{
#include <stdio.h>
#include "ptypes.h"
%}
%union {
long n;
tree t; /* <CODE>tree</CODE> is defined in <TT>`ptypes.h'</TT>. */
}
%{
static void yyprint(FILE *, int, YYSTYPE);
#define YYPRINT(F, N, L) yyprint(F, N, L)
%}
...
</PRE>
<H3><A NAME="SEC43" HREF="bison_toc.html#TOC43">The Bison Declarations Section</A></H3>
<P>
<A NAME="IDX70"></A>
<A NAME="IDX71"></A>
<P>
The <VAR>Bison declarations</VAR> section contains declarations that define
terminal and nonterminal symbols, specify precedence, and so on.
In some simple grammars you may not need any declarations.
See section <A HREF="bison.html#SEC59">Bison Declarations</A>.
<H3><A NAME="SEC44" HREF="bison_toc.html#TOC44">The Grammar Rules Section</A></H3>
<P>
<A NAME="IDX72"></A>
<A NAME="IDX73"></A>
<P>
The <EM>grammar rules</EM> section contains one or more Bison grammar
rules, and nothing else. See section <A HREF="bison.html#SEC47">Syntax of Grammar Rules</A>.
<P>
There must always be at least one grammar rule, and the first
<SAMP>`%%'</SAMP> (which precedes the grammar rules) may never be omitted even
if it is the first thing in the file.
<H3><A NAME="SEC45" HREF="bison_toc.html#TOC45">The epilogue</A></H3>
<P>
<A NAME="IDX74"></A>
<A NAME="IDX75"></A>
<A NAME="IDX76"></A>
<P>
The <VAR>Epilogue</VAR> is copied verbatim to the end of the parser file, just as
the <VAR>Prologue</VAR> is copied to the beginning. This is the most convenient
place to put anything that you want to have in the parser file but which need
not come before the definition of <CODE>yyparse</CODE>. For example, the
definitions of <CODE>yylex</CODE> and <CODE>yyerror</CODE> often go here.
See section <A HREF="bison.html#SEC69">Parser C-Language Interface</A>.
<P>
If the last section is empty, you may omit the <SAMP>`%%'</SAMP> that separates it
from the grammar rules.
<P>
The Bison parser itself contains many static variables whose names start
with <SAMP>`yy'</SAMP> and many macros whose names start with <SAMP>`YY'</SAMP>. It is a
good idea to avoid using any such names (except those documented in this
manual) in the epilogue of the grammar file.
<H2><A NAME="SEC46" HREF="bison_toc.html#TOC46">Symbols, Terminal and Nonterminal</A></H2>
<P>
<A NAME="IDX77"></A>
<A NAME="IDX78"></A>
<A NAME="IDX79"></A>
<A NAME="IDX80"></A>
<P>
<EM>Symbols</EM> in Bison grammars represent the grammatical classifications
of the language.
<P>
A <EM>terminal symbol</EM> (also known as a <EM>token type</EM>) represents a
class of syntactically equivalent tokens. You use the symbol in grammar
rules to mean that a token in that class is allowed. The symbol is
represented in the Bison parser by a numeric code, and the <CODE>yylex</CODE>
function returns a token type code to indicate what kind of token has been
read. You don't need to know what the code value is; you can use the
symbol to stand for it.
<P>
A <EM>nonterminal symbol</EM> stands for a class of syntactically equivalent
groupings. The symbol name is used in writing grammar rules. By convention,
it should be all lower case.
<P>
Symbol names can contain letters, digits (not at the beginning),
underscores and periods. Periods make sense only in nonterminals.
<P>
There are three ways of writing terminal symbols in the grammar:
<UL>
<LI>
A <EM>named token type</EM> is written with an identifier, like an
identifier in C. By convention, it should be all upper case. Each
such name must be defined with a Bison declaration such as
<CODE>%token</CODE>. See section <A HREF="bison.html#SEC60">Token Type Names</A>.
<LI>
<A NAME="IDX81"></A>
<A NAME="IDX82"></A>
<A NAME="IDX83"></A>
A <EM>character token type</EM> (or <EM>literal character token</EM>) is
written in the grammar using the same syntax used in C for character
constants; for example, <CODE>'+'</CODE> is a character token type. A
character token type doesn't need to be declared unless you need to
specify its semantic value data type (see section <A HREF="bison.html#SEC50">Data Types of Semantic Values</A>), associativity, or precedence (see section <A HREF="bison.html#SEC81">Operator Precedence</A>).
By convention, a character token type is used only to represent a
token that consists of that particular character. Thus, the token
type <CODE>'+'</CODE> is used to represent the character <SAMP>`+'</SAMP> as a
token. Nothing enforces this convention, but if you depart from it,
your program will confuse other readers.
All the usual escape sequences used in character literals in C can be
used in Bison as well, but you must not use the null character as a
character literal because its numeric code, zero, signifies
end-of-input (see section <A HREF="bison.html#SEC72">Calling Convention for <CODE>yylex</CODE></A>).
<LI>
<A NAME="IDX84"></A>
<A NAME="IDX85"></A>
<A NAME="IDX86"></A>
A <EM>literal string token</EM> is written like a C string constant; for
example, <CODE>"<="</CODE> is a literal string token. A literal string token
doesn't need to be declared unless you need to specify its semantic
value data type (see section <A HREF="bison.html#SEC50">Data Types of Semantic Values</A>), associativity, or precedence
(see section <A HREF="bison.html#SEC81">Operator Precedence</A>).
You can associate the literal string token with a symbolic name as an
alias, using the <CODE>%token</CODE> declaration (see section <A HREF="bison.html#SEC60">Token Type Names</A>). If you don't do that, the lexical analyzer has to
retrieve the token number for the literal string token from the
<CODE>yytname</CODE> table (see section <A HREF="bison.html#SEC72">Calling Convention for <CODE>yylex</CODE></A>).
<STRONG>WARNING</STRONG>: literal string tokens do not work in Yacc.
By convention, a literal string token is used only to represent a token
that consists of that particular string. Thus, you should use the token
type <CODE>"<="</CODE> to represent the string <SAMP>`<='</SAMP> as a token. Bison
does not enforce this convention, but if you depart from it, people who
read your program will be confused.
All the escape sequences used in string literals in C can be used in
Bison as well. A literal string token must contain two or more
characters; for a token containing just one character, use a character
token (see above).
</UL>
<P>
How you choose to write a terminal symbol has no effect on its
grammatical meaning. That depends only on where it appears in rules and
on when the parser function returns that symbol.
<P>
The value returned by <CODE>yylex</CODE> is always one of the terminal
symbols, except that a zero or negative value signifies end-of-input.
Whichever way you write the token type in the grammar rules, you write
it the same way in the definition of <CODE>yylex</CODE>. The numeric code
for a character token type is simply the positive numeric code of the
character, so <CODE>yylex</CODE> can use the identical value to generate the
requisite code, though you may need to convert it to <CODE>unsigned
char</CODE> to avoid sign-extension on hosts where <CODE>char</CODE> is signed.
Each named token type becomes a C macro in
the parser file, so <CODE>yylex</CODE> can use the name to stand for the code.
(This is why periods don't make sense in terminal symbols.)
See section <A HREF="bison.html#SEC72">Calling Convention for <CODE>yylex</CODE></A>.
<P>
If <CODE>yylex</CODE> is defined in a separate file, you need to arrange for the
token-type macro definitions to be available there. Use the <SAMP>`-d'</SAMP>
option when you run Bison, so that it will write these macro definitions
into a separate header file <TT>`<VAR>name</VAR>.tab.h'</TT> which you can include
in the other source files that need it. See section <A HREF="bison.html#SEC100">Invoking Bison</A>.
<P>
If you want to write a grammar that is portable to any Standard C
host, you must use only non-null character tokens taken from the basic
execution character set of Standard C. This set consists of the ten
digits, the 52 lower- and upper-case English letters, and the
characters in the following C-language string:
<PRE>
"\a\b\t\n\v\f\r !\"#%&'()*+,-./:;<=>?[\\]^_{|}~"
</PRE>
<P>
The <CODE>yylex</CODE> function and Bison must use a consistent character
set and encoding for character tokens. For example, if you run Bison in an
ASCII environment, but then compile and run the resulting program
in an environment that uses an incompatible character set like
EBCDIC, the resulting program may not work because the
tables generated by Bison will assume ASCII numeric values for
character tokens. It is standard
practice for software distributions to contain C source files that
were generated by Bison in an ASCII environment, so installers on
platforms that are incompatible with ASCII must rebuild those
files before compiling them.
<P>
The symbol <CODE>error</CODE> is a terminal symbol reserved for error recovery
(see section <A HREF="bison.html#SEC92">Error Recovery</A>); you shouldn't use it for any other purpose.
In particular, <CODE>yylex</CODE> should never return this value. The default
value of the error token is 256, unless you explicitly assigned 256 to
one of your tokens with a <CODE>%token</CODE> declaration.
<H2><A NAME="SEC47" HREF="bison_toc.html#TOC47">Syntax of Grammar Rules</A></H2>
<P>
<A NAME="IDX87"></A>
<A NAME="IDX88"></A>
<A NAME="IDX89"></A>
<P>
A Bison grammar rule has the following general form:
<PRE>
<VAR>result</VAR>: <VAR>components</VAR>...
;
</PRE>
<P>
where <VAR>result</VAR> is the nonterminal symbol that this rule describes,
and <VAR>components</VAR> are various terminal and nonterminal symbols that
are put together by this rule (see section <A HREF="bison.html#SEC46">Symbols, Terminal and Nonterminal</A>).
<P>
For example,
<PRE>
exp: exp '+' exp
;
</PRE>
<P>
says that two groupings of type <CODE>exp</CODE>, with a <SAMP>`+'</SAMP> token in between,
can be combined into a larger grouping of type <CODE>exp</CODE>.
<P>
White space in rules is significant only to separate symbols. You can add
extra white space as you wish.
<P>
Scattered among the components can be <VAR>actions</VAR> that determine
the semantics of the rule. An action looks like this:
<PRE>
{<VAR>C statements</VAR>}
</PRE>
<P>
Usually there is only one action and it follows the components.
See section <A HREF="bison.html#SEC52">Actions</A>.
<P>
<A NAME="IDX90"></A>
Multiple rules for the same <VAR>result</VAR> can be written separately or can
be joined with the vertical-bar character <SAMP>`|'</SAMP> as follows:
<PRE>
<VAR>result</VAR>: <VAR>rule1-components</VAR>...
| <VAR>rule2-components</VAR>...
...
;
</PRE>
<P>
They are still considered distinct rules even when joined in this way.
<P>
If <VAR>components</VAR> in a rule is empty, it means that <VAR>result</VAR> can
match the empty string. For example, here is how to define a
comma-separated sequence of zero or more <CODE>exp</CODE> groupings:
<PRE>
expseq: /* empty */
| expseq1
;
expseq1: exp
| expseq1 ',' exp
;
</PRE>
<P>
It is customary to write a comment <SAMP>`/* empty */'</SAMP> in each rule
with no components.
<H2><A NAME="SEC48" HREF="bison_toc.html#TOC48">Recursive Rules</A></H2>
<P>
<A NAME="IDX91"></A>
<P>
A rule is called <EM>recursive</EM> when its <VAR>result</VAR> nonterminal appears
also on its right hand side. Nearly all Bison grammars need to use
recursion, because that is the only way to define a sequence of any number
of a particular thing. Consider this recursive definition of a
comma-separated sequence of one or more expressions:
<PRE>
expseq1: exp
| expseq1 ',' exp
;
</PRE>
<P>
<A NAME="IDX92"></A>
<A NAME="IDX93"></A>
Since the recursive use of <CODE>expseq1</CODE> is the leftmost symbol in the
right hand side, we call this <EM>left recursion</EM>. By contrast, here
the same construct is defined using <EM>right recursion</EM>:
<PRE>
expseq1: exp
| exp ',' expseq1
;
</PRE>
<P>
Any kind of sequence can be defined using either left recursion or right
recursion, but you should always use left recursion, because it can
parse a sequence of any number of elements with bounded stack space.
Right recursion uses up space on the Bison stack in proportion to the
number of elements in the sequence, because all the elements must be
shifted onto the stack before the rule can be applied even once.
See section <A HREF="bison.html#SEC78">The Bison Parser Algorithm</A>, for further explanation
of this.
<P>
<A NAME="IDX94"></A>
<EM>Indirect</EM> or <EM>mutual</EM> recursion occurs when the result of the
rule does not appear directly on its right hand side, but does appear
in rules for other nonterminals which do appear on its right hand
side.
<P>
For example:
<PRE>
expr: primary
| primary '+' primary
;
primary: constant
| '(' expr ')'
;
</PRE>
<P>
defines two mutually-recursive nonterminals, since each refers to the
other.
<H2><A NAME="SEC49" HREF="bison_toc.html#TOC49">Defining Language Semantics</A></H2>
<P>
<A NAME="IDX95"></A>
<A NAME="IDX96"></A>
<P>
The grammar rules for a language determine only the syntax. The semantics
are determined by the semantic values associated with various tokens and
groupings, and by the actions taken when various groupings are recognized.
<P>
For example, the calculator calculates properly because the value
associated with each expression is the proper number; it adds properly
because the action for the grouping <SAMP>`<VAR>x</VAR> + <VAR>y</VAR>'</SAMP> is to add
the numbers associated with <VAR>x</VAR> and <VAR>y</VAR>.
<H3><A NAME="SEC50" HREF="bison_toc.html#TOC50">Data Types of Semantic Values</A></H3>
<P>
<A NAME="IDX97"></A>
<A NAME="IDX98"></A>
<A NAME="IDX99"></A>
<A NAME="IDX100"></A>
<P>
In a simple program it may be sufficient to use the same data type for
the semantic values of all language constructs. This was true in the
RPN and infix calculator examples (see section <A HREF="bison.html#SEC18">Reverse Polish Notation Calculator</A>).
<P>
Bison's default is to use type <CODE>int</CODE> for all semantic values. To
specify some other type, define <CODE>YYSTYPE</CODE> as a macro, like this:
<PRE>
#define YYSTYPE double
</PRE>
<P>
This macro definition must go in the prologue of the grammar file
(see section <A HREF="bison.html#SEC41">Outline of a Bison Grammar</A>).
<H3><A NAME="SEC51" HREF="bison_toc.html#TOC51">More Than One Value Type</A></H3>
<P>
In most programs, you will need different data types for different kinds
of tokens and groupings. For example, a numeric constant may need type
<CODE>int</CODE> or <CODE>long</CODE>, while a string constant needs type <CODE>char *</CODE>,
and an identifier might need a pointer to an entry in the symbol table.
<P>
To use more than one data type for semantic values in one parser, Bison
requires you to do two things:
<UL>
<LI>
Specify the entire collection of possible data types, with the
<CODE>%union</CODE> Bison declaration (see section <A HREF="bison.html#SEC62">The Collection of Value Types</A>).
<LI>
Choose one of those types for each symbol (terminal or nonterminal) for
which semantic values are used. This is done for tokens with the
<CODE>%token</CODE> Bison declaration (see section <A HREF="bison.html#SEC60">Token Type Names</A>)
and for groupings with the <CODE>%type</CODE> Bison declaration (see section <A HREF="bison.html#SEC63">Nonterminal Symbols</A>).
</UL>
<H3><A NAME="SEC52" HREF="bison_toc.html#TOC52">Actions</A></H3>
<P>
<A NAME="IDX101"></A>
<A NAME="IDX102"></A>
<A NAME="IDX103"></A>
<P>
An action accompanies a syntactic rule and contains C code to be executed
each time an instance of that rule is recognized. The task of most actions
is to compute a semantic value for the grouping built by the rule from the
semantic values associated with tokens or smaller groupings.
<P>
An action consists of C statements surrounded by braces, much like a
compound statement in C. It can be placed at any position in the rule;
it is executed at that position. Most rules have just one action at the
end of the rule, following all the components. Actions in the middle of
a rule are tricky and used only for special purposes (see section <A HREF="bison.html#SEC54">Actions in Mid-Rule</A>).
<P>
The C code in an action can refer to the semantic values of the components
matched by the rule with the construct <CODE>$<VAR>n</VAR></CODE>, which stands for
the value of the <VAR>n</VAR>th component. The semantic value for the grouping
being constructed is <CODE>$$</CODE>. (Bison translates both of these constructs
into array element references when it copies the actions into the parser
file.)
<P>
Here is a typical example:
<PRE>
exp: ...
| exp '+' exp
{ $$ = $1 + $3; }
</PRE>
<P>
This rule constructs an <CODE>exp</CODE> from two smaller <CODE>exp</CODE> groupings
connected by a plus-sign token. In the action, <CODE>$1</CODE> and <CODE>$3</CODE>
refer to the semantic values of the two component <CODE>exp</CODE> groupings,
which are the first and third symbols on the right hand side of the rule.
The sum is stored into <CODE>$$</CODE> so that it becomes the semantic value of
the addition-expression just recognized by the rule. If there were a
useful semantic value associated with the <SAMP>`+'</SAMP> token, it could be
referred to as <CODE>$2</CODE>.
<P>
Note that the vertical-bar character <SAMP>`|'</SAMP> is really a rule
separator, and actions are attached to a single rule. This is a
difference with tools like Flex, for which <SAMP>`|'</SAMP> stands for either
"or", or "the same action as that of the next rule". In the
following example, the action is triggered only when <SAMP>`b'</SAMP> is found:
<PRE>
a-or-b: 'a'|'b' { a_or_b_found = 1; };
</PRE>
<P>
<A NAME="IDX104"></A>
If you don't specify an action for a rule, Bison supplies a default:
<CODE>$$ = $1</CODE>. Thus, the value of the first symbol in the rule becomes
the value of the whole rule. Of course, the default rule is valid only
if the two data types match. There is no meaningful default action for
an empty rule; every empty rule must have an explicit action unless the
rule's value does not matter.
<P>
<CODE>$<VAR>n</VAR></CODE> with <VAR>n</VAR> zero or negative is allowed for reference
to tokens and groupings on the stack <EM>before</EM> those that match the
current rule. This is a very risky practice, and to use it reliably
you must be certain of the context in which the rule is applied. Here
is a case in which you can use this reliably:
<PRE>
foo: expr bar '+' expr { ... }
| expr bar '-' expr { ... }
;
bar: /* empty */
{ previous_expr = $0; }
;
</PRE>
<P>
As long as <CODE>bar</CODE> is used only in the fashion shown here, <CODE>$0</CODE>
always refers to the <CODE>expr</CODE> which precedes <CODE>bar</CODE> in the
definition of <CODE>foo</CODE>.
<H3><A NAME="SEC53" HREF="bison_toc.html#TOC53">Data Types of Values in Actions</A></H3>
<P>
<A NAME="IDX105"></A>
<A NAME="IDX106"></A>
<P>
If you have chosen a single data type for semantic values, the <CODE>$$</CODE>
and <CODE>$<VAR>n</VAR></CODE> constructs always have that data type.
<P>
If you have used <CODE>%union</CODE> to specify a variety of data types, then you
must declare a choice among these types for each terminal or nonterminal
symbol that can have a semantic value. Then each time you use <CODE>$$</CODE> or
<CODE>$<VAR>n</VAR></CODE>, its data type is determined by which symbol it refers to
in the rule. In this example,
<PRE>
exp: ...
| exp '+' exp
{ $$ = $1 + $3; }
</PRE>
<P>
<CODE>$1</CODE> and <CODE>$3</CODE> refer to instances of <CODE>exp</CODE>, so they all
have the data type declared for the nonterminal symbol <CODE>exp</CODE>. If
<CODE>$2</CODE> were used, it would have the data type declared for the
terminal symbol <CODE>'+'</CODE>, whatever that might be.
<P>
Alternatively, you can specify the data type when you refer to the value,
by inserting <SAMP>`<<VAR>type</VAR>>'</SAMP> after the <SAMP>`$'</SAMP> at the beginning of the
reference. For example, if you have defined types as shown here:
<PRE>
%union {
int itype;
double dtype;
}
</PRE>
<P>
then you can write <CODE>$<itype>1</CODE> to refer to the first subunit of the
rule as an integer, or <CODE>$<dtype>1</CODE> to refer to it as a double.
<H3><A NAME="SEC54" HREF="bison_toc.html#TOC54">Actions in Mid-Rule</A></H3>
<P>
<A NAME="IDX107"></A>
<A NAME="IDX108"></A>
<P>
Occasionally it is useful to put an action in the middle of a rule.
These actions are written just like usual end-of-rule actions, but they
are executed before the parser even recognizes the following components.
<P>
A mid-rule action may refer to the components preceding it using
<CODE>$<VAR>n</VAR></CODE>, but it may not refer to subsequent components because
it is run before they are parsed.
<P>
The mid-rule action itself counts as one of the components of the rule.
This makes a difference when there is another action later in the same rule
(and usually there is another at the end): you have to count the actions
along with the symbols when working out which number <VAR>n</VAR> to use in
<CODE>$<VAR>n</VAR></CODE>.
<P>
The mid-rule action can also have a semantic value. The action can set
its value with an assignment to <CODE>$$</CODE>, and actions later in the rule
can refer to the value using <CODE>$<VAR>n</VAR></CODE>. Since there is no symbol
to name the action, there is no way to declare a data type for the value
in advance, so you must use the <SAMP>`$<...><VAR>n</VAR>'</SAMP> construct to
specify a data type each time you refer to this value.
<P>
There is no way to set the value of the entire rule with a mid-rule
action, because assignments to <CODE>$$</CODE> do not have that effect. The
only way to set the value for the entire rule is with an ordinary action
at the end of the rule.
<P>
Here is an example from a hypothetical compiler, handling a <CODE>let</CODE>
statement that looks like <SAMP>`let (<VAR>variable</VAR>) <VAR>statement</VAR>'</SAMP> and
serves to create a variable named <VAR>variable</VAR> temporarily for the
duration of <VAR>statement</VAR>. To parse this construct, we must put
<VAR>variable</VAR> into the symbol table while <VAR>statement</VAR> is parsed, then
remove it afterward. Here is how it is done:
<PRE>
stmt: LET '(' var ')'
{ $<context>$ = push_context ();
declare_variable ($3); }
stmt { $$ = $6;
pop_context ($<context>5); }
</PRE>
<P>
As soon as <SAMP>`let (<VAR>variable</VAR>)'</SAMP> has been recognized, the first
action is run. It saves a copy of the current semantic context (the
list of accessible variables) as its semantic value, using alternative
<CODE>context</CODE> in the data-type union. Then it calls
<CODE>declare_variable</CODE> to add the new variable to that list. Once the
first action is finished, the embedded statement <CODE>stmt</CODE> can be
parsed. Note that the mid-rule action is component number 5, so the
<SAMP>`stmt'</SAMP> is component number 6.
<P>
After the embedded statement is parsed, its semantic value becomes the
value of the entire <CODE>let</CODE>-statement. Then the semantic value from the
earlier action is used to restore the prior list of variables. This
removes the temporary <CODE>let</CODE>-variable from the list so that it won't
appear to exist while the rest of the program is parsed.
<P>
Taking action before a rule is completely recognized often leads to
conflicts since the parser must commit to a parse in order to execute the
action. For example, the following two rules, without mid-rule actions,
can coexist in a working parser because the parser can shift the open-brace
token and look at what follows before deciding whether there is a
declaration or not:
<PRE>
compound: '{' declarations statements '}'
| '{' statements '}'
;
</PRE>
<P>
But when we add a mid-rule action as follows, the rules become nonfunctional:
<PRE>
compound: { prepare_for_local_variables (); }
'{' declarations statements '}'
| '{' statements '}'
;
</PRE>
<P>
Now the parser is forced to decide whether to run the mid-rule action
when it has read no farther than the open-brace. In other words, it
must commit to using one rule or the other, without sufficient
information to do it correctly. (The open-brace token is what is called
the <EM>look-ahead</EM> token at this time, since the parser is still
deciding what to do about it. See section <A HREF="bison.html#SEC79">Look-Ahead Tokens</A>.)
<P>
You might think that you could correct the problem by putting identical
actions into the two rules, like this:
<PRE>
compound: { prepare_for_local_variables (); }
'{' declarations statements '}'
| { prepare_for_local_variables (); }
'{' statements '}'
;
</PRE>
<P>
But this does not help, because Bison does not realize that the two actions
are identical. (Bison never tries to understand the C code in an action.)
<P>
If the grammar is such that a declaration can be distinguished from a
statement by the first token (which is true in C), then one solution which
does work is to put the action after the open-brace, like this:
<PRE>
compound: '{' { prepare_for_local_variables (); }
declarations statements '}'
| '{' statements '}'
;
</PRE>
<P>
Now the first token of the following declaration or statement,
which would in any case tell Bison which rule to use, can still do so.
<P>
Another solution is to bury the action inside a nonterminal symbol which
serves as a subroutine:
<PRE>
subroutine: /* empty */
{ prepare_for_local_variables (); }
;
compound: subroutine
'{' declarations statements '}'
| subroutine
'{' statements '}'
;
</PRE>
<P>
Now Bison can execute the action in the rule for <CODE>subroutine</CODE> without
deciding which rule for <CODE>compound</CODE> it will eventually use. Note that
the action is now at the end of its rule. Any mid-rule action can be
converted to an end-of-rule action in this way, and this is what Bison
actually does to implement mid-rule actions.
<H2><A NAME="SEC55" HREF="bison_toc.html#TOC55">Tracking Locations</A></H2>
<P>
<A NAME="IDX109"></A>
<A NAME="IDX110"></A>
<A NAME="IDX111"></A>
<P>
Though grammar rules and semantic actions are enough to write a fully
functional parser, it can be useful to process some additional information,
especially symbol locations.
<P>
The way locations are handled is defined by providing a data type, and
actions to take when rules are matched.
<H3><A NAME="SEC56" HREF="bison_toc.html#TOC56">Data Type of Locations</A></H3>
<P>
<A NAME="IDX112"></A>
<A NAME="IDX113"></A>
<P>
Defining a data type for locations is much simpler than for semantic values,
since all tokens and groupings always use the same type.
<P>
The type of locations is specified by defining a macro called <CODE>YYLTYPE</CODE>.
When <CODE>YYLTYPE</CODE> is not defined, Bison uses a default structure type with
four members:
<PRE>
struct
{
int first_line;
int first_column;
int last_line;
int last_column;
}
</PRE>
<H3><A NAME="SEC57" HREF="bison_toc.html#TOC57">Actions and Locations</A></H3>
<P>
<A NAME="IDX114"></A>
<A NAME="IDX115"></A>
<A NAME="IDX116"></A>
<A NAME="IDX117"></A>
<P>
Actions are not only useful for defining language semantics, but also for
describing the behavior of the output parser with locations.
<P>
The most obvious way for building locations of syntactic groupings is very
similar to the way semantic values are computed. In a given rule, several
constructs can be used to access the locations of the elements being matched.
The location of the <VAR>n</VAR>th component of the right hand side is
<CODE>@<VAR>n</VAR></CODE>, while the location of the left hand side grouping is
<CODE>@$</CODE>.
<P>
Here is a basic example using the default data type for locations:
<PRE>
exp: ...
| exp '/' exp
{
@$.first_column = @1.first_column;
@$.first_line = @1.first_line;
@$.last_column = @3.last_column;
@$.last_line = @3.last_line;
if ($3)
$$ = $1 / $3;
else
{
$$ = 1;
printf("Division by zero, l%d,c%d-l%d,c%d",
@3.first_line, @3.first_column,
@3.last_line, @3.last_column);
}
}
</PRE>
<P>
As for semantic values, there is a default action for locations that is
run each time a rule is matched. It sets the beginning of <CODE>@$</CODE> to the
beginning of the first symbol, and the end of <CODE>@$</CODE> to the end of the
last symbol.
<P>
With this default action, the location tracking can be fully automatic. The
example above simply rewrites this way:
<PRE>
exp: ...
| exp '/' exp
{
if ($3)
$$ = $1 / $3;
else
{
$$ = 1;
printf("Division by zero, l%d,c%d-l%d,c%d",
@3.first_line, @3.first_column,
@3.last_line, @3.last_column);
}
}
</PRE>
<H3><A NAME="SEC58" HREF="bison_toc.html#TOC58">Default Action for Locations</A></H3>
<P>
<A NAME="IDX118"></A>
<P>
Actually, actions are not the best place to compute locations. Since
locations are much more general than semantic values, there is room in
the output parser to redefine the default action to take for each
rule. The <CODE>YYLLOC_DEFAULT</CODE> macro is invoked each time a rule is
matched, before the associated action is run.
<P>
Most of the time, this macro is general enough to suppress location
dedicated code from semantic actions.
<P>
The <CODE>YYLLOC_DEFAULT</CODE> macro takes three parameters. The first one is
the location of the grouping (the result of the computation). The second one
is an array holding locations of all right hand side elements of the rule
being matched. The last one is the size of the right hand side rule.
<P>
By default, it is defined this way for simple LALR(1) parsers:
<PRE>
#define YYLLOC_DEFAULT(Current, Rhs, N) \
Current.first_line = Rhs[1].first_line; \
Current.first_column = Rhs[1].first_column; \
Current.last_line = Rhs[N].last_line; \
Current.last_column = Rhs[N].last_column;
</PRE>
<P>
and like this for GLR parsers:
<PRE>
#define YYLLOC_DEFAULT(Current, Rhs, N) \
Current.first_line = YYRHSLOC(Rhs,1).first_line; \
Current.first_column = YYRHSLOC(Rhs,1).first_column; \
Current.last_line = YYRHSLOC(Rhs,N).last_line; \
Current.last_column = YYRHSLOC(Rhs,N).last_column;
</PRE>
<P>
When defining <CODE>YYLLOC_DEFAULT</CODE>, you should consider that:
<UL>
<LI>
All arguments are free of side-effects. However, only the first one (the
result) should be modified by <CODE>YYLLOC_DEFAULT</CODE>.
<LI>
For consistency with semantic actions, valid indexes for the location
array range from 1 to <VAR>n</VAR>.
</UL>
<H2><A NAME="SEC59" HREF="bison_toc.html#TOC59">Bison Declarations</A></H2>
<P>
<A NAME="IDX119"></A>
<A NAME="IDX120"></A>
<P>
The <EM>Bison declarations</EM> section of a Bison grammar defines the symbols
used in formulating the grammar and the data types of semantic values.
See section <A HREF="bison.html#SEC46">Symbols, Terminal and Nonterminal</A>.
<P>
All token type names (but not single-character literal tokens such as
<CODE>'+'</CODE> and <CODE>'*'</CODE>) must be declared. Nonterminal symbols must be
declared if you need to specify which data type to use for the semantic
value (see section <A HREF="bison.html#SEC51">More Than One Value Type</A>).
<P>
The first rule in the file also specifies the start symbol, by default.
If you want some other symbol to be the start symbol, you must declare
it explicitly (see section <A HREF="bison.html#SEC8">Languages and Context-Free Grammars</A>).
<H3><A NAME="SEC60" HREF="bison_toc.html#TOC60">Token Type Names</A></H3>
<P>
<A NAME="IDX121"></A>
<A NAME="IDX122"></A>
<A NAME="IDX123"></A>
<A NAME="IDX124"></A>
<P>
The basic way to declare a token type name (terminal symbol) is as follows:
<PRE>
%token <VAR>name</VAR>
</PRE>
<P>
Bison will convert this into a <CODE>#define</CODE> directive in
the parser, so that the function <CODE>yylex</CODE> (if it is in this file)
can use the name <VAR>name</VAR> to stand for this token type's code.
<P>
Alternatively, you can use <CODE>%left</CODE>, <CODE>%right</CODE>, or
<CODE>%nonassoc</CODE> instead of <CODE>%token</CODE>, if you wish to specify
associativity and precedence. See section <A HREF="bison.html#SEC61">Operator Precedence</A>.
<P>
You can explicitly specify the numeric code for a token type by appending
an integer value in the field immediately following the token name:
<PRE>
%token NUM 300
</PRE>
<P>
It is generally best, however, to let Bison choose the numeric codes for
all token types. Bison will automatically select codes that don't conflict
with each other or with normal characters.
<P>
In the event that the stack type is a union, you must augment the
<CODE>%token</CODE> or other token declaration to include the data type
alternative delimited by angle-brackets (see section <A HREF="bison.html#SEC51">More Than One Value Type</A>).
<P>
For example:
<PRE>
%union { /* define stack type */
double val;
symrec *tptr;
}
%token <val> NUM /* define token NUM and its type */
</PRE>
<P>
You can associate a literal string token with a token type name by
writing the literal string at the end of a <CODE>%token</CODE>
declaration which declares the name. For example:
<PRE>
%token arrow "=>"
</PRE>
<P>
For example, a grammar for the C language might specify these names with
equivalent literal string tokens:
<PRE>
%token <operator> OR "||"
%token <operator> LE 134 "<="
%left OR "<="
</PRE>
<P>
Once you equate the literal string and the token name, you can use them
interchangeably in further declarations or the grammar rules. The
<CODE>yylex</CODE> function can use the token name or the literal string to
obtain the token type code number (see section <A HREF="bison.html#SEC72">Calling Convention for <CODE>yylex</CODE></A>).
<H3><A NAME="SEC61" HREF="bison_toc.html#TOC61">Operator Precedence</A></H3>
<P>
<A NAME="IDX125"></A>
<A NAME="IDX126"></A>
<A NAME="IDX127"></A>
<P>
Use the <CODE>%left</CODE>, <CODE>%right</CODE> or <CODE>%nonassoc</CODE> declaration to
declare a token and specify its precedence and associativity, all at
once. These are called <EM>precedence declarations</EM>.
See section <A HREF="bison.html#SEC81">Operator Precedence</A>, for general information on
operator precedence.
<P>
The syntax of a precedence declaration is the same as that of
<CODE>%token</CODE>: either
<PRE>
%left <VAR>symbols</VAR>...
</PRE>
<P>
or
<PRE>
%left <<VAR>type</VAR>> <VAR>symbols</VAR>...
</PRE>
<P>
And indeed any of these declarations serves the purposes of <CODE>%token</CODE>.
But in addition, they specify the associativity and relative precedence for
all the <VAR>symbols</VAR>:
<UL>
<LI>
The associativity of an operator <VAR>op</VAR> determines how repeated uses
of the operator nest: whether <SAMP>`<VAR>x</VAR> <VAR>op</VAR> <VAR>y</VAR> <VAR>op</VAR>
<VAR>z</VAR>'</SAMP> is parsed by grouping <VAR>x</VAR> with <VAR>y</VAR> first or by
grouping <VAR>y</VAR> with <VAR>z</VAR> first. <CODE>%left</CODE> specifies
left-associativity (grouping <VAR>x</VAR> with <VAR>y</VAR> first) and
<CODE>%right</CODE> specifies right-associativity (grouping <VAR>y</VAR> with
<VAR>z</VAR> first). <CODE>%nonassoc</CODE> specifies no associativity, which
means that <SAMP>`<VAR>x</VAR> <VAR>op</VAR> <VAR>y</VAR> <VAR>op</VAR> <VAR>z</VAR>'</SAMP> is
considered a syntax error.
<LI>
The precedence of an operator determines how it nests with other operators.
All the tokens declared in a single precedence declaration have equal
precedence and nest together according to their associativity.
When two tokens declared in different precedence declarations associate,
the one declared later has the higher precedence and is grouped first.
</UL>
<H3><A NAME="SEC62" HREF="bison_toc.html#TOC62">The Collection of Value Types</A></H3>
<P>
<A NAME="IDX128"></A>
<A NAME="IDX129"></A>
<A NAME="IDX130"></A>
<P>
The <CODE>%union</CODE> declaration specifies the entire collection of possible
data types for semantic values. The keyword <CODE>%union</CODE> is followed by a
pair of braces containing the same thing that goes inside a <CODE>union</CODE> in
C.
<P>
For example:
<PRE>
%union {
double val;
symrec *tptr;
}
</PRE>
<P>
This says that the two alternative types are <CODE>double</CODE> and <CODE>symrec
*</CODE>. They are given names <CODE>val</CODE> and <CODE>tptr</CODE>; these names are used
in the <CODE>%token</CODE> and <CODE>%type</CODE> declarations to pick one of the types
for a terminal or nonterminal symbol (see section <A HREF="bison.html#SEC63">Nonterminal Symbols</A>).
<P>
Note that, unlike making a <CODE>union</CODE> declaration in C, you do not write
a semicolon after the closing brace.
<H3><A NAME="SEC63" HREF="bison_toc.html#TOC63">Nonterminal Symbols</A></H3>
<P>
<A NAME="IDX131"></A>
<A NAME="IDX132"></A>
<A NAME="IDX133"></A>
<P>
When you use <CODE>%union</CODE> to specify multiple value types, you must
declare the value type of each nonterminal symbol for which values are
used. This is done with a <CODE>%type</CODE> declaration, like this:
<PRE>
%type <<VAR>type</VAR>> <VAR>nonterminal</VAR>...
</PRE>
<P>
Here <VAR>nonterminal</VAR> is the name of a nonterminal symbol, and
<VAR>type</VAR> is the name given in the <CODE>%union</CODE> to the alternative
that you want (see section <A HREF="bison.html#SEC62">The Collection of Value Types</A>). You
can give any number of nonterminal symbols in the same <CODE>%type</CODE>
declaration, if they have the same value type. Use spaces to separate
the symbol names.
<P>
You can also declare the value type of a terminal symbol. To do this,
use the same <CODE><<VAR>type</VAR>></CODE> construction in a declaration for the
terminal symbol. All kinds of token declarations allow
<CODE><<VAR>type</VAR>></CODE>.
<H3><A NAME="SEC64" HREF="bison_toc.html#TOC64">Suppressing Conflict Warnings</A></H3>
<P>
<A NAME="IDX134"></A>
<A NAME="IDX135"></A>
<A NAME="IDX136"></A>
<A NAME="IDX137"></A>
<A NAME="IDX138"></A>
<P>
Bison normally warns if there are any conflicts in the grammar
(see section <A HREF="bison.html#SEC80">Shift/Reduce Conflicts</A>), but most real grammars
have harmless shift/reduce conflicts which are resolved in a predictable
way and would be difficult to eliminate. It is desirable to suppress
the warning about these conflicts unless the number of conflicts
changes. You can do this with the <CODE>%expect</CODE> declaration.
<P>
The declaration looks like this:
<PRE>
%expect <VAR>n</VAR>
</PRE>
<P>
Here <VAR>n</VAR> is a decimal integer. The declaration says there should be
no warning if there are <VAR>n</VAR> shift/reduce conflicts and no
reduce/reduce conflicts. An error, instead of the usual warning, is
given if there are either more or fewer conflicts, or if there are any
reduce/reduce conflicts.
<P>
In general, using <CODE>%expect</CODE> involves these steps:
<UL>
<LI>
Compile your grammar without <CODE>%expect</CODE>. Use the <SAMP>`-v'</SAMP> option
to get a verbose list of where the conflicts occur. Bison will also
print the number of conflicts.
<LI>
Check each of the conflicts to make sure that Bison's default
resolution is what you really want. If not, rewrite the grammar and
go back to the beginning.
<LI>
Add an <CODE>%expect</CODE> declaration, copying the number <VAR>n</VAR> from the
number which Bison printed.
</UL>
<P>
Now Bison will stop annoying you about the conflicts you have checked, but
it will warn you again if changes in the grammar result in additional
conflicts.
<H3><A NAME="SEC65" HREF="bison_toc.html#TOC65">The Start-Symbol</A></H3>
<P>
<A NAME="IDX139"></A>
<A NAME="IDX140"></A>
<A NAME="IDX141"></A>
<A NAME="IDX142"></A>
<P>
Bison assumes by default that the start symbol for the grammar is the first
nonterminal specified in the grammar specification section. The programmer
may override this restriction with the <CODE>%start</CODE> declaration as follows:
<PRE>
%start <VAR>symbol</VAR>
</PRE>
<H3><A NAME="SEC66" HREF="bison_toc.html#TOC66">A Pure (Reentrant) Parser</A></H3>
<P>
<A NAME="IDX143"></A>
<A NAME="IDX144"></A>
<A NAME="IDX145"></A>
<P>
A <EM>reentrant</EM> program is one which does not alter in the course of
execution; in other words, it consists entirely of <EM>pure</EM> (read-only)
code. Reentrancy is important whenever asynchronous execution is possible;
for example, a non-reentrant program may not be safe to call from a signal
handler. In systems with multiple threads of control, a non-reentrant
program must be called only within interlocks.
<P>
Normally, Bison generates a parser which is not reentrant. This is
suitable for most uses, and it permits compatibility with YACC. (The
standard YACC interfaces are inherently nonreentrant, because they use
statically allocated variables for communication with <CODE>yylex</CODE>,
including <CODE>yylval</CODE> and <CODE>yylloc</CODE>.)
<P>
Alternatively, you can generate a pure, reentrant parser. The Bison
declaration <CODE>%pure-parser</CODE> says that you want the parser to be
reentrant. It looks like this:
<PRE>
%pure-parser
</PRE>
<P>
The result is that the communication variables <CODE>yylval</CODE> and
<CODE>yylloc</CODE> become local variables in <CODE>yyparse</CODE>, and a different
calling convention is used for the lexical analyzer function
<CODE>yylex</CODE>. See section <A HREF="bison.html#SEC75">Calling Conventions for Pure Parsers</A>, for the details of this. The variable <CODE>yynerrs</CODE> also
becomes local in <CODE>yyparse</CODE> (see section <A HREF="bison.html#SEC76">The Error Reporting Function <CODE>yyerror</CODE></A>). The convention for calling
<CODE>yyparse</CODE> itself is unchanged.
<P>
Whether the parser is pure has nothing to do with the grammar rules.
You can generate either a pure parser or a nonreentrant parser from any
valid grammar.
<H3><A NAME="SEC67" HREF="bison_toc.html#TOC67">Bison Declaration Summary</A></H3>
<P>
<A NAME="IDX146"></A>
<A NAME="IDX147"></A>
<A NAME="IDX148"></A>
<P>
Here is a summary of the declarations used to define a grammar:
<DL COMPACT>
<DT><CODE>%union</CODE>
<DD>
Declare the collection of data types that semantic values may have
(see section <A HREF="bison.html#SEC62">The Collection of Value Types</A>).
<DT><CODE>%token</CODE>
<DD>
Declare a terminal symbol (token type name) with no precedence
or associativity specified (see section <A HREF="bison.html#SEC60">Token Type Names</A>).
<DT><CODE>%right</CODE>
<DD>
Declare a terminal symbol (token type name) that is right-associative
(see section <A HREF="bison.html#SEC61">Operator Precedence</A>).
<DT><CODE>%left</CODE>
<DD>
Declare a terminal symbol (token type name) that is left-associative
(see section <A HREF="bison.html#SEC61">Operator Precedence</A>).
<DT><CODE>%nonassoc</CODE>
<DD>
Declare a terminal symbol (token type name) that is nonassociative
(using it in a way that would be associative is a syntax error)
(see section <A HREF="bison.html#SEC61">Operator Precedence</A>).
<DT><CODE>%type</CODE>
<DD>
Declare the type of semantic values for a nonterminal symbol
(see section <A HREF="bison.html#SEC63">Nonterminal Symbols</A>).
<DT><CODE>%start</CODE>
<DD>
Specify the grammar's start symbol (see section <A HREF="bison.html#SEC65">The Start-Symbol</A>).
<DT><CODE>%expect</CODE>
<DD>
Declare the expected number of shift-reduce conflicts
(see section <A HREF="bison.html#SEC64">Suppressing Conflict Warnings</A>).
</DL>
<P>
In order to change the behavior of @command{bison}, use the following
directives:
<DL COMPACT>
<DT><CODE>%debug</CODE>
<DD>
In the parser file, define the macro <CODE>YYDEBUG</CODE> to 1 if it is not
already defined, so that the debugging facilities are compiled.
See section <A HREF="bison.html#SEC99">Tracing Your Parser</A>.
<DT><CODE>%defines</CODE>
<DD>
Write an extra output file containing macro definitions for the token
type names defined in the grammar and the semantic value type
<CODE>YYSTYPE</CODE>, as well as a few <CODE>extern</CODE> variable declarations.
If the parser output file is named <TT>`<VAR>name</VAR>.c'</TT> then this file
is named <TT>`<VAR>name</VAR>.h'</TT>.
This output file is essential if you wish to put the definition of
<CODE>yylex</CODE> in a separate source file, because <CODE>yylex</CODE> needs to
be able to refer to token type codes and the variable
<CODE>yylval</CODE>. See section <A HREF="bison.html#SEC73">Semantic Values of Tokens</A>.
<DT><CODE>%file-prefix="<VAR>prefix</VAR>"</CODE>
<DD>
Specify a prefix to use for all Bison output file names. The names are
chosen as if the input file were named <TT>`<VAR>prefix</VAR>.y'</TT>.
<DT><CODE>%locations</CODE>
<DD>
Generate the code processing the locations (see section <A HREF="bison.html#SEC77">Special Features for Use in Actions</A>). This mode is enabled as soon as
the grammar uses the special <SAMP>`@<VAR>n</VAR>'</SAMP> tokens, but if your
grammar does not use it, using <SAMP>`%locations'</SAMP> allows for more
accurate parse error messages.
<DT><CODE>%name-prefix="<VAR>prefix</VAR>"</CODE>
<DD>
Rename the external symbols used in the parser so that they start with
<VAR>prefix</VAR> instead of <SAMP>`yy'</SAMP>. The precise list of symbols renamed
is <CODE>yyparse</CODE>, <CODE>yylex</CODE>, <CODE>yyerror</CODE>, <CODE>yynerrs</CODE>,
<CODE>yylval</CODE>, <CODE>yychar</CODE>, <CODE>yydebug</CODE>, and possible
<CODE>yylloc</CODE>. For example, if you use <SAMP>`%name-prefix="c_"'</SAMP>, the
names become <CODE>c_parse</CODE>, <CODE>c_lex</CODE>, and so on. See section <A HREF="bison.html#SEC68">Multiple Parsers in the Same Program</A>.
<DT><CODE>%no-parser</CODE>
<DD>
Do not include any C code in the parser file; generate tables only. The
parser file contains just <CODE>#define</CODE> directives and static variable
declarations.
This option also tells Bison to write the C code for the grammar actions
into a file named <TT>`<VAR>filename</VAR>.act'</TT>, in the form of a
brace-surrounded body fit for a <CODE>switch</CODE> statement.
<DT><CODE>%no-lines</CODE>
<DD>
Don't generate any <CODE>#line</CODE> preprocessor commands in the parser
file. Ordinarily Bison writes these commands in the parser file so that
the C compiler and debuggers will associate errors and object code with
your source file (the grammar file). This directive causes them to
associate errors with the parser file, treating it an independent source
file in its own right.
<DT><CODE>%output="<VAR>filename</VAR>"</CODE>
<DD>
Specify the <VAR>filename</VAR> for the parser file.
<DT><CODE>%pure-parser</CODE>
<DD>
Request a pure (reentrant) parser program (see section <A HREF="bison.html#SEC66">A Pure (Reentrant) Parser</A>).
<DT><CODE>%token-table</CODE>
<DD>
Generate an array of token names in the parser file. The name of the
array is <CODE>yytname</CODE>; <CODE>yytname[<VAR>i</VAR>]</CODE> is the name of the
token whose internal Bison token code number is <VAR>i</VAR>. The first
three elements of <CODE>yytname</CODE> are always <CODE>"$end"</CODE>,
<CODE>"error"</CODE>, and <CODE>"$undefined"</CODE>; after these come the symbols
defined in the grammar file.
For single-character literal tokens and literal string tokens, the name
in the table includes the single-quote or double-quote characters: for
example, <CODE>"'+'"</CODE> is a single-character literal and <CODE>"\"<=\""</CODE>
is a literal string token. All the characters of the literal string
token appear verbatim in the string found in the table; even
double-quote characters are not escaped. For example, if the token
consists of three characters <SAMP>`*"*'</SAMP>, its string in <CODE>yytname</CODE>
contains <SAMP>`"*"*"'</SAMP>. (In C, that would be written as
<CODE>"\"*\"*\""</CODE>).
When you specify <CODE>%token-table</CODE>, Bison also generates macro
definitions for macros <CODE>YYNTOKENS</CODE>, <CODE>YYNNTS</CODE>, and
<CODE>YYNRULES</CODE>, and <CODE>YYNSTATES</CODE>:
<DL COMPACT>
<DT><CODE>YYNTOKENS</CODE>
<DD>
The highest token number, plus one.
<DT><CODE>YYNNTS</CODE>
<DD>
The number of nonterminal symbols.
<DT><CODE>YYNRULES</CODE>
<DD>
The number of grammar rules,
<DT><CODE>YYNSTATES</CODE>
<DD>
The number of parser states (see section <A HREF="bison.html#SEC87">Parser States</A>).
</DL>
<DT><CODE>%verbose</CODE>
<DD>
Write an extra output file containing verbose descriptions of the
parser states and what is done for each type of look-ahead token in
that state. See section <A HREF="bison.html#SEC98">Understanding Your Parser</A>, for more
information.
<DT><CODE>%yacc</CODE>
<DD>
Pretend the option @option{--yacc} was given, i.e., imitate Yacc,
including its naming conventions. See section <A HREF="bison.html#SEC101">Bison Options</A>, for more.
</DL>
<H2><A NAME="SEC68" HREF="bison_toc.html#TOC68">Multiple Parsers in the Same Program</A></H2>
<P>
Most programs that use Bison parse only one language and therefore contain
only one Bison parser. But what if you want to parse more than one
language with the same program? Then you need to avoid a name conflict
between different definitions of <CODE>yyparse</CODE>, <CODE>yylval</CODE>, and so on.
<P>
The easy way to do this is to use the option <SAMP>`-p <VAR>prefix</VAR>'</SAMP>
(see section <A HREF="bison.html#SEC100">Invoking Bison</A>). This renames the interface
functions and variables of the Bison parser to start with <VAR>prefix</VAR>
instead of <SAMP>`yy'</SAMP>. You can use this to give each parser distinct
names that do not conflict.
<P>
The precise list of symbols renamed is <CODE>yyparse</CODE>, <CODE>yylex</CODE>,
<CODE>yyerror</CODE>, <CODE>yynerrs</CODE>, <CODE>yylval</CODE>, <CODE>yychar</CODE> and
<CODE>yydebug</CODE>. For example, if you use <SAMP>`-p c'</SAMP>, the names become
<CODE>cparse</CODE>, <CODE>clex</CODE>, and so on.
<P>
<STRONG>All the other variables and macros associated with Bison are not
renamed.</STRONG> These others are not global; there is no conflict if the same
name is used in different parsers. For example, <CODE>YYSTYPE</CODE> is not
renamed, but defining this in different ways in different parsers causes
no trouble (see section <A HREF="bison.html#SEC50">Data Types of Semantic Values</A>).
<P>
The <SAMP>`-p'</SAMP> option works by adding macro definitions to the beginning
of the parser source file, defining <CODE>yyparse</CODE> as
<CODE><VAR>prefix</VAR>parse</CODE>, and so on. This effectively substitutes one
name for the other in the entire parser file.
<H1><A NAME="SEC69" HREF="bison_toc.html#TOC69">Parser C-Language Interface</A></H1>
<P>
<A NAME="IDX149"></A>
<A NAME="IDX150"></A>
<P>
The Bison parser is actually a C function named <CODE>yyparse</CODE>. Here we
describe the interface conventions of <CODE>yyparse</CODE> and the other
functions that it needs to use.
<P>
Keep in mind that the parser uses many C identifiers starting with
<SAMP>`yy'</SAMP> and <SAMP>`YY'</SAMP> for internal purposes. If you use such an
identifier (aside from those in this manual) in an action or in epilogue
in the grammar file, you are likely to run into trouble.
<H2><A NAME="SEC70" HREF="bison_toc.html#TOC70">The Parser Function <CODE>yyparse</CODE></A></H2>
<P>
<A NAME="IDX151"></A>
<P>
You call the function <CODE>yyparse</CODE> to cause parsing to occur. This
function reads tokens, executes actions, and ultimately returns when it
encounters end-of-input or an unrecoverable syntax error. You can also
write an action which directs <CODE>yyparse</CODE> to return immediately
without reading further.
<P>
The value returned by <CODE>yyparse</CODE> is 0 if parsing was successful (return
is due to end-of-input).
<P>
The value is 1 if parsing failed (return is due to a syntax error).
<P>
In an action, you can cause immediate return from <CODE>yyparse</CODE> by using
these macros:
<DL COMPACT>
<DT><CODE>YYACCEPT</CODE>
<DD>
<A NAME="IDX152"></A>
Return immediately with value 0 (to report success).
<DT><CODE>YYABORT</CODE>
<DD>
<A NAME="IDX153"></A>
Return immediately with value 1 (to report failure).
</DL>
<H2><A NAME="SEC71" HREF="bison_toc.html#TOC71">The Lexical Analyzer Function <CODE>yylex</CODE></A></H2>
<P>
<A NAME="IDX154"></A>
<A NAME="IDX155"></A>
<P>
The <EM>lexical analyzer</EM> function, <CODE>yylex</CODE>, recognizes tokens from
the input stream and returns them to the parser. Bison does not create
this function automatically; you must write it so that <CODE>yyparse</CODE> can
call it. The function is sometimes referred to as a lexical scanner.
<P>
In simple programs, <CODE>yylex</CODE> is often defined at the end of the Bison
grammar file. If <CODE>yylex</CODE> is defined in a separate source file, you
need to arrange for the token-type macro definitions to be available there.
To do this, use the <SAMP>`-d'</SAMP> option when you run Bison, so that it will
write these macro definitions into a separate header file
<TT>`<VAR>name</VAR>.tab.h'</TT> which you can include in the other source files
that need it. See section <A HREF="bison.html#SEC100">Invoking Bison</A>.
<H3><A NAME="SEC72" HREF="bison_toc.html#TOC72">Calling Convention for <CODE>yylex</CODE></A></H3>
<P>
The value that <CODE>yylex</CODE> returns must be the positive numeric code
for the type of token it has just found; a zero or negative value
signifies end-of-input.
<P>
When a token is referred to in the grammar rules by a name, that name
in the parser file becomes a C macro whose definition is the proper
numeric code for that token type. So <CODE>yylex</CODE> can use the name
to indicate that type. See section <A HREF="bison.html#SEC46">Symbols, Terminal and Nonterminal</A>.
<P>
When a token is referred to in the grammar rules by a character literal,
the numeric code for that character is also the code for the token type.
So <CODE>yylex</CODE> can simply return that character code, possibly converted
to <CODE>unsigned char</CODE> to avoid sign-extension. The null character
must not be used this way, because its code is zero and that
signifies end-of-input.
<P>
Here is an example showing these things:
<PRE>
int
yylex (void)
{
...
if (c == EOF) /* Detect end-of-input. */
return 0;
...
if (c == '+' || c == '-')
return c; /* Assume token type for `+' is '+'. */
...
return INT; /* Return the type of the token. */
...
}
</PRE>
<P>
This interface has been designed so that the output from the <CODE>lex</CODE>
utility can be used without change as the definition of <CODE>yylex</CODE>.
<P>
If the grammar uses literal string tokens, there are two ways that
<CODE>yylex</CODE> can determine the token type codes for them:
<UL>
<LI>
If the grammar defines symbolic token names as aliases for the
literal string tokens, <CODE>yylex</CODE> can use these symbolic names like
all others. In this case, the use of the literal string tokens in
the grammar file has no effect on <CODE>yylex</CODE>.
<LI>
<CODE>yylex</CODE> can find the multicharacter token in the <CODE>yytname</CODE>
table. The index of the token in the table is the token type's code.
The name of a multicharacter token is recorded in <CODE>yytname</CODE> with a
double-quote, the token's characters, and another double-quote. The
token's characters are not escaped in any way; they appear verbatim in
the contents of the string in the table.
Here's code for looking up a token in <CODE>yytname</CODE>, assuming that the
characters of the token are stored in <CODE>token_buffer</CODE>.
<PRE>
for (i = 0; i < YYNTOKENS; i++)
{
if (yytname[i] != 0
&& yytname[i][0] == '"'
&& ! strncmp (yytname[i] + 1, token_buffer,
strlen (token_buffer))
&& yytname[i][strlen (token_buffer) + 1] == '"'
&& yytname[i][strlen (token_buffer) + 2] == 0)
break;
}
</PRE>
The <CODE>yytname</CODE> table is generated only if you use the
<CODE>%token-table</CODE> declaration. See section <A HREF="bison.html#SEC67">Bison Declaration Summary</A>.
</UL>
<H3><A NAME="SEC73" HREF="bison_toc.html#TOC73">Semantic Values of Tokens</A></H3>
<P>
<A NAME="IDX156"></A>
In an ordinary (non-reentrant) parser, the semantic value of the token must
be stored into the global variable <CODE>yylval</CODE>. When you are using
just one data type for semantic values, <CODE>yylval</CODE> has that type.
Thus, if the type is <CODE>int</CODE> (the default), you might write this in
<CODE>yylex</CODE>:
<PRE>
...
yylval = value; /* Put value onto Bison stack. */
return INT; /* Return the type of the token. */
...
</PRE>
<P>
When you are using multiple data types, <CODE>yylval</CODE>'s type is a union
made from the <CODE>%union</CODE> declaration (see section <A HREF="bison.html#SEC62">The Collection of Value Types</A>). So when you store a token's value, you
must use the proper member of the union. If the <CODE>%union</CODE>
declaration looks like this:
<PRE>
%union {
int intval;
double val;
symrec *tptr;
}
</PRE>
<P>
then the code in <CODE>yylex</CODE> might look like this:
<PRE>
...
yylval.intval = value; /* Put value onto Bison stack. */
return INT; /* Return the type of the token. */
...
</PRE>
<H3><A NAME="SEC74" HREF="bison_toc.html#TOC74">Textual Positions of Tokens</A></H3>
<P>
<A NAME="IDX157"></A>
If you are using the <SAMP>`@<VAR>n</VAR>'</SAMP>-feature (see section <A HREF="bison.html#SEC55">Tracking Locations</A>) in actions to keep track of the
textual locations of tokens and groupings, then you must provide this
information in <CODE>yylex</CODE>. The function <CODE>yyparse</CODE> expects to
find the textual location of a token just parsed in the global variable
<CODE>yylloc</CODE>. So <CODE>yylex</CODE> must store the proper data in that
variable.
<P>
By default, the value of <CODE>yylloc</CODE> is a structure and you need only
initialize the members that are going to be used by the actions. The
four members are called <CODE>first_line</CODE>, <CODE>first_column</CODE>,
<CODE>last_line</CODE> and <CODE>last_column</CODE>. Note that the use of this
feature makes the parser noticeably slower.
<P>
<A NAME="IDX158"></A>
The data type of <CODE>yylloc</CODE> has the name <CODE>YYLTYPE</CODE>.
<H3><A NAME="SEC75" HREF="bison_toc.html#TOC75">Calling Conventions for Pure Parsers</A></H3>
<P>
When you use the Bison declaration <CODE>%pure-parser</CODE> to request a
pure, reentrant parser, the global communication variables <CODE>yylval</CODE>
and <CODE>yylloc</CODE> cannot be used. (See section <A HREF="bison.html#SEC66">A Pure (Reentrant) Parser</A>.) In such parsers the two global variables are replaced by
pointers passed as arguments to <CODE>yylex</CODE>. You must declare them as
shown here, and pass the information back by storing it through those
pointers.
<PRE>
int
yylex (YYSTYPE *lvalp, YYLTYPE *llocp)
{
...
*lvalp = value; /* Put value onto Bison stack. */
return INT; /* Return the type of the token. */
...
}
</PRE>
<P>
If the grammar file does not use the <SAMP>`@'</SAMP> constructs to refer to
textual positions, then the type <CODE>YYLTYPE</CODE> will not be defined. In
this case, omit the second argument; <CODE>yylex</CODE> will be called with
only one argument.
<P>
<A NAME="IDX159"></A>
If you use a reentrant parser, you can optionally pass additional
parameter information to it in a reentrant way. To do so, define the
macro <CODE>YYPARSE_PARAM</CODE> as a variable name. This modifies the
<CODE>yyparse</CODE> function to accept one argument, of type <CODE>void *</CODE>,
with that name.
<P>
When you call <CODE>yyparse</CODE>, pass the address of an object, casting the
address to <CODE>void *</CODE>. The grammar actions can refer to the contents
of the object by casting the pointer value back to its proper type and
then dereferencing it. Here's an example. Write this in the parser:
<PRE>
%{
struct parser_control
{
int nastiness;
int randomness;
};
#define YYPARSE_PARAM parm
%}
</PRE>
<P>
Then call the parser like this:
<PRE>
struct parser_control
{
int nastiness;
int randomness;
};
...
{
struct parser_control foo;
... /* Store proper data in <CODE>foo</CODE>. */
value = yyparse ((void *) &foo);
...
}
</PRE>
<P>
In the grammar actions, use expressions like this to refer to the data:
<PRE>
((struct parser_control *) parm)->randomness
</PRE>
<P>
<A NAME="IDX160"></A>
If you wish to pass the additional parameter data to <CODE>yylex</CODE>,
define the macro <CODE>YYLEX_PARAM</CODE> just like <CODE>YYPARSE_PARAM</CODE>, as
shown here:
<PRE>
%{
struct parser_control
{
int nastiness;
int randomness;
};
#define YYPARSE_PARAM parm
#define YYLEX_PARAM parm
%}
</PRE>
<P>
You should then define <CODE>yylex</CODE> to accept one additional
argument--the value of <CODE>parm</CODE>. (This makes either two or three
arguments in total, depending on whether an argument of type
<CODE>YYLTYPE</CODE> is passed.) You can declare the argument as a pointer to
the proper object type, or you can declare it as <CODE>void *</CODE> and
access the contents as shown above.
<P>
You can use <SAMP>`%pure-parser'</SAMP> to request a reentrant parser without
also using <CODE>YYPARSE_PARAM</CODE>. Then you should call <CODE>yyparse</CODE>
with no arguments, as usual.
<H2><A NAME="SEC76" HREF="bison_toc.html#TOC76">The Error Reporting Function <CODE>yyerror</CODE></A></H2>
<P>
<A NAME="IDX161"></A>
<A NAME="IDX162"></A>
<A NAME="IDX163"></A>
<A NAME="IDX164"></A>
<P>
The Bison parser detects a <EM>parse error</EM> or <EM>syntax error</EM>
whenever it reads a token which cannot satisfy any syntax rule. An
action in the grammar can also explicitly proclaim an error, using the
macro <CODE>YYERROR</CODE> (see section <A HREF="bison.html#SEC77">Special Features for Use in Actions</A>).
<P>
The Bison parser expects to report the error by calling an error
reporting function named <CODE>yyerror</CODE>, which you must supply. It is
called by <CODE>yyparse</CODE> whenever a syntax error is found, and it
receives one argument. For a parse error, the string is normally
<CODE>"parse error"</CODE>.
<P>
<A NAME="IDX165"></A>
If you define the macro <CODE>YYERROR_VERBOSE</CODE> in the Bison declarations
section (see section <A HREF="bison.html#SEC43">The Bison Declarations Section</A>),
then Bison provides a more verbose and specific error message string
instead of just plain <CODE>"parse error"</CODE>. It doesn't matter what
definition you use for <CODE>YYERROR_VERBOSE</CODE>, just whether you define
it.
<P>
The parser can detect one other kind of error: stack overflow. This
happens when the input contains constructions that are very deeply
nested. It isn't likely you will encounter this, since the Bison
parser extends its stack automatically up to a very large limit. But
if overflow happens, <CODE>yyparse</CODE> calls <CODE>yyerror</CODE> in the usual
fashion, except that the argument string is <CODE>"parser stack
overflow"</CODE>.
<P>
The following definition suffices in simple programs:
<PRE>
void
yyerror (char *s)
{
fprintf (stderr, "%s\n", s);
}
</PRE>
<P>
After <CODE>yyerror</CODE> returns to <CODE>yyparse</CODE>, the latter will attempt
error recovery if you have written suitable error recovery grammar rules
(see section <A HREF="bison.html#SEC92">Error Recovery</A>). If recovery is impossible, <CODE>yyparse</CODE> will
immediately return 1.
<P>
<A NAME="IDX166"></A>
The variable <CODE>yynerrs</CODE> contains the number of syntax errors
encountered so far. Normally this variable is global; but if you
request a pure parser (see section <A HREF="bison.html#SEC66">A Pure (Reentrant) Parser</A>)
then it is a local variable which only the actions can access.
<H2><A NAME="SEC77" HREF="bison_toc.html#TOC77">Special Features for Use in Actions</A></H2>
<P>
<A NAME="IDX167"></A>
<A NAME="IDX168"></A>
<P>
Here is a table of Bison constructs, variables and macros that
are useful in actions.
<DL COMPACT>
<DT><SAMP>`$$'</SAMP>
<DD>
Acts like a variable that contains the semantic value for the
grouping made by the current rule. See section <A HREF="bison.html#SEC52">Actions</A>.
<DT><SAMP>`$<VAR>n</VAR>'</SAMP>
<DD>
Acts like a variable that contains the semantic value for the
<VAR>n</VAR>th component of the current rule. See section <A HREF="bison.html#SEC52">Actions</A>.
<DT><SAMP>`$<<VAR>typealt</VAR>>$'</SAMP>
<DD>
Like <CODE>$$</CODE> but specifies alternative <VAR>typealt</VAR> in the union
specified by the <CODE>%union</CODE> declaration. See section <A HREF="bison.html#SEC53">Data Types of Values in Actions</A>.
<DT><SAMP>`$<<VAR>typealt</VAR>><VAR>n</VAR>'</SAMP>
<DD>
Like <CODE>$<VAR>n</VAR></CODE> but specifies alternative <VAR>typealt</VAR> in the
union specified by the <CODE>%union</CODE> declaration.
See section <A HREF="bison.html#SEC53">Data Types of Values in Actions</A>.
<DT><SAMP>`YYABORT;'</SAMP>
<DD>
Return immediately from <CODE>yyparse</CODE>, indicating failure.
See section <A HREF="bison.html#SEC70">The Parser Function <CODE>yyparse</CODE></A>.
<DT><SAMP>`YYACCEPT;'</SAMP>
<DD>
Return immediately from <CODE>yyparse</CODE>, indicating success.
See section <A HREF="bison.html#SEC70">The Parser Function <CODE>yyparse</CODE></A>.
<DT><SAMP>`YYBACKUP (<VAR>token</VAR>, <VAR>value</VAR>);'</SAMP>
<DD>
<A NAME="IDX169"></A>
Unshift a token. This macro is allowed only for rules that reduce
a single value, and only when there is no look-ahead token.
It is also disallowed in GLR parsers.
It installs a look-ahead token with token type <VAR>token</VAR> and
semantic value <VAR>value</VAR>; then it discards the value that was
going to be reduced by this rule.
If the macro is used when it is not valid, such as when there is
a look-ahead token already, then it reports a syntax error with
a message <SAMP>`cannot back up'</SAMP> and performs ordinary error
recovery.
In either case, the rest of the action is not executed.
<DT><SAMP>`YYEMPTY'</SAMP>
<DD>
<A NAME="IDX170"></A>
Value stored in <CODE>yychar</CODE> when there is no look-ahead token.
<DT><SAMP>`YYERROR;'</SAMP>
<DD>
<A NAME="IDX171"></A>
Cause an immediate syntax error. This statement initiates error
recovery just as if the parser itself had detected an error; however, it
does not call <CODE>yyerror</CODE>, and does not print any message. If you
want to print an error message, call <CODE>yyerror</CODE> explicitly before
the <SAMP>`YYERROR;'</SAMP> statement. See section <A HREF="bison.html#SEC92">Error Recovery</A>.
<DT><SAMP>`YYRECOVERING'</SAMP>
<DD>
This macro stands for an expression that has the value 1 when the parser
is recovering from a syntax error, and 0 the rest of the time.
See section <A HREF="bison.html#SEC92">Error Recovery</A>.
<DT><SAMP>`yychar'</SAMP>
<DD>
Variable containing the current look-ahead token. (In a pure parser,
this is actually a local variable within <CODE>yyparse</CODE>.) When there is
no look-ahead token, the value <CODE>YYEMPTY</CODE> is stored in the variable.
See section <A HREF="bison.html#SEC79">Look-Ahead Tokens</A>.
<DT><SAMP>`yyclearin;'</SAMP>
<DD>
Discard the current look-ahead token. This is useful primarily in
error rules. See section <A HREF="bison.html#SEC92">Error Recovery</A>.
<DT><SAMP>`yyerrok;'</SAMP>
<DD>
Resume generating error messages immediately for subsequent syntax
errors. This is useful primarily in error rules.
See section <A HREF="bison.html#SEC92">Error Recovery</A>.
<DT><SAMP>`@$'</SAMP>
<DD>
<A NAME="IDX172"></A>
Acts like a structure variable containing information on the textual position
of the grouping made by the current rule. See section <A HREF="bison.html#SEC55">Tracking Locations</A>.
<DT><SAMP>`@<VAR>n</VAR>'</SAMP>
<DD>
<A NAME="IDX173"></A>
Acts like a structure variable containing information on the textual position
of the <VAR>n</VAR>th component of the current rule. See section <A HREF="bison.html#SEC55">Tracking Locations</A>.
</DL>
<H1><A NAME="SEC78" HREF="bison_toc.html#TOC78">The Bison Parser Algorithm</A></H1>
<P>
<A NAME="IDX174"></A>
<A NAME="IDX175"></A>
<A NAME="IDX176"></A>
<A NAME="IDX177"></A>
<A NAME="IDX178"></A>
<A NAME="IDX179"></A>
<P>
As Bison reads tokens, it pushes them onto a stack along with their
semantic values. The stack is called the <EM>parser stack</EM>. Pushing a
token is traditionally called <EM>shifting</EM>.
<P>
For example, suppose the infix calculator has read <SAMP>`1 + 5 *'</SAMP>, with a
<SAMP>`3'</SAMP> to come. The stack will have four elements, one for each token
that was shifted.
<P>
But the stack does not always have an element for each token read. When
the last <VAR>n</VAR> tokens and groupings shifted match the components of a
grammar rule, they can be combined according to that rule. This is called
<EM>reduction</EM>. Those tokens and groupings are replaced on the stack by a
single grouping whose symbol is the result (left hand side) of that rule.
Running the rule's action is part of the process of reduction, because this
is what computes the semantic value of the resulting grouping.
<P>
For example, if the infix calculator's parser stack contains this:
<PRE>
1 + 5 * 3
</PRE>
<P>
and the next input token is a newline character, then the last three
elements can be reduced to 15 via the rule:
<PRE>
expr: expr '*' expr;
</PRE>
<P>
Then the stack contains just these three elements:
<PRE>
1 + 15
</PRE>
<P>
At this point, another reduction can be made, resulting in the single value
16. Then the newline token can be shifted.
<P>
The parser tries, by shifts and reductions, to reduce the entire input down
to a single grouping whose symbol is the grammar's start-symbol
(see section <A HREF="bison.html#SEC8">Languages and Context-Free Grammars</A>).
<P>
This kind of parser is known in the literature as a bottom-up parser.
<H2><A NAME="SEC79" HREF="bison_toc.html#TOC79">Look-Ahead Tokens</A></H2>
<P>
<A NAME="IDX180"></A>
<P>
The Bison parser does <EM>not</EM> always reduce immediately as soon as the
last <VAR>n</VAR> tokens and groupings match a rule. This is because such a
simple strategy is inadequate to handle most languages. Instead, when a
reduction is possible, the parser sometimes "looks ahead" at the next
token in order to decide what to do.
<P>
When a token is read, it is not immediately shifted; first it becomes the
<EM>look-ahead token</EM>, which is not on the stack. Now the parser can
perform one or more reductions of tokens and groupings on the stack, while
the look-ahead token remains off to the side. When no more reductions
should take place, the look-ahead token is shifted onto the stack. This
does not mean that all possible reductions have been done; depending on the
token type of the look-ahead token, some rules may choose to delay their
application.
<P>
Here is a simple case where look-ahead is needed. These three rules define
expressions which contain binary addition operators and postfix unary
factorial operators (<SAMP>`!'</SAMP>), and allow parentheses for grouping.
<PRE>
expr: term '+' expr
| term
;
term: '(' expr ')'
| term '!'
| NUMBER
;
</PRE>
<P>
Suppose that the tokens <SAMP>`1 + 2'</SAMP> have been read and shifted; what
should be done? If the following token is <SAMP>`)'</SAMP>, then the first three
tokens must be reduced to form an <CODE>expr</CODE>. This is the only valid
course, because shifting the <SAMP>`)'</SAMP> would produce a sequence of symbols
<CODE>term ')'</CODE>, and no rule allows this.
<P>
If the following token is <SAMP>`!'</SAMP>, then it must be shifted immediately so
that <SAMP>`2 !'</SAMP> can be reduced to make a <CODE>term</CODE>. If instead the
parser were to reduce before shifting, <SAMP>`1 + 2'</SAMP> would become an
<CODE>expr</CODE>. It would then be impossible to shift the <SAMP>`!'</SAMP> because
doing so would produce on the stack the sequence of symbols <CODE>expr
'!'</CODE>. No rule allows that sequence.
<P>
<A NAME="IDX181"></A>
The current look-ahead token is stored in the variable <CODE>yychar</CODE>.
See section <A HREF="bison.html#SEC77">Special Features for Use in Actions</A>.
<H2><A NAME="SEC80" HREF="bison_toc.html#TOC80">Shift/Reduce Conflicts</A></H2>
<P>
<A NAME="IDX182"></A>
<A NAME="IDX183"></A>
<A NAME="IDX184"></A>
<A NAME="IDX185"></A>
<P>
Suppose we are parsing a language which has if-then and if-then-else
statements, with a pair of rules like this:
<PRE>
if_stmt:
IF expr THEN stmt
| IF expr THEN stmt ELSE stmt
;
</PRE>
<P>
Here we assume that <CODE>IF</CODE>, <CODE>THEN</CODE> and <CODE>ELSE</CODE> are
terminal symbols for specific keyword tokens.
<P>
When the <CODE>ELSE</CODE> token is read and becomes the look-ahead token, the
contents of the stack (assuming the input is valid) are just right for
reduction by the first rule. But it is also legitimate to shift the
<CODE>ELSE</CODE>, because that would lead to eventual reduction by the second
rule.
<P>
This situation, where either a shift or a reduction would be valid, is
called a <EM>shift/reduce conflict</EM>. Bison is designed to resolve
these conflicts by choosing to shift, unless otherwise directed by
operator precedence declarations. To see the reason for this, let's
contrast it with the other alternative.
<P>
Since the parser prefers to shift the <CODE>ELSE</CODE>, the result is to attach
the else-clause to the innermost if-statement, making these two inputs
equivalent:
<PRE>
if x then if y then win (); else lose;
if x then do; if y then win (); else lose; end;
</PRE>
<P>
But if the parser chose to reduce when possible rather than shift, the
result would be to attach the else-clause to the outermost if-statement,
making these two inputs equivalent:
<PRE>
if x then if y then win (); else lose;
if x then do; if y then win (); end; else lose;
</PRE>
<P>
The conflict exists because the grammar as written is ambiguous: either
parsing of the simple nested if-statement is legitimate. The established
convention is that these ambiguities are resolved by attaching the
else-clause to the innermost if-statement; this is what Bison accomplishes
by choosing to shift rather than reduce. (It would ideally be cleaner to
write an unambiguous grammar, but that is very hard to do in this case.)
This particular ambiguity was first encountered in the specifications of
Algol 60 and is called the "dangling <CODE>else</CODE>" ambiguity.
<P>
To avoid warnings from Bison about predictable, legitimate shift/reduce
conflicts, use the <CODE>%expect <VAR>n</VAR></CODE> declaration. There will be no
warning as long as the number of shift/reduce conflicts is exactly <VAR>n</VAR>.
See section <A HREF="bison.html#SEC64">Suppressing Conflict Warnings</A>.
<P>
The definition of <CODE>if_stmt</CODE> above is solely to blame for the
conflict, but the conflict does not actually appear without additional
rules. Here is a complete Bison input file that actually manifests the
conflict:
<PRE>
%token IF THEN ELSE variable
%%
stmt: expr
| if_stmt
;
if_stmt:
IF expr THEN stmt
| IF expr THEN stmt ELSE stmt
;
expr: variable
;
</PRE>
<H2><A NAME="SEC81" HREF="bison_toc.html#TOC81">Operator Precedence</A></H2>
<P>
<A NAME="IDX186"></A>
<A NAME="IDX187"></A>
<P>
Another situation where shift/reduce conflicts appear is in arithmetic
expressions. Here shifting is not always the preferred resolution; the
Bison declarations for operator precedence allow you to specify when to
shift and when to reduce.
<H3><A NAME="SEC82" HREF="bison_toc.html#TOC82">When Precedence is Needed</A></H3>
<P>
Consider the following ambiguous grammar fragment (ambiguous because the
input <SAMP>`1 - 2 * 3'</SAMP> can be parsed in two different ways):
<PRE>
expr: expr '-' expr
| expr '*' expr
| expr '<' expr
| '(' expr ')'
...
;
</PRE>
<P>
Suppose the parser has seen the tokens <SAMP>`1'</SAMP>, <SAMP>`-'</SAMP> and <SAMP>`2'</SAMP>;
should it reduce them via the rule for the subtraction operator? It
depends on the next token. Of course, if the next token is <SAMP>`)'</SAMP>, we
must reduce; shifting is invalid because no single rule can reduce the
token sequence <SAMP>`- 2 )'</SAMP> or anything starting with that. But if
the next token is <SAMP>`*'</SAMP> or <SAMP>`<'</SAMP>, we have a choice: either
shifting or reduction would allow the parse to complete, but with
different results.
<P>
To decide which one Bison should do, we must consider the results. If
the next operator token <VAR>op</VAR> is shifted, then it must be reduced
first in order to permit another opportunity to reduce the difference.
The result is (in effect) <SAMP>`1 - (2 <VAR>op</VAR> 3)'</SAMP>. On the other
hand, if the subtraction is reduced before shifting <VAR>op</VAR>, the result
is <SAMP>`(1 - 2) <VAR>op</VAR> 3'</SAMP>. Clearly, then, the choice of shift or
reduce should depend on the relative precedence of the operators
<SAMP>`-'</SAMP> and <VAR>op</VAR>: <SAMP>`*'</SAMP> should be shifted first, but not
<SAMP>`<'</SAMP>.
<P>
<A NAME="IDX188"></A>
What about input such as <SAMP>`1 - 2 - 5'</SAMP>; should this be
<SAMP>`(1 - 2) - 5'</SAMP> or should it be <SAMP>`1 - (2 - 5)'</SAMP>? For most
operators we prefer the former, which is called <EM>left association</EM>.
The latter alternative, <EM>right association</EM>, is desirable for
assignment operators. The choice of left or right association is a
matter of whether the parser chooses to shift or reduce when the stack
contains <SAMP>`1 - 2'</SAMP> and the look-ahead token is <SAMP>`-'</SAMP>: shifting
makes right-associativity.
<H3><A NAME="SEC83" HREF="bison_toc.html#TOC83">Specifying Operator Precedence</A></H3>
<P>
<A NAME="IDX189"></A>
<A NAME="IDX190"></A>
<A NAME="IDX191"></A>
<P>
Bison allows you to specify these choices with the operator precedence
declarations <CODE>%left</CODE> and <CODE>%right</CODE>. Each such declaration
contains a list of tokens, which are operators whose precedence and
associativity is being declared. The <CODE>%left</CODE> declaration makes all
those operators left-associative and the <CODE>%right</CODE> declaration makes
them right-associative. A third alternative is <CODE>%nonassoc</CODE>, which
declares that it is a syntax error to find the same operator twice "in a
row".
<P>
The relative precedence of different operators is controlled by the
order in which they are declared. The first <CODE>%left</CODE> or
<CODE>%right</CODE> declaration in the file declares the operators whose
precedence is lowest, the next such declaration declares the operators
whose precedence is a little higher, and so on.
<H3><A NAME="SEC84" HREF="bison_toc.html#TOC84">Precedence Examples</A></H3>
<P>
In our example, we would want the following declarations:
<PRE>
%left '<'
%left '-'
%left '*'
</PRE>
<P>
In a more complete example, which supports other operators as well, we
would declare them in groups of equal precedence. For example, <CODE>'+'</CODE> is
declared with <CODE>'-'</CODE>:
<PRE>
%left '<' '>' '=' NE LE GE
%left '+' '-'
%left '*' '/'
</PRE>
<P>
(Here <CODE>NE</CODE> and so on stand for the operators for "not equal"
and so on. We assume that these tokens are more than one character long
and therefore are represented by names, not character literals.)
<H3><A NAME="SEC85" HREF="bison_toc.html#TOC85">How Precedence Works</A></H3>
<P>
The first effect of the precedence declarations is to assign precedence
levels to the terminal symbols declared. The second effect is to assign
precedence levels to certain rules: each rule gets its precedence from
the last terminal symbol mentioned in the components. (You can also
specify explicitly the precedence of a rule. See section <A HREF="bison.html#SEC86">Context-Dependent Precedence</A>.)
<P>
Finally, the resolution of conflicts works by comparing the precedence
of the rule being considered with that of the look-ahead token. If the
token's precedence is higher, the choice is to shift. If the rule's
precedence is higher, the choice is to reduce. If they have equal
precedence, the choice is made based on the associativity of that
precedence level. The verbose output file made by <SAMP>`-v'</SAMP>
(see section <A HREF="bison.html#SEC100">Invoking Bison</A>) says how each conflict was
resolved.
<P>
Not all rules and not all tokens have precedence. If either the rule or
the look-ahead token has no precedence, then the default is to shift.
<H2><A NAME="SEC86" HREF="bison_toc.html#TOC86">Context-Dependent Precedence</A></H2>
<P>
<A NAME="IDX192"></A>
<A NAME="IDX193"></A>
<A NAME="IDX194"></A>
<A NAME="IDX195"></A>
<A NAME="IDX196"></A>
<P>
Often the precedence of an operator depends on the context. This sounds
outlandish at first, but it is really very common. For example, a minus
sign typically has a very high precedence as a unary operator, and a
somewhat lower precedence (lower than multiplication) as a binary operator.
<P>
The Bison precedence declarations, <CODE>%left</CODE>, <CODE>%right</CODE> and
<CODE>%nonassoc</CODE>, can only be used once for a given token; so a token has
only one precedence declared in this way. For context-dependent
precedence, you need to use an additional mechanism: the <CODE>%prec</CODE>
modifier for rules.
<P>
The <CODE>%prec</CODE> modifier declares the precedence of a particular rule by
specifying a terminal symbol whose precedence should be used for that rule.
It's not necessary for that symbol to appear otherwise in the rule. The
modifier's syntax is:
<PRE>
%prec <VAR>terminal-symbol</VAR>
</PRE>
<P>
and it is written after the components of the rule. Its effect is to
assign the rule the precedence of <VAR>terminal-symbol</VAR>, overriding
the precedence that would be deduced for it in the ordinary way. The
altered rule precedence then affects how conflicts involving that rule
are resolved (see section <A HREF="bison.html#SEC81">Operator Precedence</A>).
<P>
Here is how <CODE>%prec</CODE> solves the problem of unary minus. First, declare
a precedence for a fictitious terminal symbol named <CODE>UMINUS</CODE>. There
are no tokens of this type, but the symbol serves to stand for its
precedence:
<PRE>
...
%left '+' '-'
%left '*'
%left UMINUS
</PRE>
<P>
Now the precedence of <CODE>UMINUS</CODE> can be used in specific rules:
<PRE>
exp: ...
| exp '-' exp
...
| '-' exp %prec UMINUS
</PRE>
<H2><A NAME="SEC87" HREF="bison_toc.html#TOC87">Parser States</A></H2>
<P>
<A NAME="IDX197"></A>
<A NAME="IDX198"></A>
<A NAME="IDX199"></A>
<P>
The function <CODE>yyparse</CODE> is implemented using a finite-state machine.
The values pushed on the parser stack are not simply token type codes; they
represent the entire sequence of terminal and nonterminal symbols at or
near the top of the stack. The current state collects all the information
about previous input which is relevant to deciding what to do next.
<P>
Each time a look-ahead token is read, the current parser state together
with the type of look-ahead token are looked up in a table. This table
entry can say, "Shift the look-ahead token." In this case, it also
specifies the new parser state, which is pushed onto the top of the
parser stack. Or it can say, "Reduce using rule number <VAR>n</VAR>."
This means that a certain number of tokens or groupings are taken off
the top of the stack, and replaced by one grouping. In other words,
that number of states are popped from the stack, and one new state is
pushed.
<P>
There is one other alternative: the table can say that the look-ahead token
is erroneous in the current state. This causes error processing to begin
(see section <A HREF="bison.html#SEC92">Error Recovery</A>).
<H2><A NAME="SEC88" HREF="bison_toc.html#TOC88">Reduce/Reduce Conflicts</A></H2>
<P>
<A NAME="IDX200"></A>
<A NAME="IDX201"></A>
<P>
A reduce/reduce conflict occurs if there are two or more rules that apply
to the same sequence of input. This usually indicates a serious error
in the grammar.
<P>
For example, here is an erroneous attempt to define a sequence
of zero or more <CODE>word</CODE> groupings.
<PRE>
sequence: /* empty */
{ printf ("empty sequence\n"); }
| maybeword
| sequence word
{ printf ("added word %s\n", $2); }
;
maybeword: /* empty */
{ printf ("empty maybeword\n"); }
| word
{ printf ("single word %s\n", $1); }
;
</PRE>
<P>
The error is an ambiguity: there is more than one way to parse a single
<CODE>word</CODE> into a <CODE>sequence</CODE>. It could be reduced to a
<CODE>maybeword</CODE> and then into a <CODE>sequence</CODE> via the second rule.
Alternatively, nothing-at-all could be reduced into a <CODE>sequence</CODE>
via the first rule, and this could be combined with the <CODE>word</CODE>
using the third rule for <CODE>sequence</CODE>.
<P>
There is also more than one way to reduce nothing-at-all into a
<CODE>sequence</CODE>. This can be done directly via the first rule,
or indirectly via <CODE>maybeword</CODE> and then the second rule.
<P>
You might think that this is a distinction without a difference, because it
does not change whether any particular input is valid or not. But it does
affect which actions are run. One parsing order runs the second rule's
action; the other runs the first rule's action and the third rule's action.
In this example, the output of the program changes.
<P>
Bison resolves a reduce/reduce conflict by choosing to use the rule that
appears first in the grammar, but it is very risky to rely on this. Every
reduce/reduce conflict must be studied and usually eliminated. Here is the
proper way to define <CODE>sequence</CODE>:
<PRE>
sequence: /* empty */
{ printf ("empty sequence\n"); }
| sequence word
{ printf ("added word %s\n", $2); }
;
</PRE>
<P>
Here is another common error that yields a reduce/reduce conflict:
<PRE>
sequence: /* empty */
| sequence words
| sequence redirects
;
words: /* empty */
| words word
;
redirects:/* empty */
| redirects redirect
;
</PRE>
<P>
The intention here is to define a sequence which can contain either
<CODE>word</CODE> or <CODE>redirect</CODE> groupings. The individual definitions of
<CODE>sequence</CODE>, <CODE>words</CODE> and <CODE>redirects</CODE> are error-free, but the
three together make a subtle ambiguity: even an empty input can be parsed
in infinitely many ways!
<P>
Consider: nothing-at-all could be a <CODE>words</CODE>. Or it could be two
<CODE>words</CODE> in a row, or three, or any number. It could equally well be a
<CODE>redirects</CODE>, or two, or any number. Or it could be a <CODE>words</CODE>
followed by three <CODE>redirects</CODE> and another <CODE>words</CODE>. And so on.
<P>
Here are two ways to correct these rules. First, to make it a single level
of sequence:
<PRE>
sequence: /* empty */
| sequence word
| sequence redirect
;
</PRE>
<P>
Second, to prevent either a <CODE>words</CODE> or a <CODE>redirects</CODE>
from being empty:
<PRE>
sequence: /* empty */
| sequence words
| sequence redirects
;
words: word
| words word
;
redirects:redirect
| redirects redirect
;
</PRE>
<H2><A NAME="SEC89" HREF="bison_toc.html#TOC89">Mysterious Reduce/Reduce Conflicts</A></H2>
<P>
Sometimes reduce/reduce conflicts can occur that don't look warranted.
Here is an example:
<PRE>
%token ID
%%
def: param_spec return_spec ','
;
param_spec:
type
| name_list ':' type
;
return_spec:
type
| name ':' type
;
type: ID
;
name: ID
;
name_list:
name
| name ',' name_list
;
</PRE>
<P>
It would seem that this grammar can be parsed with only a single token
of look-ahead: when a <CODE>param_spec</CODE> is being read, an <CODE>ID</CODE> is
a <CODE>name</CODE> if a comma or colon follows, or a <CODE>type</CODE> if another
<CODE>ID</CODE> follows. In other words, this grammar is LR(1).
<P>
<A NAME="IDX202"></A>
<A NAME="IDX203"></A>
However, Bison, like most parser generators, cannot actually handle all
LR(1) grammars. In this grammar, two contexts, that after an <CODE>ID</CODE>
at the beginning of a <CODE>param_spec</CODE> and likewise at the beginning of
a <CODE>return_spec</CODE>, are similar enough that Bison assumes they are the
same. They appear similar because the same set of rules would be
active--the rule for reducing to a <CODE>name</CODE> and that for reducing to
a <CODE>type</CODE>. Bison is unable to determine at that stage of processing
that the rules would require different look-ahead tokens in the two
contexts, so it makes a single parser state for them both. Combining
the two contexts causes a conflict later. In parser terminology, this
occurrence means that the grammar is not LALR(1).
<P>
In general, it is better to fix deficiencies than to document them. But
this particular deficiency is intrinsically hard to fix; parser
generators that can handle LR(1) grammars are hard to write and tend to
produce parsers that are very large. In practice, Bison is more useful
as it is now.
<P>
When the problem arises, you can often fix it by identifying the two
parser states that are being confused, and adding something to make them
look distinct. In the above example, adding one rule to
<CODE>return_spec</CODE> as follows makes the problem go away:
<PRE>
%token BOGUS
...
%%
...
return_spec:
type
| name ':' type
/* This rule is never used. */
| ID BOGUS
;
</PRE>
<P>
This corrects the problem because it introduces the possibility of an
additional active rule in the context after the <CODE>ID</CODE> at the beginning of
<CODE>return_spec</CODE>. This rule is not active in the corresponding context
in a <CODE>param_spec</CODE>, so the two contexts receive distinct parser states.
As long as the token <CODE>BOGUS</CODE> is never generated by <CODE>yylex</CODE>,
the added rule cannot alter the way actual input is parsed.
<P>
In this particular example, there is another way to solve the problem:
rewrite the rule for <CODE>return_spec</CODE> to use <CODE>ID</CODE> directly
instead of via <CODE>name</CODE>. This also causes the two confusing
contexts to have different sets of active rules, because the one for
<CODE>return_spec</CODE> activates the altered rule for <CODE>return_spec</CODE>
rather than the one for <CODE>name</CODE>.
<PRE>
param_spec:
type
| name_list ':' type
;
return_spec:
type
| ID ':' type
;
</PRE>
<H2><A NAME="SEC90" HREF="bison_toc.html#TOC90">Generalized LR (GLR) Parsing</A></H2>
<P>
<A NAME="IDX204"></A>
<A NAME="IDX205"></A>
<A NAME="IDX206"></A>
<A NAME="IDX207"></A>
<P>
Bison produces <EM>deterministic</EM> parsers that choose uniquely
when to reduce and which reduction to apply
based on a summary of the preceding input and on one extra token of lookahead.
As a result, normal Bison handles a proper subset of the family of
context-free languages.
Ambiguous grammars, since they have strings with more than one possible
sequence of reductions cannot have deterministic parsers in this sense.
The same is true of languages that require more than one symbol of
lookahead, since the parser lacks the information necessary to make a
decision at the point it must be made in a shift-reduce parser.
Finally, as previously mentioned (see section <A HREF="bison.html#SEC89">Mysterious Reduce/Reduce Conflicts</A>),
there are languages where Bison's particular choice of how to
summarize the input seen so far loses necessary information.
<P>
When you use the <SAMP>`%glr-parser'</SAMP> declaration in your grammar file,
Bison generates a parser that uses a different algorithm, called
Generalized LR (or GLR). A Bison GLR parser uses the same basic
algorithm for parsing as an ordinary Bison parser, but behaves
differently in cases where there is a shift-reduce conflict that has not
been resolved by precedence rules (see section <A HREF="bison.html#SEC81">Operator Precedence</A>) or a
reduce-reduce conflict. When a GLR parser encounters such a situation, it
effectively <EM>splits</EM> into a several parsers, one for each possible
shift or reduction. These parsers then proceed as usual, consuming
tokens in lock-step. Some of the stacks may encounter other conflicts
and split further, with the result that instead of a sequence of states,
a Bison GLR parsing stack is what is in effect a tree of states.
<P>
In effect, each stack represents a guess as to what the proper parse
is. Additional input may indicate that a guess was wrong, in which case
the appropriate stack silently disappears. Otherwise, the semantics
actions generated in each stack are saved, rather than being executed
immediately. When a stack disappears, its saved semantic actions never
get executed. When a reduction causes two stacks to become equivalent,
their sets of semantic actions are both saved with the state that
results from the reduction. We say that two stacks are equivalent
when they both represent the same sequence of states,
and each pair of corresponding states represents a
grammar symbol that produces the same segment of the input token
stream.
<P>
Whenever the parser makes a transition from having multiple
states to having one, it reverts to the normal LALR(1) parsing
algorithm, after resolving and executing the saved-up actions.
At this transition, some of the states on the stack will have semantic
values that are sets (actually multisets) of possible actions. The
parser tries to pick one of the actions by first finding one whose rule
has the highest dynamic precedence, as set by the <SAMP>`%dprec'</SAMP>
declaration. Otherwise, if the alternative actions are not ordered by
precedence, but there the same merging function is declared for both
rules by the <SAMP>`%merge'</SAMP> declaration,
Bison resolves and evaluates both and then calls the merge function on
the result. Otherwise, it reports an ambiguity.
<P>
It is possible to use a data structure for the GLR parsing tree that
permits the processing of any LALR(1) grammar in linear time (in the
size of the input), any unambiguous (not necessarily LALR(1)) grammar in
quadratic worst-case time, and any general (possibly ambiguous)
context-free grammar in cubic worst-case time. However, Bison currently
uses a simpler data structure that requires time proportional to the
length of the input times the maximum number of stacks required for any
prefix of the input. Thus, really ambiguous or non-deterministic
grammars can require exponential time and space to process. Such badly
behaving examples, however, are not generally of practical interest.
Usually, non-determinism in a grammar is local--the parser is "in
doubt" only for a few tokens at a time. Therefore, the current data
structure should generally be adequate. On LALR(1) portions of a
grammar, in particular, it is only slightly slower than with the default
Bison parser.
<H2><A NAME="SEC91" HREF="bison_toc.html#TOC91">Stack Overflow, and How to Avoid It</A></H2>
<P>
<A NAME="IDX208"></A>
<A NAME="IDX209"></A>
<A NAME="IDX210"></A>
<P>
The Bison parser stack can overflow if too many tokens are shifted and
not reduced. When this happens, the parser function <CODE>yyparse</CODE>
returns a nonzero value, pausing only to call <CODE>yyerror</CODE> to report
the overflow.
<P>
Becaue Bison parsers have growing stacks, hitting the upper limit
usually results from using a right recursion instead of a left
recursion, See section <A HREF="bison.html#SEC48">Recursive Rules</A>.
<P>
<A NAME="IDX211"></A>
By defining the macro <CODE>YYMAXDEPTH</CODE>, you can control how deep the
parser stack can become before a stack overflow occurs. Define the
macro with a value that is an integer. This value is the maximum number
of tokens that can be shifted (and not reduced) before overflow.
It must be a constant expression whose value is known at compile time.
<P>
The stack space allowed is not necessarily allocated. If you specify a
large value for <CODE>YYMAXDEPTH</CODE>, the parser actually allocates a small
stack at first, and then makes it bigger by stages as needed. This
increasing allocation happens automatically and silently. Therefore,
you do not need to make <CODE>YYMAXDEPTH</CODE> painfully small merely to save
space for ordinary inputs that do not need much stack.
<P>
<A NAME="IDX212"></A>
The default value of <CODE>YYMAXDEPTH</CODE>, if you do not define it, is
10000.
<P>
<A NAME="IDX213"></A>
You can control how much stack is allocated initially by defining the
macro <CODE>YYINITDEPTH</CODE>. This value too must be a compile-time
constant integer. The default is 200.
<P>
Because of semantical differences between C and C++, the LALR(1) parsers
in C produced by Bison by compiled as C++ cannot grow. In this precise
case (compiling a C parser as C++) you are suggested to grow
<CODE>YYINITDEPTH</CODE>. In the near future, a C++ output output will be
provided which addresses this issue.
<H1><A NAME="SEC92" HREF="bison_toc.html#TOC92">Error Recovery</A></H1>
<P>
<A NAME="IDX214"></A>
<A NAME="IDX215"></A>
<P>
It is not usually acceptable to have a program terminate on a parse
error. For example, a compiler should recover sufficiently to parse the
rest of the input file and check it for errors; a calculator should accept
another expression.
<P>
In a simple interactive command parser where each input is one line, it may
be sufficient to allow <CODE>yyparse</CODE> to return 1 on error and have the
caller ignore the rest of the input line when that happens (and then call
<CODE>yyparse</CODE> again). But this is inadequate for a compiler, because it
forgets all the syntactic context leading up to the error. A syntax error
deep within a function in the compiler input should not cause the compiler
to treat the following line like the beginning of a source file.
<P>
<A NAME="IDX216"></A>
You can define how to recover from a syntax error by writing rules to
recognize the special token <CODE>error</CODE>. This is a terminal symbol that
is always defined (you need not declare it) and reserved for error
handling. The Bison parser generates an <CODE>error</CODE> token whenever a
syntax error happens; if you have provided a rule to recognize this token
in the current context, the parse can continue.
<P>
For example:
<PRE>
stmnts: /* empty string */
| stmnts '\n'
| stmnts exp '\n'
| stmnts error '\n'
</PRE>
<P>
The fourth rule in this example says that an error followed by a newline
makes a valid addition to any <CODE>stmnts</CODE>.
<P>
What happens if a syntax error occurs in the middle of an <CODE>exp</CODE>? The
error recovery rule, interpreted strictly, applies to the precise sequence
of a <CODE>stmnts</CODE>, an <CODE>error</CODE> and a newline. If an error occurs in
the middle of an <CODE>exp</CODE>, there will probably be some additional tokens
and subexpressions on the stack after the last <CODE>stmnts</CODE>, and there
will be tokens to read before the next newline. So the rule is not
applicable in the ordinary way.
<P>
But Bison can force the situation to fit the rule, by discarding part of
the semantic context and part of the input. First it discards states and
objects from the stack until it gets back to a state in which the
<CODE>error</CODE> token is acceptable. (This means that the subexpressions
already parsed are discarded, back to the last complete <CODE>stmnts</CODE>.) At
this point the <CODE>error</CODE> token can be shifted. Then, if the old
look-ahead token is not acceptable to be shifted next, the parser reads
tokens and discards them until it finds a token which is acceptable. In
this example, Bison reads and discards input until the next newline
so that the fourth rule can apply.
<P>
The choice of error rules in the grammar is a choice of strategies for
error recovery. A simple and useful strategy is simply to skip the rest of
the current input line or current statement if an error is detected:
<PRE>
stmnt: error ';' /* On error, skip until ';' is read. */
</PRE>
<P>
It is also useful to recover to the matching close-delimiter of an
opening-delimiter that has already been parsed. Otherwise the
close-delimiter will probably appear to be unmatched, and generate another,
spurious error message:
<PRE>
primary: '(' expr ')'
| '(' error ')'
...
;
</PRE>
<P>
Error recovery strategies are necessarily guesses. When they guess wrong,
one syntax error often leads to another. In the above example, the error
recovery rule guesses that an error is due to bad input within one
<CODE>stmnt</CODE>. Suppose that instead a spurious semicolon is inserted in the
middle of a valid <CODE>stmnt</CODE>. After the error recovery rule recovers
from the first error, another syntax error will be found straightaway,
since the text following the spurious semicolon is also an invalid
<CODE>stmnt</CODE>.
<P>
To prevent an outpouring of error messages, the parser will output no error
message for another syntax error that happens shortly after the first; only
after three consecutive input tokens have been successfully shifted will
error messages resume.
<P>
Note that rules which accept the <CODE>error</CODE> token may have actions, just
as any other rules can.
<P>
<A NAME="IDX217"></A>
You can make error messages resume immediately by using the macro
<CODE>yyerrok</CODE> in an action. If you do this in the error rule's action, no
error messages will be suppressed. This macro requires no arguments;
<SAMP>`yyerrok;'</SAMP> is a valid C statement.
<P>
<A NAME="IDX218"></A>
The previous look-ahead token is reanalyzed immediately after an error. If
this is unacceptable, then the macro <CODE>yyclearin</CODE> may be used to clear
this token. Write the statement <SAMP>`yyclearin;'</SAMP> in the error rule's
action.
<P>
For example, suppose that on a parse error, an error handling routine is
called that advances the input stream to some point where parsing should
once again commence. The next symbol returned by the lexical scanner is
probably correct. The previous look-ahead token ought to be discarded
with <SAMP>`yyclearin;'</SAMP>.
<P>
<A NAME="IDX219"></A>
The macro <CODE>YYRECOVERING</CODE> stands for an expression that has the
value 1 when the parser is recovering from a syntax error, and 0 the
rest of the time. A value of 1 indicates that error messages are
currently suppressed for new syntax errors.
<H1><A NAME="SEC93" HREF="bison_toc.html#TOC93">Handling Context Dependencies</A></H1>
<P>
The Bison paradigm is to parse tokens first, then group them into larger
syntactic units. In many languages, the meaning of a token is affected by
its context. Although this violates the Bison paradigm, certain techniques
(known as <EM>kludges</EM>) may enable you to write Bison parsers for such
languages.
<P>
(Actually, "kludge" means any technique that gets its job done but is
neither clean nor robust.)
<H2><A NAME="SEC94" HREF="bison_toc.html#TOC94">Semantic Info in Token Types</A></H2>
<P>
The C language has a context dependency: the way an identifier is used
depends on what its current meaning is. For example, consider this:
<PRE>
foo (x);
</PRE>
<P>
This looks like a function call statement, but if <CODE>foo</CODE> is a typedef
name, then this is actually a declaration of <CODE>x</CODE>. How can a Bison
parser for C decide how to parse this input?
<P>
The method used in GNU C is to have two different token types,
<CODE>IDENTIFIER</CODE> and <CODE>TYPENAME</CODE>. When <CODE>yylex</CODE> finds an
identifier, it looks up the current declaration of the identifier in order
to decide which token type to return: <CODE>TYPENAME</CODE> if the identifier is
declared as a typedef, <CODE>IDENTIFIER</CODE> otherwise.
<P>
The grammar rules can then express the context dependency by the choice of
token type to recognize. <CODE>IDENTIFIER</CODE> is accepted as an expression,
but <CODE>TYPENAME</CODE> is not. <CODE>TYPENAME</CODE> can start a declaration, but
<CODE>IDENTIFIER</CODE> cannot. In contexts where the meaning of the identifier
is <EM>not</EM> significant, such as in declarations that can shadow a
typedef name, either <CODE>TYPENAME</CODE> or <CODE>IDENTIFIER</CODE> is
accepted--there is one rule for each of the two token types.
<P>
This technique is simple to use if the decision of which kinds of
identifiers to allow is made at a place close to where the identifier is
parsed. But in C this is not always so: C allows a declaration to
redeclare a typedef name provided an explicit type has been specified
earlier:
<PRE>
typedef int foo, bar, lose;
static foo (bar); /* redeclare <CODE>bar</CODE> as static variable */
static int foo (lose); /* redeclare <CODE>foo</CODE> as function */
</PRE>
<P>
Unfortunately, the name being declared is separated from the declaration
construct itself by a complicated syntactic structure--the "declarator".
<P>
As a result, part of the Bison parser for C needs to be duplicated, with
all the nonterminal names changed: once for parsing a declaration in
which a typedef name can be redefined, and once for parsing a
declaration in which that can't be done. Here is a part of the
duplication, with actions omitted for brevity:
<PRE>
initdcl:
declarator maybeasm '='
init
| declarator maybeasm
;
notype_initdcl:
notype_declarator maybeasm '='
init
| notype_declarator maybeasm
;
</PRE>
<P>
Here <CODE>initdcl</CODE> can redeclare a typedef name, but <CODE>notype_initdcl</CODE>
cannot. The distinction between <CODE>declarator</CODE> and
<CODE>notype_declarator</CODE> is the same sort of thing.
<P>
There is some similarity between this technique and a lexical tie-in
(described next), in that information which alters the lexical analysis is
changed during parsing by other parts of the program. The difference is
here the information is global, and is used for other purposes in the
program. A true lexical tie-in has a special-purpose flag controlled by
the syntactic context.
<H2><A NAME="SEC95" HREF="bison_toc.html#TOC95">Lexical Tie-ins</A></H2>
<P>
<A NAME="IDX220"></A>
<P>
One way to handle context-dependency is the <EM>lexical tie-in</EM>: a flag
which is set by Bison actions, whose purpose is to alter the way tokens are
parsed.
<P>
For example, suppose we have a language vaguely like C, but with a special
construct <SAMP>`hex (<VAR>hex-expr</VAR>)'</SAMP>. After the keyword <CODE>hex</CODE> comes
an expression in parentheses in which all integers are hexadecimal. In
particular, the token <SAMP>`a1b'</SAMP> must be treated as an integer rather than
as an identifier if it appears in that context. Here is how you can do it:
<PRE>
%{
int hexflag;
%}
%%
...
expr: IDENTIFIER
| constant
| HEX '('
{ hexflag = 1; }
expr ')'
{ hexflag = 0;
$$ = $4; }
| expr '+' expr
{ $$ = make_sum ($1, $3); }
...
;
constant:
INTEGER
| STRING
;
</PRE>
<P>
Here we assume that <CODE>yylex</CODE> looks at the value of <CODE>hexflag</CODE>; when
it is nonzero, all integers are parsed in hexadecimal, and tokens starting
with letters are parsed as integers if possible.
<P>
The declaration of <CODE>hexflag</CODE> shown in the prologue of the parser file
is needed to make it accessible to the actions (see section <A HREF="bison.html#SEC42">The prologue</A>).
You must also write the code in <CODE>yylex</CODE> to obey the flag.
<H2><A NAME="SEC96" HREF="bison_toc.html#TOC96">Lexical Tie-ins and Error Recovery</A></H2>
<P>
Lexical tie-ins make strict demands on any error recovery rules you have.
See section <A HREF="bison.html#SEC92">Error Recovery</A>.
<P>
The reason for this is that the purpose of an error recovery rule is to
abort the parsing of one construct and resume in some larger construct.
For example, in C-like languages, a typical error recovery rule is to skip
tokens until the next semicolon, and then start a new statement, like this:
<PRE>
stmt: expr ';'
| IF '(' expr ')' stmt { ... }
...
error ';'
{ hexflag = 0; }
;
</PRE>
<P>
If there is a syntax error in the middle of a <SAMP>`hex (<VAR>expr</VAR>)'</SAMP>
construct, this error rule will apply, and then the action for the
completed <SAMP>`hex (<VAR>expr</VAR>)'</SAMP> will never run. So <CODE>hexflag</CODE> would
remain set for the entire rest of the input, or until the next <CODE>hex</CODE>
keyword, causing identifiers to be misinterpreted as integers.
<P>
To avoid this problem the error recovery rule itself clears <CODE>hexflag</CODE>.
<P>
There may also be an error recovery rule that works within expressions.
For example, there could be a rule which applies within parentheses
and skips to the close-parenthesis:
<PRE>
expr: ...
| '(' expr ')'
{ $$ = $2; }
| '(' error ')'
...
</PRE>
<P>
If this rule acts within the <CODE>hex</CODE> construct, it is not going to abort
that construct (since it applies to an inner level of parentheses within
the construct). Therefore, it should not clear the flag: the rest of
the <CODE>hex</CODE> construct should be parsed with the flag still in effect.
<P>
What if there is an error recovery rule which might abort out of the
<CODE>hex</CODE> construct or might not, depending on circumstances? There is no
way you can write the action to determine whether a <CODE>hex</CODE> construct is
being aborted or not. So if you are using a lexical tie-in, you had better
make sure your error recovery rules are not of this kind. Each rule must
be such that you can be sure that it always will, or always won't, have to
clear the flag.
<H1><A NAME="SEC97" HREF="bison_toc.html#TOC97">Debugging Your Parser</A></H1>
<P>
Developing a parser can be a challenge, especially if you don't
understand the algorithm (see section <A HREF="bison.html#SEC78">The Bison Parser Algorithm</A>). Even so, sometimes a detailed description of the automaton
can help (see section <A HREF="bison.html#SEC98">Understanding Your Parser</A>), or
tracing the execution of the parser can give some insight on why it
behaves improperly (see section <A HREF="bison.html#SEC99">Tracing Your Parser</A>).
<H2><A NAME="SEC98" HREF="bison_toc.html#TOC98">Understanding Your Parser</A></H2>
<P>
As documented elsewhere (see section <A HREF="bison.html#SEC78">The Bison Parser Algorithm</A>)
Bison parsers are <EM>shift/reduce automata</EM>. In some cases (much more
frequent than one would hope), looking at this automaton is required to
tune or simply fix a parser. Bison provides two different
representation of it, either textually or graphically (as a VCG
file).
<P>
The textual file is generated when the options @option{--report} or
@option{--verbose} are specified, see See section <A HREF="bison.html#SEC100">Invoking Bison</A>. Its name is made by removing <SAMP>`.tab.c'</SAMP> or <SAMP>`.c'</SAMP> from
the parser output file name, and adding <SAMP>`.output'</SAMP> instead.
Therefore, if the input file is <TT>`foo.y'</TT>, then the parser file is
called <TT>`foo.tab.c'</TT> by default. As a consequence, the verbose
output file is called <TT>`foo.output'</TT>.
<P>
The following grammar file, <TT>`calc.y'</TT>, will be used in the sequel:
<PRE>
%token NUM STR
%left '+' '-'
%left '*'
%%
exp: exp '+' exp
| exp '-' exp
| exp '*' exp
| exp '/' exp
| NUM
;
useless: STR;
%%
</PRE>
<P>
@command{bison} reports:
<PRE>
calc.y: warning: 1 useless nonterminal and 1 useless rule
calc.y:11.1-7: warning: useless nonterminal: useless
calc.y:11.8-12: warning: useless rule: useless: STR
calc.y contains 7 shift/reduce conflicts.
</PRE>
<P>
When given @option{--report=state}, in addition to <TT>`calc.tab.c'</TT>, it
creates a file <TT>`calc.output'</TT> with contents detailed below. The
order of the output and the exact presentation might vary, but the
interpretation is the same.
<P>
The first section includes details on conflicts that were solved thanks
to precedence and/or associativity:
<PRE>
Conflict in state 8 between rule 2 and token '+' resolved as reduce.
Conflict in state 8 between rule 2 and token '-' resolved as reduce.
Conflict in state 8 between rule 2 and token '*' resolved as shift.
...
</PRE>
<P>
The next section lists states that still have conflicts.
<PRE>
State 8 contains 1 shift/reduce conflict.
State 9 contains 1 shift/reduce conflict.
State 10 contains 1 shift/reduce conflict.
State 11 contains 4 shift/reduce conflicts.
</PRE>
<P>
<A NAME="IDX221"></A>
<A NAME="IDX222"></A>
<A NAME="IDX223"></A>
<A NAME="IDX224"></A>
<A NAME="IDX225"></A>
<A NAME="IDX226"></A>
The next section reports useless tokens, nonterminal and rules. Useless
nonterminals and rules are removed in order to produce a smaller parser,
but useless tokens are preserved, since they might be used by the
scanner (note the difference between "useless" and "not used"
below):
<PRE>
Useless nonterminals:
useless
Terminals which are not used:
STR
Useless rules:
#6 useless: STR;
</PRE>
<P>
The next section reproduces the exact grammar that Bison used:
<PRE>
Grammar
Number, Line, Rule
0 5 $accept -> exp $end
1 5 exp -> exp '+' exp
2 6 exp -> exp '-' exp
3 7 exp -> exp '*' exp
4 8 exp -> exp '/' exp
5 9 exp -> NUM
</PRE>
<P>
and reports the uses of the symbols:
<PRE>
Terminals, with rules where they appear
$end (0) 0
'*' (42) 3
'+' (43) 1
'-' (45) 2
'/' (47) 4
error (256)
NUM (258) 5
Nonterminals, with rules where they appear
$accept (8)
on left: 0
exp (9)
on left: 1 2 3 4 5, on right: 0 1 2 3 4
</PRE>
<P>
<A NAME="IDX227"></A>
<A NAME="IDX228"></A>
<A NAME="IDX229"></A>
Bison then proceeds onto the automaton itself, describing each state
with it set of <EM>items</EM>, also known as <EM>pointed rules</EM>. Each
item is a production rule together with a point (marked by <SAMP>`.'</SAMP>)
that the input cursor.
<PRE>
state 0
$accept -> . exp $ (rule 0)
NUM shift, and go to state 1
exp go to state 2
</PRE>
<P>
This reads as follows: "state 0 corresponds to being at the very
beginning of the parsing, in the initial rule, right before the start
symbol (here, <CODE>exp</CODE>). When the parser returns to this state right
after having reduced a rule that produced an <CODE>exp</CODE>, the control
flow jumps to state 2. If there is no such transition on a nonterminal
symbol, and the lookahead is a <CODE>NUM</CODE>, then this token is shifted on
the parse stack, and the control flow jumps to state 1. Any other
lookahead triggers a parse error."
<P>
<A NAME="IDX230"></A>
<A NAME="IDX231"></A>
<A NAME="IDX232"></A>
<A NAME="IDX233"></A>
Even though the only active rule in state 0 seems to be rule 0, the
report lists <CODE>NUM</CODE> as a lookahead symbol because <CODE>NUM</CODE> can be
at the beginning of any rule deriving an <CODE>exp</CODE>. By default Bison
reports the so-called <EM>core</EM> or <EM>kernel</EM> of the item set, but if
you want to see more detail you can invoke @command{bison} with
@option{--report=itemset} to list all the items, include those that can
be derived:
<PRE>
state 0
$accept -> . exp $ (rule 0)
exp -> . exp '+' exp (rule 1)
exp -> . exp '-' exp (rule 2)
exp -> . exp '*' exp (rule 3)
exp -> . exp '/' exp (rule 4)
exp -> . NUM (rule 5)
NUM shift, and go to state 1
exp go to state 2
</PRE>
<P>
In the state 1...
<PRE>
state 1
exp -> NUM . (rule 5)
$default reduce using rule 5 (exp)
</PRE>
<P>
the rule 5, <SAMP>`exp: NUM;'</SAMP>, is completed. Whatever the lookahead
(<SAMP>`$default'</SAMP>), the parser will reduce it. If it was coming from
state 0, then, after this reduction it will return to state 0, and will
jump to state 2 (<SAMP>`exp: go to state 2'</SAMP>).
<PRE>
state 2
$accept -> exp . $ (rule 0)
exp -> exp . '+' exp (rule 1)
exp -> exp . '-' exp (rule 2)
exp -> exp . '*' exp (rule 3)
exp -> exp . '/' exp (rule 4)
$ shift, and go to state 3
'+' shift, and go to state 4
'-' shift, and go to state 5
'*' shift, and go to state 6
'/' shift, and go to state 7
</PRE>
<P>
In state 2, the automaton can only shift a symbol. For instance,
because of the item <SAMP>`exp -> exp . '+' exp'</SAMP>, if the lookahead if
<SAMP>`+'</SAMP>, it will be shifted on the parse stack, and the automaton
control will jump to state 4, corresponding to the item <SAMP>`exp -> exp
'+' . exp'</SAMP>. Since there is no default action, any other token than
those listed above will trigger a parse error.
<P>
The state 3 is named the <EM>final state</EM>, or the <EM>accepting
state</EM>:
<PRE>
state 3
$accept -> exp $ . (rule 0)
$default accept
</PRE>
<P>
the initial rule is completed (the start symbol and the end
of input were read), the parsing exits successfully.
<P>
The interpretation of states 4 to 7 is straightforward, and is left to
the reader.
<PRE>
state 4
exp -> exp '+' . exp (rule 1)
NUM shift, and go to state 1
exp go to state 8
state 5
exp -> exp '-' . exp (rule 2)
NUM shift, and go to state 1
exp go to state 9
state 6
exp -> exp '*' . exp (rule 3)
NUM shift, and go to state 1
exp go to state 10
state 7
exp -> exp '/' . exp (rule 4)
NUM shift, and go to state 1
exp go to state 11
</PRE>
<P>
As was announced in beginning of the report, <SAMP>`State 8 contains 1
shift/reduce conflict'</SAMP>:
<PRE>
state 8
exp -> exp . '+' exp (rule 1)
exp -> exp '+' exp . (rule 1)
exp -> exp . '-' exp (rule 2)
exp -> exp . '*' exp (rule 3)
exp -> exp . '/' exp (rule 4)
'*' shift, and go to state 6
'/' shift, and go to state 7
'/' [reduce using rule 1 (exp)]
$default reduce using rule 1 (exp)
</PRE>
<P>
Indeed, there are two actions associated to the lookahead <SAMP>`/'</SAMP>:
either shifting (and going to state 7), or reducing rule 1. The
conflict means that either the grammar is ambiguous, or the parser lacks
information to make the right decision. Indeed the grammar is
ambiguous, as, since we did not specify the precedence of <SAMP>`/'</SAMP>, the
sentence <SAMP>`NUM + NUM / NUM'</SAMP> can be parsed as <SAMP>`NUM + (NUM /
NUM)'</SAMP>, which corresponds to shifting <SAMP>`/'</SAMP>, or as <SAMP>`(NUM + NUM) /
NUM'</SAMP>, which corresponds to reducing rule 1.
<P>
Because in LALR(1) parsing a single decision can be made, Bison
arbitrarily chose to disable the reduction, see section <A HREF="bison.html#SEC80">Shift/Reduce Conflicts</A>. Discarded actions are reported in between
square brackets.
<P>
Note that all the previous states had a single possible action: either
shifting the next token and going to the corresponding state, or
reducing a single rule. In the other cases, i.e., when shifting
<EM>and</EM> reducing is possible or when <EM>several</EM> reductions are
possible, the lookahead is required to select the action. State 8 is
one such state: if the lookahead is <SAMP>`*'</SAMP> or <SAMP>`/'</SAMP> then the action
is shifting, otherwise the action is reducing rule 1. In other words,
the first two items, corresponding to rule 1, are not eligible when the
lookahead is <SAMP>`*'</SAMP>, since we specified that <SAMP>`*'</SAMP> has higher
precedence that <SAMP>`+'</SAMP>. More generally, some items are eligible only
with some set of possible lookaheads. When run with
@option{--report=lookahead}, Bison specifies these lookaheads:
<PRE>
state 8
exp -> exp . '+' exp [$, '+', '-', '/'] (rule 1)
exp -> exp '+' exp . [$, '+', '-', '/'] (rule 1)
exp -> exp . '-' exp (rule 2)
exp -> exp . '*' exp (rule 3)
exp -> exp . '/' exp (rule 4)
'*' shift, and go to state 6
'/' shift, and go to state 7
'/' [reduce using rule 1 (exp)]
$default reduce using rule 1 (exp)
</PRE>
<P>
The remaining states are similar:
<PRE>
state 9
exp -> exp . '+' exp (rule 1)
exp -> exp . '-' exp (rule 2)
exp -> exp '-' exp . (rule 2)
exp -> exp . '*' exp (rule 3)
exp -> exp . '/' exp (rule 4)
'*' shift, and go to state 6
'/' shift, and go to state 7
'/' [reduce using rule 2 (exp)]
$default reduce using rule 2 (exp)
state 10
exp -> exp . '+' exp (rule 1)
exp -> exp . '-' exp (rule 2)
exp -> exp . '*' exp (rule 3)
exp -> exp '*' exp . (rule 3)
exp -> exp . '/' exp (rule 4)
'/' shift, and go to state 7
'/' [reduce using rule 3 (exp)]
$default reduce using rule 3 (exp)
state 11
exp -> exp . '+' exp (rule 1)
exp -> exp . '-' exp (rule 2)
exp -> exp . '*' exp (rule 3)
exp -> exp . '/' exp (rule 4)
exp -> exp '/' exp . (rule 4)
'+' shift, and go to state 4
'-' shift, and go to state 5
'*' shift, and go to state 6
'/' shift, and go to state 7
'+' [reduce using rule 4 (exp)]
'-' [reduce using rule 4 (exp)]
'*' [reduce using rule 4 (exp)]
'/' [reduce using rule 4 (exp)]
$default reduce using rule 4 (exp)
</PRE>
<P>
Observe that state 11 contains conflicts due to the lack of precedence
of <SAMP>`/'</SAMP> wrt <SAMP>`+'</SAMP>, <SAMP>`-'</SAMP>, and <SAMP>`*'</SAMP>, but also because the
associativity of <SAMP>`/'</SAMP> is not specified.
<H2><A NAME="SEC99" HREF="bison_toc.html#TOC99">Tracing Your Parser</A></H2>
<P>
<A NAME="IDX234"></A>
<A NAME="IDX235"></A>
<A NAME="IDX236"></A>
<P>
If a Bison grammar compiles properly but doesn't do what you want when it
runs, the <CODE>yydebug</CODE> parser-trace feature can help you figure out why.
<P>
There are several means to enable compilation of trace facilities:
<DL COMPACT>
<DT>the macro <CODE>YYDEBUG</CODE>
<DD>
<A NAME="IDX237"></A>
Define the macro <CODE>YYDEBUG</CODE> to a nonzero value when you compile the
parser. This is compliant with POSIX Yacc. You could use
<SAMP>`-DYYDEBUG=1'</SAMP> as a compiler option or you could put <SAMP>`#define
YYDEBUG 1'</SAMP> in the prologue of the grammar file (see section <A HREF="bison.html#SEC42">The prologue</A>).
<DT>the option @option{-t, @option{--debug}}
<DD>
Use the <SAMP>`-t'</SAMP> option when you run Bison (see section <A HREF="bison.html#SEC100">Invoking Bison</A>). This is POSIX compliant too.
<DT>the directive <SAMP>`%debug'</SAMP>
<DD>
<A NAME="IDX238"></A>
Add the <CODE>%debug</CODE> directive (see section <A HREF="bison.html#SEC67">Bison Declaration Summary</A>). This is a Bison extension, which will prove
useful when Bison will output parsers for languages that don't use a
preprocessor. Useless POSIX and Yacc portability matter to you, this is
the preferred solution.
</DL>
<P>
We suggest that you always enable the debug option so that debugging is
always possible.
<P>
The trace facility outputs messages with macro calls of the form
<CODE>YYFPRINTF (stderr, <VAR>format</VAR>, <VAR>args</VAR>)</CODE> where
<VAR>format</VAR> and <VAR>args</VAR> are the usual <CODE>printf</CODE> format and
arguments. If you define <CODE>YYDEBUG</CODE> to a nonzero value but do not
define <CODE>YYFPRINTF</CODE>, <CODE><stdio.h></CODE> is automatically included
and <CODE>YYPRINTF</CODE> is defined to <CODE>fprintf</CODE>.
<P>
Once you have compiled the program with trace facilities, the way to
request a trace is to store a nonzero value in the variable <CODE>yydebug</CODE>.
You can do this by making the C code do it (in <CODE>main</CODE>, perhaps), or
you can alter the value with a C debugger.
<P>
Each step taken by the parser when <CODE>yydebug</CODE> is nonzero produces a
line or two of trace information, written on <CODE>stderr</CODE>. The trace
messages tell you these things:
<UL>
<LI>
Each time the parser calls <CODE>yylex</CODE>, what kind of token was read.
<LI>
Each time a token is shifted, the depth and complete contents of the
state stack (see section <A HREF="bison.html#SEC87">Parser States</A>).
<LI>
Each time a rule is reduced, which rule it is, and the complete contents
of the state stack afterward.
</UL>
<P>
To make sense of this information, it helps to refer to the listing file
produced by the Bison <SAMP>`-v'</SAMP> option (see section <A HREF="bison.html#SEC100">Invoking Bison</A>). This file shows the meaning of each state in terms of
positions in various rules, and also what each state will do with each
possible input token. As you read the successive trace messages, you
can see that the parser is functioning according to its specification in
the listing file. Eventually you will arrive at the place where
something undesirable happens, and you will see which parts of the
grammar are to blame.
<P>
The parser file is a C program and you can use C debuggers on it, but it's
not easy to interpret what it is doing. The parser function is a
finite-state machine interpreter, and aside from the actions it executes
the same code over and over. Only the values of variables show where in
the grammar it is working.
<P>
<A NAME="IDX239"></A>
The debugging information normally gives the token type of each token
read, but not its semantic value. You can optionally define a macro
named <CODE>YYPRINT</CODE> to provide a way to print the value. If you define
<CODE>YYPRINT</CODE>, it should take three arguments. The parser will pass a
standard I/O stream, the numeric code for the token type, and the token
value (from <CODE>yylval</CODE>).
<P>
Here is an example of <CODE>YYPRINT</CODE> suitable for the multi-function
calculator (see section <A HREF="bison.html#SEC36">Declarations for <CODE>mfcalc</CODE></A>):
<PRE>
#define YYPRINT(file, type, value) yyprint (file, type, value)
static void
yyprint (FILE *file, int type, YYSTYPE value)
{
if (type == VAR)
fprintf (file, " %s", value.tptr->name);
else if (type == NUM)
fprintf (file, " %d", value.val);
}
</PRE>
<H1><A NAME="SEC100" HREF="bison_toc.html#TOC100">Invoking Bison</A></H1>
<P>
<A NAME="IDX240"></A>
<A NAME="IDX241"></A>
<A NAME="IDX242"></A>
<P>
The usual way to invoke Bison is as follows:
<PRE>
bison <VAR>infile</VAR>
</PRE>
<P>
Here <VAR>infile</VAR> is the grammar file name, which usually ends in
<SAMP>`.y'</SAMP>. The parser file's name is made by replacing the <SAMP>`.y'</SAMP>
with <SAMP>`.tab.c'</SAMP>. Thus, the <SAMP>`bison foo.y'</SAMP> filename yields
<TT>`foo.tab.c'</TT>, and the <SAMP>`bison hack/foo.y'</SAMP> filename yields
<TT>`hack/foo.tab.c'</TT>. It's also possible, in case you are writing
C++ code instead of C in your grammar file, to name it <TT>`foo.ypp'</TT>
or <TT>`foo.y++'</TT>. Then, the output files will take an extension like
the given one as input (respectively <TT>`foo.tab.cpp'</TT> and
<TT>`foo.tab.c++'</TT>).
This feature takes effect with all options that manipulate filenames like
<SAMP>`-o'</SAMP> or <SAMP>`-d'</SAMP>.
<P>
For example :
<PRE>
bison -d <VAR>infile.yxx</VAR>
</PRE>
<P>
will produce <TT>`infile.tab.cxx'</TT> and <TT>`infile.tab.hxx'</TT>, and
<PRE>
bison -d -o <VAR>output.c++</VAR> <VAR>infile.y</VAR>
</PRE>
<P>
will produce <TT>`output.c++'</TT> and <TT>`outfile.h++'</TT>.
<H2><A NAME="SEC101" HREF="bison_toc.html#TOC101">Bison Options</A></H2>
<P>
Bison supports both traditional single-letter options and mnemonic long
option names. Long option names are indicated with <SAMP>`--'</SAMP> instead of
<SAMP>`-'</SAMP>. Abbreviations for option names are allowed as long as they
are unique. When a long option takes an argument, like
<SAMP>`--file-prefix'</SAMP>, connect the option name and the argument with
<SAMP>`='</SAMP>.
<P>
Here is a list of options that can be used with Bison, alphabetized by
short option. It is followed by a cross key alphabetized by long
option.
<P>
Operations modes:
<DL COMPACT>
<DT>@option{-h}
<DD>
<DT>@option{--help}
<DD>
Print a summary of the command-line options to Bison and exit.
<DT>@option{-V}
<DD>
<DT>@option{--version}
<DD>
Print the version number of Bison and exit.
<DT>@option{-y}
<DD>
<DT>@option{--yacc}
<DD>
Equivalent to <SAMP>`-o y.tab.c'</SAMP>; the parser output file is called
<TT>`y.tab.c'</TT>, and the other outputs are called <TT>`y.output'</TT> and
<TT>`y.tab.h'</TT>. The purpose of this option is to imitate Yacc's output
file name conventions. Thus, the following shell script can substitute
for Yacc:
<PRE>
bison -y $*
</PRE>
</DL>
<P>
Tuning the parser:
<DL COMPACT>
<DT>@option{-S <VAR>file</VAR>}
<DD>
<DT>@option{--skeleton=<VAR>file</VAR>}
<DD>
Specify the skeleton to use. You probably don't need this option unless
you are developing Bison.
<DT>@option{-t}
<DD>
<DT>@option{--debug}
<DD>
In the parser file, define the macro <CODE>YYDEBUG</CODE> to 1 if it is not
already defined, so that the debugging facilities are compiled.
See section <A HREF="bison.html#SEC99">Tracing Your Parser</A>.
<DT>@option{--locations}
<DD>
Pretend that <CODE>%locations</CODE> was specified. See section <A HREF="bison.html#SEC67">Bison Declaration Summary</A>.
<DT>@option{-p <VAR>prefix</VAR>}
<DD>
<DT>@option{--name-prefix=<VAR>prefix</VAR>}
<DD>
Pretend that <CODE>%name-prefix="<VAR>prefix</VAR>"</CODE> was specified.
See section <A HREF="bison.html#SEC67">Bison Declaration Summary</A>.
<DT>@option{-l}
<DD>
<DT>@option{--no-lines}
<DD>
Don't put any <CODE>#line</CODE> preprocessor commands in the parser file.
Ordinarily Bison puts them in the parser file so that the C compiler
and debuggers will associate errors with your source file, the
grammar file. This option causes them to associate errors with the
parser file, treating it as an independent source file in its own right.
<DT>@option{-n}
<DD>
<DT>@option{--no-parser}
<DD>
Pretend that <CODE>%no-parser</CODE> was specified. See section <A HREF="bison.html#SEC67">Bison Declaration Summary</A>.
<DT>@option{-k}
<DD>
<DT>@option{--token-table}
<DD>
Pretend that <CODE>%token-table</CODE> was specified. See section <A HREF="bison.html#SEC67">Bison Declaration Summary</A>.
</DL>
<P>
Adjust the output:
<DL COMPACT>
<DT>@option{-d}
<DD>
<DT>@option{--defines}
<DD>
Pretend that <CODE>%defines</CODE> was specified, i.e., write an extra output
file containing macro definitions for the token type names defined in
the grammar and the semantic value type <CODE>YYSTYPE</CODE>, as well as a few
<CODE>extern</CODE> variable declarations. See section <A HREF="bison.html#SEC67">Bison Declaration Summary</A>.
<DT>@option{--defines=<VAR>defines-file</VAR>}
<DD>
Same as above, but save in the file <VAR>defines-file</VAR>.
<DT>@option{-b <VAR>file-prefix</VAR>}
<DD>
<DT>@option{--file-prefix=<VAR>prefix</VAR>}
<DD>
Pretend that <CODE>%verbose</CODE> was specified, i.e, specify prefix to use
for all Bison output file names. See section <A HREF="bison.html#SEC67">Bison Declaration Summary</A>.
<DT>@option{-r <VAR>things</VAR>}
<DD>
<DT>@option{--report=<VAR>things</VAR>}
<DD>
Write an extra output file containing verbose description of the comma
separated list of <VAR>things</VAR> among:
<DL COMPACT>
<DT><CODE>state</CODE>
<DD>
Description of the grammar, conflicts (resolved and unresolved), and
LALR automaton.
<DT><CODE>lookahead</CODE>
<DD>
Implies <CODE>state</CODE> and augments the description of the automaton with
each rule's lookahead set.
<DT><CODE>itemset</CODE>
<DD>
Implies <CODE>state</CODE> and augments the description of the automaton with
the full set of items for each state, instead of its core only.
</DL>
For instance, on the following grammar
<DT>@option{-v}
<DD>
<DT>@option{--verbose}
<DD>
Pretend that <CODE>%verbose</CODE> was specified, i.e, write an extra output
file containing verbose descriptions of the grammar and
parser. See section <A HREF="bison.html#SEC67">Bison Declaration Summary</A>.
<DT>@option{-o <VAR>filename</VAR>}
<DD>
<DT>@option{--output=<VAR>filename</VAR>}
<DD>
Specify the <VAR>filename</VAR> for the parser file.
The other output files' names are constructed from <VAR>filename</VAR> as
described under the <SAMP>`-v'</SAMP> and <SAMP>`-d'</SAMP> options.
<DT>@option{-g}
<DD>
Output a VCG definition of the LALR(1) grammar automaton computed by
Bison. If the grammar file is <TT>`foo.y'</TT>, the VCG output file will
be <TT>`foo.vcg'</TT>.
<DT>@option{--graph=<VAR>graph-file</VAR>}
<DD>
The behavior of <VAR>--graph</VAR> is the same than <SAMP>`-g'</SAMP>. The only
difference is that it has an optional argument which is the name of
the output graph filename.
</DL>
<H2><A NAME="SEC102" HREF="bison_toc.html#TOC102">Option Cross Key</A></H2>
<P>
Here is a list of options, alphabetized by long option, to help you find
the corresponding short option.
<H2><A NAME="SEC103" HREF="bison_toc.html#TOC103">Invoking Bison under VMS</A></H2>
<P>
<A NAME="IDX243"></A>
<A NAME="IDX244"></A>
<P>
The command line syntax for Bison on VMS is a variant of the usual
Bison command syntax--adapted to fit VMS conventions.
<P>
To find the VMS equivalent for any Bison option, start with the long
option, and substitute a <SAMP>`/'</SAMP> for the leading <SAMP>`--'</SAMP>, and
substitute a <SAMP>`_'</SAMP> for each <SAMP>`-'</SAMP> in the name of the long option.
For example, the following invocation under VMS:
<PRE>
bison /debug/name_prefix=bar foo.y
</PRE>
<P>
is equivalent to the following command under POSIX.
<PRE>
bison --debug --name-prefix=bar foo.y
</PRE>
<P>
The VMS file system does not permit filenames such as
<TT>`foo.tab.c'</TT>. In the above example, the output file
would instead be named <TT>`foo_tab.c'</TT>.
<H1><A NAME="SEC104" HREF="bison_toc.html#TOC104">Frequently Asked Questions</A></H1>
<P>
<A NAME="IDX245"></A>
<A NAME="IDX246"></A>
<P>
Several questions about Bison come up occasionally. Here some of them
are addressed.
<H2><A NAME="SEC105" HREF="bison_toc.html#TOC105">Parser Stack Overflow</A></H2>
<PRE>
My parser returns with error with a <SAMP>`parser stack overflow'</SAMP>
message. What can I do?
</PRE>
<P>
This question is already addressed elsewhere, See section <A HREF="bison.html#SEC48">Recursive Rules</A>.
<H1><A NAME="SEC106" HREF="bison_toc.html#TOC106">Bison Symbols</A></H1>
<P>
<A NAME="IDX247"></A>
<A NAME="IDX248"></A>
<DL COMPACT>
<DT><CODE>@$</CODE>
<DD>
In an action, the location of the left-hand side of the rule.
See section <A HREF="bison.html#SEC55">Tracking Locations</A>.
<DT><CODE>@<VAR>n</VAR></CODE>
<DD>
In an action, the location of the <VAR>n</VAR>-th symbol of the right-hand
side of the rule. See section <A HREF="bison.html#SEC55">Tracking Locations</A>.
<DT><CODE>$$</CODE>
<DD>
In an action, the semantic value of the left-hand side of the rule.
See section <A HREF="bison.html#SEC52">Actions</A>.
<DT><CODE>$<VAR>n</VAR></CODE>
<DD>
In an action, the semantic value of the <VAR>n</VAR>-th symbol of the
right-hand side of the rule. See section <A HREF="bison.html#SEC52">Actions</A>.
<DT><CODE>$accept</CODE>
<DD>
The predefined nonterminal whose only rule is <SAMP>`$accept: <VAR>start</VAR>
$end'</SAMP>, where <VAR>start</VAR> is the start symbol. See section <A HREF="bison.html#SEC65">The Start-Symbol</A>. It cannot be used in the grammar.
<DT><CODE>$end</CODE>
<DD>
The predefined token marking the end of the token stream. It cannot be
used in the grammar.
<DT><CODE>$undefined</CODE>
<DD>
The predefined token onto which all undefined values returned by
<CODE>yylex</CODE> are mapped. It cannot be used in the grammar, rather, use
<CODE>error</CODE>.
<DT><CODE>error</CODE>
<DD>
A token name reserved for error recovery. This token may be used in
grammar rules so as to allow the Bison parser to recognize an error in
the grammar without halting the process. In effect, a sentence
containing an error may be recognized as valid. On a parse error, the
token <CODE>error</CODE> becomes the current look-ahead token. Actions
corresponding to <CODE>error</CODE> are then executed, and the look-ahead
token is reset to the token that originally caused the violation.
See section <A HREF="bison.html#SEC92">Error Recovery</A>.
<DT><CODE>YYABORT</CODE>
<DD>
Macro to pretend that an unrecoverable syntax error has occurred, by
making <CODE>yyparse</CODE> return 1 immediately. The error reporting
function <CODE>yyerror</CODE> is not called. See section <A HREF="bison.html#SEC70">The Parser Function <CODE>yyparse</CODE></A>.
<DT><CODE>YYACCEPT</CODE>
<DD>
Macro to pretend that a complete utterance of the language has been
read, by making <CODE>yyparse</CODE> return 0 immediately.
See section <A HREF="bison.html#SEC70">The Parser Function <CODE>yyparse</CODE></A>.
<DT><CODE>YYBACKUP</CODE>
<DD>
Macro to discard a value from the parser stack and fake a look-ahead
token. See section <A HREF="bison.html#SEC77">Special Features for Use in Actions</A>.
<DT><CODE>YYDEBUG</CODE>
<DD>
Macro to define to equip the parser with tracing code. See section <A HREF="bison.html#SEC99">Tracing Your Parser</A>.
<DT><CODE>YYERROR</CODE>
<DD>
Macro to pretend that a syntax error has just been detected: call
<CODE>yyerror</CODE> and then perform normal error recovery if possible
(see section <A HREF="bison.html#SEC92">Error Recovery</A>), or (if recovery is impossible) make
<CODE>yyparse</CODE> return 1. See section <A HREF="bison.html#SEC92">Error Recovery</A>.
<DT><CODE>YYERROR_VERBOSE</CODE>
<DD>
Macro that you define with <CODE>#define</CODE> in the Bison declarations
section to request verbose, specific error message strings when
<CODE>yyerror</CODE> is called.
<DT><CODE>YYINITDEPTH</CODE>
<DD>
Macro for specifying the initial size of the parser stack.
See section <A HREF="bison.html#SEC91">Stack Overflow, and How to Avoid It</A>.
<DT><CODE>YYLEX_PARAM</CODE>
<DD>
Macro for specifying an extra argument (or list of extra arguments) for
<CODE>yyparse</CODE> to pass to <CODE>yylex</CODE>. See section <A HREF="bison.html#SEC75">Calling Conventions for Pure Parsers</A>.
<DT><CODE>YYLTYPE</CODE>
<DD>
Macro for the data type of <CODE>yylloc</CODE>; a structure with four
members. See section <A HREF="bison.html#SEC56">Data Type of Locations</A>.
<DT><CODE>yyltype</CODE>
<DD>
Default value for YYLTYPE.
<DT><CODE>YYMAXDEPTH</CODE>
<DD>
Macro for specifying the maximum size of the parser stack.
See section <A HREF="bison.html#SEC91">Stack Overflow, and How to Avoid It</A>.
<DT><CODE>YYPARSE_PARAM</CODE>
<DD>
Macro for specifying the name of a parameter that <CODE>yyparse</CODE> should
accept. See section <A HREF="bison.html#SEC75">Calling Conventions for Pure Parsers</A>.
<DT><CODE>YYRECOVERING</CODE>
<DD>
Macro whose value indicates whether the parser is recovering from a
syntax error. See section <A HREF="bison.html#SEC77">Special Features for Use in Actions</A>.
<DT><CODE>YYSTACK_USE_ALLOCA</CODE>
<DD>
Macro used to control the use of <CODE>alloca</CODE>. If defined to <SAMP>`0'</SAMP>,
the parser will not use <CODE>alloca</CODE> but <CODE>malloc</CODE> when trying to
grow its internal stacks. Do <EM>not</EM> define <CODE>YYSTACK_USE_ALLOCA</CODE>
to anything else.
<DT><CODE>YYSTYPE</CODE>
<DD>
Macro for the data type of semantic values; <CODE>int</CODE> by default.
See section <A HREF="bison.html#SEC50">Data Types of Semantic Values</A>.
<DT><CODE>yychar</CODE>
<DD>
External integer variable that contains the integer value of the current
look-ahead token. (In a pure parser, it is a local variable within
<CODE>yyparse</CODE>.) Error-recovery rule actions may examine this variable.
See section <A HREF="bison.html#SEC77">Special Features for Use in Actions</A>.
<DT><CODE>yyclearin</CODE>
<DD>
Macro used in error-recovery rule actions. It clears the previous
look-ahead token. See section <A HREF="bison.html#SEC92">Error Recovery</A>.
<DT><CODE>yydebug</CODE>
<DD>
External integer variable set to zero by default. If <CODE>yydebug</CODE>
is given a nonzero value, the parser will output information on input
symbols and parser action. See section <A HREF="bison.html#SEC99">Tracing Your Parser</A>.
<DT><CODE>yyerrok</CODE>
<DD>
Macro to cause parser to recover immediately to its normal mode
after a parse error. See section <A HREF="bison.html#SEC92">Error Recovery</A>.
<DT><CODE>yyerror</CODE>
<DD>
User-supplied function to be called by <CODE>yyparse</CODE> on error. The
function receives one argument, a pointer to a character string
containing an error message. See section <A HREF="bison.html#SEC76">The Error Reporting Function <CODE>yyerror</CODE></A>.
<DT><CODE>yylex</CODE>
<DD>
User-supplied lexical analyzer function, called with no arguments to get
the next token. See section <A HREF="bison.html#SEC71">The Lexical Analyzer Function <CODE>yylex</CODE></A>.
<DT><CODE>yylval</CODE>
<DD>
External variable in which <CODE>yylex</CODE> should place the semantic
value associated with a token. (In a pure parser, it is a local
variable within <CODE>yyparse</CODE>, and its address is passed to
<CODE>yylex</CODE>.) See section <A HREF="bison.html#SEC73">Semantic Values of Tokens</A>.
<DT><CODE>yylloc</CODE>
<DD>
External variable in which <CODE>yylex</CODE> should place the line and column
numbers associated with a token. (In a pure parser, it is a local
variable within <CODE>yyparse</CODE>, and its address is passed to
<CODE>yylex</CODE>.) You can ignore this variable if you don't use the
<SAMP>`@'</SAMP> feature in the grammar actions. See section <A HREF="bison.html#SEC74">Textual Positions of Tokens</A>.
<DT><CODE>yynerrs</CODE>
<DD>
Global variable which Bison increments each time there is a parse error.
(In a pure parser, it is a local variable within <CODE>yyparse</CODE>.)
See section <A HREF="bison.html#SEC76">The Error Reporting Function <CODE>yyerror</CODE></A>.
<DT><CODE>yyparse</CODE>
<DD>
The parser function produced by Bison; call this function to start
parsing. See section <A HREF="bison.html#SEC70">The Parser Function <CODE>yyparse</CODE></A>.
<DT><CODE>%debug</CODE>
<DD>
Equip the parser for debugging. See section <A HREF="bison.html#SEC67">Bison Declaration Summary</A>.
<DT><CODE>%defines</CODE>
<DD>
Bison declaration to create a header file meant for the scanner.
See section <A HREF="bison.html#SEC67">Bison Declaration Summary</A>.
<DT><CODE>%dprec</CODE>
<DD>
Bison declaration to assign a precedence to a rule that is used at parse
time to resolve reduce/reduce conflicts. See section <A HREF="bison.html#SEC12">Writing GLR Parsers</A>.
<DT><CODE>%file-prefix="<VAR>prefix</VAR>"</CODE>
<DD>
Bison declaration to set the prefix of the output files. See section <A HREF="bison.html#SEC67">Bison Declaration Summary</A>.
<DT><CODE>%glr-parser</CODE>
<DD>
Bison declaration to produce a GLR parser. See section <A HREF="bison.html#SEC12">Writing GLR Parsers</A>.
<DT><CODE>%left</CODE>
<DD>
Bison declaration to assign left associativity to token(s).
See section <A HREF="bison.html#SEC61">Operator Precedence</A>.
<DT><CODE>%merge</CODE>
<DD>
Bison declaration to assign a merging function to a rule. If there is a
reduce/reduce conflict with a rule having the same merging function, the
function is applied to the two semantic values to get a single result.
See section <A HREF="bison.html#SEC12">Writing GLR Parsers</A>.
<DT><CODE>%name-prefix="<VAR>prefix</VAR>"</CODE>
<DD>
Bison declaration to rename the external symbols. See section <A HREF="bison.html#SEC67">Bison Declaration Summary</A>.
<DT><CODE>%no-lines</CODE>
<DD>
Bison declaration to avoid generating <CODE>#line</CODE> directives in the
parser file. See section <A HREF="bison.html#SEC67">Bison Declaration Summary</A>.
<DT><CODE>%nonassoc</CODE>
<DD>
Bison declaration to assign non-associativity to token(s).
See section <A HREF="bison.html#SEC61">Operator Precedence</A>.
<DT><CODE>%output="<VAR>filename</VAR>"</CODE>
<DD>
Bison declaration to set the name of the parser file. See section <A HREF="bison.html#SEC67">Bison Declaration Summary</A>.
<DT><CODE>%prec</CODE>
<DD>
Bison declaration to assign a precedence to a specific rule.
See section <A HREF="bison.html#SEC86">Context-Dependent Precedence</A>.
<DT><CODE>%pure-parser</CODE>
<DD>
Bison declaration to request a pure (reentrant) parser.
See section <A HREF="bison.html#SEC66">A Pure (Reentrant) Parser</A>.
<DT><CODE>%right</CODE>
<DD>
Bison declaration to assign right associativity to token(s).
See section <A HREF="bison.html#SEC61">Operator Precedence</A>.
<DT><CODE>%start</CODE>
<DD>
Bison declaration to specify the start symbol. See section <A HREF="bison.html#SEC65">The Start-Symbol</A>.
<DT><CODE>%token</CODE>
<DD>
Bison declaration to declare token(s) without specifying precedence.
See section <A HREF="bison.html#SEC60">Token Type Names</A>.
<DT><CODE>%token-table</CODE>
<DD>
Bison declaration to include a token name table in the parser file.
See section <A HREF="bison.html#SEC67">Bison Declaration Summary</A>.
<DT><CODE>%type</CODE>
<DD>
Bison declaration to declare nonterminals. See section <A HREF="bison.html#SEC63">Nonterminal Symbols</A>.
<DT><CODE>%union</CODE>
<DD>
Bison declaration to specify several possible data types for semantic
values. See section <A HREF="bison.html#SEC62">The Collection of Value Types</A>.
</DL>
<P>
These are the punctuation and delimiters used in Bison input:
<DL COMPACT>
<DT><SAMP>`%%'</SAMP>
<DD>
Delimiter used to separate the grammar rule section from the
Bison declarations section or the epilogue.
See section <A HREF="bison.html#SEC16">The Overall Layout of a Bison Grammar</A>.
<DT><SAMP>`%{ %}'</SAMP>
<DD>
All code listed between <SAMP>`%{'</SAMP> and <SAMP>`%}'</SAMP> is copied directly to
the output file uninterpreted. Such code forms the prologue of the input
file. See section <A HREF="bison.html#SEC41">Outline of a Bison Grammar</A>.
<DT><SAMP>`/*...*/'</SAMP>
<DD>
Comment delimiters, as in C.
<DT><SAMP>`:'</SAMP>
<DD>
Separates a rule's result from its components. See section <A HREF="bison.html#SEC47">Syntax of Grammar Rules</A>.
<DT><SAMP>`;'</SAMP>
<DD>
Terminates a rule. See section <A HREF="bison.html#SEC47">Syntax of Grammar Rules</A>.
<DT><SAMP>`|'</SAMP>
<DD>
Separates alternate rules for the same result nonterminal.
See section <A HREF="bison.html#SEC47">Syntax of Grammar Rules</A>.
</DL>
<H1><A NAME="SEC107" HREF="bison_toc.html#TOC107">Glossary</A></H1>
<P>
<A NAME="IDX249"></A>
<DL COMPACT>
<DT>Backus-Naur Form (BNF)
<DD>
Formal method of specifying context-free grammars. BNF was first used
in the <CITE>ALGOL-60</CITE> report, 1963. See section <A HREF="bison.html#SEC8">Languages and Context-Free Grammars</A>.
<DT>Context-free grammars
<DD>
Grammars specified as rules that can be applied regardless of context.
Thus, if there is a rule which says that an integer can be used as an
expression, integers are allowed <EM>anywhere</EM> an expression is
permitted. See section <A HREF="bison.html#SEC8">Languages and Context-Free Grammars</A>.
<DT>Dynamic allocation
<DD>
Allocation of memory that occurs during execution, rather than at
compile time or on entry to a function.
<DT>Empty string
<DD>
Analogous to the empty set in set theory, the empty string is a
character string of length zero.
<DT>Finite-state stack machine
<DD>
A "machine" that has discrete states in which it is said to exist at
each instant in time. As input to the machine is processed, the
machine moves from state to state as specified by the logic of the
machine. In the case of the parser, the input is the language being
parsed, and the states correspond to various stages in the grammar
rules. See section <A HREF="bison.html#SEC78">The Bison Parser Algorithm</A>.
<DT>Generalized LR (GLR)
<DD>
A parsing algorithm that can handle all context-free grammars, including those
that are not LALR(1). It resolves situations that Bison's usual LALR(1)
algorithm cannot by effectively splitting off multiple parsers, trying all
possible parsers, and discarding those that fail in the light of additional
right context. See section <A HREF="bison.html#SEC90">Generalized LR (GLR) Parsing</A>.
<DT>Grouping
<DD>
A language construct that is (in general) grammatically divisible;
for example, `expression' or `declaration' in C.
See section <A HREF="bison.html#SEC8">Languages and Context-Free Grammars</A>.
<DT>Infix operator
<DD>
An arithmetic operator that is placed between the operands on which it
performs some operation.
<DT>Input stream
<DD>
A continuous flow of data between devices or programs.
<DT>Language construct
<DD>
One of the typical usage schemas of the language. For example, one of
the constructs of the C language is the <CODE>if</CODE> statement.
See section <A HREF="bison.html#SEC8">Languages and Context-Free Grammars</A>.
<DT>Left associativity
<DD>
Operators having left associativity are analyzed from left to right:
<SAMP>`a+b+c'</SAMP> first computes <SAMP>`a+b'</SAMP> and then combines with
<SAMP>`c'</SAMP>. See section <A HREF="bison.html#SEC81">Operator Precedence</A>.
<DT>Left recursion
<DD>
A rule whose result symbol is also its first component symbol; for
example, <SAMP>`expseq1 : expseq1 ',' exp;'</SAMP>. See section <A HREF="bison.html#SEC48">Recursive Rules</A>.
<DT>Left-to-right parsing
<DD>
Parsing a sentence of a language by analyzing it token by token from
left to right. See section <A HREF="bison.html#SEC78">The Bison Parser Algorithm</A>.
<DT>Lexical analyzer (scanner)
<DD>
A function that reads an input stream and returns tokens one by one.
See section <A HREF="bison.html#SEC71">The Lexical Analyzer Function <CODE>yylex</CODE></A>.
<DT>Lexical tie-in
<DD>
A flag, set by actions in the grammar rules, which alters the way
tokens are parsed. See section <A HREF="bison.html#SEC95">Lexical Tie-ins</A>.
<DT>Literal string token
<DD>
A token which consists of two or more fixed characters. See section <A HREF="bison.html#SEC46">Symbols, Terminal and Nonterminal</A>.
<DT>Look-ahead token
<DD>
A token already read but not yet shifted. See section <A HREF="bison.html#SEC79">Look-Ahead Tokens</A>.
<DT>LALR(1)
<DD>
The class of context-free grammars that Bison (like most other parser
generators) can handle; a subset of LR(1). See section <A HREF="bison.html#SEC89">Mysterious Reduce/Reduce Conflicts</A>.
<DT>LR(1)
<DD>
The class of context-free grammars in which at most one token of
look-ahead is needed to disambiguate the parsing of any piece of input.
<DT>Nonterminal symbol
<DD>
A grammar symbol standing for a grammatical construct that can
be expressed through rules in terms of smaller constructs; in other
words, a construct that is not a token. See section <A HREF="bison.html#SEC46">Symbols, Terminal and Nonterminal</A>.
<DT>Parse error
<DD>
An error encountered during parsing of an input stream due to invalid
syntax. See section <A HREF="bison.html#SEC92">Error Recovery</A>.
<DT>Parser
<DD>
A function that recognizes valid sentences of a language by analyzing
the syntax structure of a set of tokens passed to it from a lexical
analyzer.
<DT>Postfix operator
<DD>
An arithmetic operator that is placed after the operands upon which it
performs some operation.
<DT>Reduction
<DD>
Replacing a string of nonterminals and/or terminals with a single
nonterminal, according to a grammar rule. See section <A HREF="bison.html#SEC78">The Bison Parser Algorithm</A>.
<DT>Reentrant
<DD>
A reentrant subprogram is a subprogram which can be in invoked any
number of times in parallel, without interference between the various
invocations. See section <A HREF="bison.html#SEC66">A Pure (Reentrant) Parser</A>.
<DT>Reverse polish notation
<DD>
A language in which all operators are postfix operators.
<DT>Right recursion
<DD>
A rule whose result symbol is also its last component symbol; for
example, <SAMP>`expseq1: exp ',' expseq1;'</SAMP>. See section <A HREF="bison.html#SEC48">Recursive Rules</A>.
<DT>Semantics
<DD>
In computer languages, the semantics are specified by the actions
taken for each instance of the language, i.e., the meaning of
each statement. See section <A HREF="bison.html#SEC49">Defining Language Semantics</A>.
<DT>Shift
<DD>
A parser is said to shift when it makes the choice of analyzing
further input from the stream rather than reducing immediately some
already-recognized rule. See section <A HREF="bison.html#SEC78">The Bison Parser Algorithm</A>.
<DT>Single-character literal
<DD>
A single character that is recognized and interpreted as is.
See section <A HREF="bison.html#SEC9">From Formal Rules to Bison Input</A>.
<DT>Start symbol
<DD>
The nonterminal symbol that stands for a complete valid utterance in
the language being parsed. The start symbol is usually listed as the
first nonterminal symbol in a language specification.
See section <A HREF="bison.html#SEC65">The Start-Symbol</A>.
<DT>Symbol table
<DD>
A data structure where symbol names and associated data are stored
during parsing to allow for recognition and use of existing
information in repeated uses of a symbol. See section <A HREF="bison.html#SEC35">Multi-Function Calculator: <CODE>mfcalc</CODE></A>.
<DT>Token
<DD>
A basic, grammatically indivisible unit of a language. The symbol
that describes a token in the grammar is a terminal symbol.
The input of the Bison parser is a stream of tokens which comes from
the lexical analyzer. See section <A HREF="bison.html#SEC46">Symbols, Terminal and Nonterminal</A>.
<DT>Terminal symbol
<DD>
A grammar symbol that has no rules in the grammar and therefore is
grammatically indivisible. The piece of text it represents is a token.
See section <A HREF="bison.html#SEC8">Languages and Context-Free Grammars</A>.
</DL>
<H1><A NAME="SEC108" HREF="bison_toc.html#TOC108">Copying This Manual</A></H1>
<H2><A NAME="SEC109" HREF="bison_toc.html#TOC109">GNU Free Documentation License</A></H2>
<P>
<A NAME="IDX250"></A>
Version 1.1, March 2000
<PRE>
Copyright (C) 2000 Free Software Foundation, Inc.
59 Temple Place, Suite 330, Boston, MA 02111-1307, USA
Everyone is permitted to copy and distribute verbatim copies
of this license document, but changing it is not allowed.
</PRE>
<OL>
<LI>
PREAMBLE
The purpose of this License is to make a manual, textbook, or other
written document <EM>free</EM> in the sense of freedom: to assure everyone
the effective freedom to copy and redistribute it, with or without
modifying it, either commercially or noncommercially. Secondarily,
this License preserves for the author and publisher a way to get
credit for their work, while not being considered responsible for
modifications made by others.
This License is a kind of "copyleft", which means that derivative
works of the document must themselves be free in the same sense. It
complements the GNU General Public License, which is a copyleft
license designed for free software.
We have designed this License in order to use it for manuals for free
software, because free software needs free documentation: a free
program should come with manuals providing the same freedoms that the
software does. But this License is not limited to software manuals;
it can be used for any textual work, regardless of subject matter or
whether it is published as a printed book. We recommend this License
principally for works whose purpose is instruction or reference.
<LI>
APPLICABILITY AND DEFINITIONS
This License applies to any manual or other work that contains a
notice placed by the copyright holder saying it can be distributed
under the terms of this License. The "Document", below, refers to any
such manual or work. Any member of the public is a licensee, and is
addressed as "you".
A "Modified Version" of the Document means any work containing the
Document or a portion of it, either copied verbatim, or with
modifications and/or translated into another language.
A "Secondary Section" is a named appendix or a front-matter section of
the Document that deals exclusively with the relationship of the
publishers or authors of the Document to the Document's overall subject
(or to related matters) and contains nothing that could fall directly
within that overall subject. (For example, if the Document is in part a
textbook of mathematics, a Secondary Section may not explain any
mathematics.) The relationship could be a matter of historical
connection with the subject or with related matters, or of legal,
commercial, philosophical, ethical or political position regarding
them.
The "Invariant Sections" are certain Secondary Sections whose titles
are designated, as being those of Invariant Sections, in the notice
that says that the Document is released under this License.
The "Cover Texts" are certain short passages of text that are listed,
as Front-Cover Texts or Back-Cover Texts, in the notice that says that
the Document is released under this License.
A "Transparent" copy of the Document means a machine-readable copy,
represented in a format whose specification is available to the
general public, whose contents can be viewed and edited directly and
straightforwardly with generic text editors or (for images composed of
pixels) generic paint programs or (for drawings) some widely available
drawing editor, and that is suitable for input to text formatters or
for automatic translation to a variety of formats suitable for input
to text formatters. A copy made in an otherwise Transparent file
format whose markup has been designed to thwart or discourage
subsequent modification by readers is not Transparent. A copy that is
not "Transparent" is called "Opaque".
Examples of suitable formats for Transparent copies include plain
ASCII without markup, Texinfo input format, LaTeX input format,
@acronym{SGML} or @acronym{XML} using a publicly available
@acronym{DTD}, and standard-conforming simple @acronym{HTML} designed
for human modification. Opaque formats include PostScript,
@acronym{PDF}, proprietary formats that can be read and edited only by
proprietary word processors, @acronym{SGML} or @acronym{XML} for which
the @acronym{DTD} and/or processing tools are not generally available,
and the machine-generated @acronym{HTML} produced by some word
processors for output purposes only.
The "Title Page" means, for a printed book, the title page itself,
plus such following pages as are needed to hold, legibly, the material
this License requires to appear in the title page. For works in
formats which do not have any title page as such, "Title Page" means
the text near the most prominent appearance of the work's title,
preceding the beginning of the body of the text.
<LI>
VERBATIM COPYING
You may copy and distribute the Document in any medium, either
commercially or noncommercially, provided that this License, the
copyright notices, and the license notice saying this License applies
to the Document are reproduced in all copies, and that you add no other
conditions whatsoever to those of this License. You may not use
technical measures to obstruct or control the reading or further
copying of the copies you make or distribute. However, you may accept
compensation in exchange for copies. If you distribute a large enough
number of copies you must also follow the conditions in section 3.
You may also lend copies, under the same conditions stated above, and
you may publicly display copies.
<LI>
COPYING IN QUANTITY
If you publish printed copies of the Document numbering more than 100,
and the Document's license notice requires Cover Texts, you must enclose
the copies in covers that carry, clearly and legibly, all these Cover
Texts: Front-Cover Texts on the front cover, and Back-Cover Texts on
the back cover. Both covers must also clearly and legibly identify
you as the publisher of these copies. The front cover must present
the full title with all words of the title equally prominent and
visible. You may add other material on the covers in addition.
Copying with changes limited to the covers, as long as they preserve
the title of the Document and satisfy these conditions, can be treated
as verbatim copying in other respects.
If the required texts for either cover are too voluminous to fit
legibly, you should put the first ones listed (as many as fit
reasonably) on the actual cover, and continue the rest onto adjacent
pages.
If you publish or distribute Opaque copies of the Document numbering
more than 100, you must either include a machine-readable Transparent
copy along with each Opaque copy, or state in or with each Opaque copy
a publicly-accessible computer-network location containing a complete
Transparent copy of the Document, free of added material, which the
general network-using public has access to download anonymously at no
charge using public-standard network protocols. If you use the latter
option, you must take reasonably prudent steps, when you begin
distribution of Opaque copies in quantity, to ensure that this
Transparent copy will remain thus accessible at the stated location
until at least one year after the last time you distribute an Opaque
copy (directly or through your agents or retailers) of that edition to
the public.
It is requested, but not required, that you contact the authors of the
Document well before redistributing any large number of copies, to give
them a chance to provide you with an updated version of the Document.
<LI>
MODIFICATIONS
You may copy and distribute a Modified Version of the Document under
the conditions of sections 2 and 3 above, provided that you release
the Modified Version under precisely this License, with the Modified
Version filling the role of the Document, thus licensing distribution
and modification of the Modified Version to whoever possesses a copy
of it. In addition, you must do these things in the Modified Version:
<OL>
<LI>
Use in the Title Page (and on the covers, if any) a title distinct
from that of the Document, and from those of previous versions
(which should, if there were any, be listed in the History section
of the Document). You may use the same title as a previous version
if the original publisher of that version gives permission.
<LI>
List on the Title Page, as authors, one or more persons or entities
responsible for authorship of the modifications in the Modified
Version, together with at least five of the principal authors of the
Document (all of its principal authors, if it has less than five).
<LI>
State on the Title page the name of the publisher of the
Modified Version, as the publisher.
<LI>
Preserve all the copyright notices of the Document.
<LI>
Add an appropriate copyright notice for your modifications
adjacent to the other copyright notices.
<LI>
Include, immediately after the copyright notices, a license notice
giving the public permission to use the Modified Version under the
terms of this License, in the form shown in the Addendum below.
<LI>
Preserve in that license notice the full lists of Invariant Sections
and required Cover Texts given in the Document's license notice.
<LI>
Include an unaltered copy of this License.
<LI>
Preserve the section entitled "History", and its title, and add to
it an item stating at least the title, year, new authors, and
publisher of the Modified Version as given on the Title Page. If
there is no section entitled "History" in the Document, create one
stating the title, year, authors, and publisher of the Document as
given on its Title Page, then add an item describing the Modified
Version as stated in the previous sentence.
<LI>
Preserve the network location, if any, given in the Document for
public access to a Transparent copy of the Document, and likewise
the network locations given in the Document for previous versions
it was based on. These may be placed in the "History" section.
You may omit a network location for a work that was published at
least four years before the Document itself, or if the original
publisher of the version it refers to gives permission.
<LI>
In any section entitled "Acknowledgments" or "Dedications",
preserve the section's title, and preserve in the section all the
substance and tone of each of the contributor acknowledgments
and/or dedications given therein.
<LI>
Preserve all the Invariant Sections of the Document,
unaltered in their text and in their titles. Section numbers
or the equivalent are not considered part of the section titles.
<LI>
Delete any section entitled "Endorsements". Such a section
may not be included in the Modified Version.
<LI>
Do not retitle any existing section as "Endorsements"
or to conflict in title with any Invariant Section.
</OL>
If the Modified Version includes new front-matter sections or
appendices that qualify as Secondary Sections and contain no material
copied from the Document, you may at your option designate some or all
of these sections as invariant. To do this, add their titles to the
list of Invariant Sections in the Modified Version's license notice.
These titles must be distinct from any other section titles.
You may add a section entitled "Endorsements", provided it contains
nothing but endorsements of your Modified Version by various
parties--for example, statements of peer review or that the text has
been approved by an organization as the authoritative definition of a
standard.
You may add a passage of up to five words as a Front-Cover Text, and a
passage of up to 25 words as a Back-Cover Text, to the end of the list
of Cover Texts in the Modified Version. Only one passage of
Front-Cover Text and one of Back-Cover Text may be added by (or
through arrangements made by) any one entity. If the Document already
includes a cover text for the same cover, previously added by you or
by arrangement made by the same entity you are acting on behalf of,
you may not add another; but you may replace the old one, on explicit
permission from the previous publisher that added the old one.
The author(s) and publisher(s) of the Document do not by this License
give permission to use their names for publicity for or to assert or
imply endorsement of any Modified Version.
<LI>
COMBINING DOCUMENTS
You may combine the Document with other documents released under this
License, under the terms defined in section 4 above for modified
versions, provided that you include in the combination all of the
Invariant Sections of all of the original documents, unmodified, and
list them all as Invariant Sections of your combined work in its
license notice.
The combined work need only contain one copy of this License, and
multiple identical Invariant Sections may be replaced with a single
copy. If there are multiple Invariant Sections with the same name but
different contents, make the title of each such section unique by
adding at the end of it, in parentheses, the name of the original
author or publisher of that section if known, or else a unique number.
Make the same adjustment to the section titles in the list of
Invariant Sections in the license notice of the combined work.
In the combination, you must combine any sections entitled "History"
in the various original documents, forming one section entitled
"History"; likewise combine any sections entitled "Acknowledgments",
and any sections entitled "Dedications". You must delete all sections
entitled "Endorsements."
<LI>
COLLECTIONS OF DOCUMENTS
You may make a collection consisting of the Document and other documents
released under this License, and replace the individual copies of this
License in the various documents with a single copy that is included in
the collection, provided that you follow the rules of this License for
verbatim copying of each of the documents in all other respects.
You may extract a single document from such a collection, and distribute
it individually under this License, provided you insert a copy of this
License into the extracted document, and follow this License in all
other respects regarding verbatim copying of that document.
<LI>
AGGREGATION WITH INDEPENDENT WORKS
A compilation of the Document or its derivatives with other separate
and independent documents or works, in or on a volume of a storage or
distribution medium, does not as a whole count as a Modified Version
of the Document, provided no compilation copyright is claimed for the
compilation. Such a compilation is called an "aggregate", and this
License does not apply to the other self-contained works thus compiled
with the Document, on account of their being thus compiled, if they
are not themselves derivative works of the Document.
If the Cover Text requirement of section 3 is applicable to these
copies of the Document, then if the Document is less than one quarter
of the entire aggregate, the Document's Cover Texts may be placed on
covers that surround only the Document within the aggregate.
Otherwise they must appear on covers around the whole aggregate.
<LI>
TRANSLATION
Translation is considered a kind of modification, so you may
distribute translations of the Document under the terms of section 4.
Replacing Invariant Sections with translations requires special
permission from their copyright holders, but you may include
translations of some or all Invariant Sections in addition to the
original versions of these Invariant Sections. You may include a
translation of this License provided that you also include the
original English version of this License. In case of a disagreement
between the translation and the original English version of this
License, the original English version will prevail.
<LI>
TERMINATION
You may not copy, modify, sublicense, or distribute the Document except
as expressly provided for under this License. Any other attempt to
copy, modify, sublicense or distribute the Document is void, and will
automatically terminate your rights under this License. However,
parties who have received copies, or rights, from you under this
License will not have their licenses terminated so long as such
parties remain in full compliance.
<LI>
FUTURE REVISIONS OF THIS LICENSE
The Free Software Foundation may publish new, revised versions
of the GNU Free Documentation License from time to time. Such new
versions will be similar in spirit to the present version, but may
differ in detail to address new problems or concerns. See
<A HREF="http://www.gnu.org/copyleft/">http://www.gnu.org/copyleft/</A>.
Each version of the License is given a distinguishing version number.
If the Document specifies that a particular numbered version of this
License "or any later version" applies to it, you have the option of
following the terms and conditions either of that specified version or
of any later version that has been published (not as a draft) by the
Free Software Foundation. If the Document does not specify a version
number of this License, you may choose any version ever published (not
as a draft) by the Free Software Foundation.
</OL>
<H3><A NAME="SEC110" HREF="bison_toc.html#TOC110">ADDENDUM: How to use this License for your documents</A></H3>
<P>
To use this License in a document you have written, include a copy of
the License in the document and put the following copyright and
license notices just after the title page:
<PRE>
Copyright (C) <VAR>year</VAR> <VAR>your name</VAR>.
Permission is granted to copy, distribute and/or modify this document
under the terms of the GNU Free Documentation License, Version 1.1
or any later version published by the Free Software Foundation;
with the Invariant Sections being <VAR>list their titles</VAR>, with the
Front-Cover Texts being <VAR>list</VAR>, and with the Back-Cover Texts being <VAR>list</VAR>.
A copy of the license is included in the section entitled ``GNU
Free Documentation License''.
</PRE>
<P>
If you have no Invariant Sections, write "with no Invariant Sections"
instead of saying which ones are invariant. If you have no
Front-Cover Texts, write "no Front-Cover Texts" instead of
"Front-Cover Texts being <VAR>list</VAR>"; likewise for Back-Cover Texts.
<P>
If your document contains nontrivial examples of program code, we
recommend releasing these examples in parallel under your choice of
free software license, such as the GNU General Public License,
to permit their use in free software.
<H1><A NAME="SEC111" HREF="bison_toc.html#TOC111">Index</A></H1>
<P>
Jump to:
<A HREF="#cindex_$">$</A>
-
<A HREF="#cindex_%">%</A>
-
<A HREF="#cindex_@">@</A>
-
<A HREF="#cindex_a">a</A>
-
<A HREF="#cindex_b">b</A>
-
<A HREF="#cindex_c">c</A>
-
<A HREF="#cindex_d">d</A>
-
<A HREF="#cindex_e">e</A>
-
<A HREF="#cindex_f">f</A>
-
<A HREF="#cindex_g">g</A>
-
<A HREF="#cindex_i">i</A>
-
<A HREF="#cindex_k">k</A>
-
<A HREF="#cindex_l">l</A>
-
<A HREF="#cindex_m">m</A>
-
<A HREF="#cindex_n">n</A>
-
<A HREF="#cindex_o">o</A>
-
<A HREF="#cindex_p">p</A>
-
<A HREF="#cindex_q">q</A>
-
<A HREF="#cindex_r">r</A>
-
<A HREF="#cindex_s">s</A>
-
<A HREF="#cindex_t">t</A>
-
<A HREF="#cindex_u">u</A>
-
<A HREF="#cindex_v">v</A>
-
<A HREF="#cindex_w">w</A>
-
<A HREF="#cindex_y">y</A>
-
<A HREF="#cindex_|">|</A>
<P>
<H2><A NAME="cindex_$">$</A></H2>
<DIR>
<LI><A HREF="bison.html#IDX102">$$</A>
<LI><A HREF="bison.html#IDX103">$<VAR>n</VAR></A>
</DIR>
<H2><A NAME="cindex_%">%</A></H2>
<DIR>
<LI><A HREF="bison.html#IDX238">%debug</A>
<LI><A HREF="bison.html#IDX138">%expect</A>
<LI><A HREF="bison.html#IDX26">%glr-parser</A>
<LI><A HREF="bison.html#IDX189">%left</A>
<LI><A HREF="bison.html#IDX191">%nonassoc</A>
<LI><A HREF="bison.html#IDX196">%prec</A>
<LI><A HREF="bison.html#IDX145">%pure-parser</A>
<LI><A HREF="bison.html#IDX190">%right</A>
<LI><A HREF="bison.html#IDX142">%start</A>
<LI><A HREF="bison.html#IDX124">%token</A>
<LI><A HREF="bison.html#IDX133">%type</A>
<LI><A HREF="bison.html#IDX130">%union</A>
</DIR>
<H2><A NAME="cindex_@">@</A></H2>
<DIR>
<LI><A HREF="bison.html#IDX116">@$</A>, <A HREF="bison.html#IDX172">@$</A>
<LI><A HREF="bison.html#IDX117">@<VAR>n</VAR></A>, <A HREF="bison.html#IDX173">@<VAR>n</VAR></A>
</DIR>
<H2><A NAME="cindex_a">a</A></H2>
<DIR>
<LI><A HREF="bison.html#IDX101">action</A>
<LI><A HREF="bison.html#IDX105">action data types</A>
<LI><A HREF="bison.html#IDX168">action features summary</A>
<LI><A HREF="bison.html#IDX107">actions in mid-rule</A>
<LI><A HREF="bison.html#IDX115">actions, location</A>
<LI><A HREF="bison.html#IDX23">actions, semantic</A>
<LI><A HREF="bison.html#IDX74">additional C code section</A>
<LI><A HREF="bison.html#IDX175">algorithm of parser</A>
<LI><A HREF="bison.html#IDX10">ambiguous grammars</A>, <A HREF="bison.html#IDX206">ambiguous grammars</A>
<LI><A HREF="bison.html#IDX188">associativity</A>
</DIR>
<H2><A NAME="cindex_b">b</A></H2>
<DIR>
<LI><A HREF="bison.html#IDX5">Backus-Naur form</A>
<LI><A HREF="bison.html#IDX146">Bison declaration summary</A>
<LI><A HREF="bison.html#IDX120">Bison declarations</A>
<LI><A HREF="bison.html#IDX70">Bison declarations (introduction)</A>
<LI><A HREF="bison.html#IDX17">Bison grammar</A>
<LI><A HREF="bison.html#IDX241">Bison invocation</A>
<LI><A HREF="bison.html#IDX32">Bison parser</A>
<LI><A HREF="bison.html#IDX174">Bison parser algorithm</A>
<LI><A HREF="bison.html#IDX247">Bison symbols, table of</A>
<LI><A HREF="bison.html#IDX33">Bison utility</A>
<LI><A HREF="bison.html#IDX4">BNF</A>
</DIR>
<H2><A NAME="cindex_c">c</A></H2>
<DIR>
<LI><A HREF="bison.html#IDX76">C code, section for additional</A>
<LI><A HREF="bison.html#IDX149">C-language interface</A>
<LI><A HREF="bison.html#IDX56"><CODE>calc</CODE></A>
<LI><A HREF="bison.html#IDX57">calculator, infix notation</A>
<LI><A HREF="bison.html#IDX61">calculator, location tracking</A>
<LI><A HREF="bison.html#IDX64">calculator, multi-function</A>
<LI><A HREF="bison.html#IDX47">calculator, simple</A>
<LI><A HREF="bison.html#IDX81">character token</A>
<LI><A HREF="bison.html#IDX54">compiling the parser</A>
<LI><A HREF="bison.html#IDX27">conflicts</A>, <A HREF="bison.html#IDX182">conflicts</A>
<LI><A HREF="bison.html#IDX201">conflicts, reduce/reduce</A>
<LI><A HREF="bison.html#IDX137">conflicts, suppressing warnings of</A>
<LI><A HREF="bison.html#IDX192">context-dependent precedence</A>
<LI><A HREF="bison.html#IDX2">context-free grammar</A>
<LI><A HREF="bison.html#IDX50">controlling function</A>
<LI><A HREF="bison.html#IDX230">core, item set</A>
</DIR>
<H2><A NAME="cindex_d">d</A></H2>
<DIR>
<LI><A HREF="bison.html#IDX184">dangling <CODE>else</CODE></A>
<LI><A HREF="bison.html#IDX112">data type of locations</A>
<LI><A HREF="bison.html#IDX106">data types in actions</A>
<LI><A HREF="bison.html#IDX99">data types of semantic values</A>
<LI><A HREF="bison.html#IDX235">debugging</A>
<LI><A HREF="bison.html#IDX147">declaration summary</A>
<LI><A HREF="bison.html#IDX69">declarations</A>
<LI><A HREF="bison.html#IDX67">declarations section</A>
<LI><A HREF="bison.html#IDX119">declarations, Bison</A>
<LI><A HREF="bison.html#IDX71">declarations, Bison (introduction)</A>
<LI><A HREF="bison.html#IDX123">declaring literal string tokens</A>
<LI><A HREF="bison.html#IDX126">declaring operator precedence</A>
<LI><A HREF="bison.html#IDX139">declaring the start symbol</A>
<LI><A HREF="bison.html#IDX121">declaring token type names</A>
<LI><A HREF="bison.html#IDX128">declaring value types</A>
<LI><A HREF="bison.html#IDX131">declaring value types, nonterminals</A>
<LI><A HREF="bison.html#IDX104">default action</A>
<LI><A HREF="bison.html#IDX100">default data type</A>
<LI><A HREF="bison.html#IDX113">default location type</A>
<LI><A HREF="bison.html#IDX212">default stack limit</A>
<LI><A HREF="bison.html#IDX141">default start symbol</A>
<LI><A HREF="bison.html#IDX95">defining language semantics</A>
</DIR>
<H2><A NAME="cindex_e">e</A></H2>
<DIR>
<LI><A HREF="bison.html#IDX185"><CODE>else</CODE>, dangling</A>
<LI><A HREF="bison.html#IDX75">epilogue</A>
<LI><A HREF="bison.html#IDX216">error</A>
<LI><A HREF="bison.html#IDX214">error recovery</A>
<LI><A HREF="bison.html#IDX58">error recovery, simple</A>
<LI><A HREF="bison.html#IDX161">error reporting function</A>
<LI><A HREF="bison.html#IDX52">error reporting routine</A>
<LI><A HREF="bison.html#IDX43">examples, simple</A>
<LI><A HREF="bison.html#IDX66">exercises</A>
</DIR>
<H2><A NAME="cindex_f">f</A></H2>
<DIR>
<LI><A HREF="bison.html#IDX250">FDL, GNU Free Documentation License</A>
<LI><A HREF="bison.html#IDX39">file format</A>
<LI><A HREF="bison.html#IDX197">finite-state machine</A>
<LI><A HREF="bison.html#IDX19">formal grammar</A>
<LI><A HREF="bison.html#IDX40">format of grammar file</A>
<LI><A HREF="bison.html#IDX245">frequently asked questions</A>
</DIR>
<H2><A NAME="cindex_g">g</A></H2>
<DIR>
<LI><A HREF="bison.html#IDX9">generalized LR (GLR) parsing</A>, <A HREF="bison.html#IDX25">generalized LR (GLR) parsing</A>, <A HREF="bison.html#IDX205">generalized LR (GLR) parsing</A>
<LI><A HREF="bison.html#IDX249">glossary</A>
<LI><A HREF="bison.html#IDX8">GLR parsing</A>, <A HREF="bison.html#IDX24">GLR parsing</A>, <A HREF="bison.html#IDX204">GLR parsing</A>
<LI><A HREF="bison.html#IDX38">grammar file</A>
<LI><A HREF="bison.html#IDX88">grammar rule syntax</A>
<LI><A HREF="bison.html#IDX72">grammar rules section</A>
<LI><A HREF="bison.html#IDX18">grammar, Bison</A>
<LI><A HREF="bison.html#IDX3">grammar, context-free</A>
<LI><A HREF="bison.html#IDX15">grouping, syntactic</A>
</DIR>
<H2><A NAME="cindex_i">i</A></H2>
<DIR>
<LI><A HREF="bison.html#IDX55">infix notation calculator</A>
<LI><A HREF="bison.html#IDX150">interface</A>
<LI><A HREF="bison.html#IDX1">introduction</A>
<LI><A HREF="bison.html#IDX240">invoking Bison</A>
<LI><A HREF="bison.html#IDX243">invoking Bison under VMS</A>
<LI><A HREF="bison.html#IDX227">item</A>
<LI><A HREF="bison.html#IDX231">item set core</A>, <A HREF="bison.html#IDX233">item set core</A>
</DIR>
<H2><A NAME="cindex_k">k</A></H2>
<DIR>
<LI><A HREF="bison.html#IDX232">kernel, item set</A>
</DIR>
<H2><A NAME="cindex_l">l</A></H2>
<DIR>
<LI><A HREF="bison.html#IDX203">LALR(1)</A>
<LI><A HREF="bison.html#IDX6">LALR(1) grammars</A>
<LI><A HREF="bison.html#IDX96">language semantics, defining</A>
<LI><A HREF="bison.html#IDX41">layout of Bison grammar</A>
<LI><A HREF="bison.html#IDX92">left recursion</A>
<LI><A HREF="bison.html#IDX155">lexical analyzer</A>
<LI><A HREF="bison.html#IDX34">lexical analyzer, purpose</A>
<LI><A HREF="bison.html#IDX49">lexical analyzer, writing</A>
<LI><A HREF="bison.html#IDX220">lexical tie-in</A>
<LI><A HREF="bison.html#IDX85">literal string token</A>
<LI><A HREF="bison.html#IDX82">literal token</A>
<LI><A HREF="bison.html#IDX29">location</A>, <A HREF="bison.html#IDX109">location</A>
<LI><A HREF="bison.html#IDX114">location actions</A>
<LI><A HREF="bison.html#IDX59">location tracking calculator</A>
<LI><A HREF="bison.html#IDX180">look-ahead token</A>
<LI><A HREF="bison.html#IDX202">LR(1)</A>
<LI><A HREF="bison.html#IDX7">LR(1) grammars</A>
<LI><A HREF="bison.html#IDX60"><CODE>ltcalc</CODE></A>
</DIR>
<H2><A NAME="cindex_m">m</A></H2>
<DIR>
<LI><A HREF="bison.html#IDX51">main function in simple example</A>
<LI><A HREF="bison.html#IDX63"><CODE>mfcalc</CODE></A>
<LI><A HREF="bison.html#IDX108">mid-rule actions</A>
<LI><A HREF="bison.html#IDX62">multi-function calculator</A>
<LI><A HREF="bison.html#IDX86">multicharacter literal</A>
<LI><A HREF="bison.html#IDX94">mutual recursion</A>
</DIR>
<H2><A NAME="cindex_n">n</A></H2>
<DIR>
<LI><A HREF="bison.html#IDX11">non-deterministic parsing</A>, <A HREF="bison.html#IDX207">non-deterministic parsing</A>
<LI><A HREF="bison.html#IDX77">nonterminal symbol</A>
<LI><A HREF="bison.html#IDX223">nonterminal, useless</A>
</DIR>
<H2><A NAME="cindex_o">o</A></H2>
<DIR>
<LI><A HREF="bison.html#IDX186">operator precedence</A>
<LI><A HREF="bison.html#IDX127">operator precedence, declaring</A>
<LI><A HREF="bison.html#IDX242">options for invoking Bison</A>
<LI><A HREF="bison.html#IDX210">overflow of parser stack</A>
</DIR>
<H2><A NAME="cindex_p">p</A></H2>
<DIR>
<LI><A HREF="bison.html#IDX163">parse error</A>
<LI><A HREF="bison.html#IDX35">parser</A>
<LI><A HREF="bison.html#IDX178">parser stack</A>
<LI><A HREF="bison.html#IDX209">parser stack overflow</A>
<LI><A HREF="bison.html#IDX198">parser state</A>
<LI><A HREF="bison.html#IDX228">pointed rule</A>
<LI><A HREF="bison.html#IDX45">polish notation calculator</A>
<LI><A HREF="bison.html#IDX31">position, textual</A>, <A HREF="bison.html#IDX111">position, textual</A>
<LI><A HREF="bison.html#IDX125">precedence declarations</A>
<LI><A HREF="bison.html#IDX187">precedence of operators</A>
<LI><A HREF="bison.html#IDX194">precedence, context-dependent</A>
<LI><A HREF="bison.html#IDX195">precedence, unary operator</A>
<LI><A HREF="bison.html#IDX135">preventing warnings about conflicts</A>
<LI><A HREF="bison.html#IDX68">Prologue</A>
<LI><A HREF="bison.html#IDX144">pure parser</A>
</DIR>
<H2><A NAME="cindex_q">q</A></H2>
<DIR>
<LI><A HREF="bison.html#IDX246">questions</A>
</DIR>
<H2><A NAME="cindex_r">r</A></H2>
<DIR>
<LI><A HREF="bison.html#IDX215">recovery from errors</A>
<LI><A HREF="bison.html#IDX91">recursive rule</A>
<LI><A HREF="bison.html#IDX200">reduce/reduce conflict</A>
<LI><A HREF="bison.html#IDX177">reduction</A>
<LI><A HREF="bison.html#IDX143">reentrant parser</A>
<LI><A HREF="bison.html#IDX44">reverse polish notation</A>
<LI><A HREF="bison.html#IDX93">right recursion</A>
<LI><A HREF="bison.html#IDX46"><CODE>rpcalc</CODE></A>
<LI><A HREF="bison.html#IDX87">rule syntax</A>
<LI><A HREF="bison.html#IDX229">rule, pointed</A>
<LI><A HREF="bison.html#IDX225">rule, useless</A>
<LI><A HREF="bison.html#IDX73">rules section for grammar</A>
<LI><A HREF="bison.html#IDX53">running Bison (introduction)</A>
</DIR>
<H2><A NAME="cindex_s">s</A></H2>
<DIR>
<LI><A HREF="bison.html#IDX22">semantic actions</A>
<LI><A HREF="bison.html#IDX20">semantic value</A>
<LI><A HREF="bison.html#IDX97">semantic value type</A>
<LI><A HREF="bison.html#IDX28">shift/reduce conflicts</A>, <A HREF="bison.html#IDX183">shift/reduce conflicts</A>
<LI><A HREF="bison.html#IDX176">shifting</A>
<LI><A HREF="bison.html#IDX42">simple examples</A>
<LI><A HREF="bison.html#IDX83">single-character literal</A>
<LI><A HREF="bison.html#IDX208">stack overflow</A>
<LI><A HREF="bison.html#IDX179">stack, parser</A>
<LI><A HREF="bison.html#IDX36">stages in using Bison</A>
<LI><A HREF="bison.html#IDX16">start symbol</A>
<LI><A HREF="bison.html#IDX140">start symbol, declaring</A>
<LI><A HREF="bison.html#IDX199">state (of parser)</A>
<LI><A HREF="bison.html#IDX84">string token</A>
<LI><A HREF="bison.html#IDX167">summary, action features</A>
<LI><A HREF="bison.html#IDX148">summary, Bison declaration</A>
<LI><A HREF="bison.html#IDX134">suppressing conflict warnings</A>
<LI><A HREF="bison.html#IDX80">symbol</A>
<LI><A HREF="bison.html#IDX65">symbol table example</A>
<LI><A HREF="bison.html#IDX12">symbols (abstract)</A>
<LI><A HREF="bison.html#IDX248">symbols in Bison, table of</A>
<LI><A HREF="bison.html#IDX14">syntactic grouping</A>
<LI><A HREF="bison.html#IDX164">syntax error</A>
<LI><A HREF="bison.html#IDX89">syntax of grammar rules</A>
</DIR>
<H2><A NAME="cindex_t">t</A></H2>
<DIR>
<LI><A HREF="bison.html#IDX78">terminal symbol</A>
<LI><A HREF="bison.html#IDX30">textual position</A>, <A HREF="bison.html#IDX110">textual position</A>
<LI><A HREF="bison.html#IDX13">token</A>
<LI><A HREF="bison.html#IDX79">token type</A>
<LI><A HREF="bison.html#IDX122">token type names, declaring</A>
<LI><A HREF="bison.html#IDX221">token, useless</A>
<LI><A HREF="bison.html#IDX236">tracing the parser</A>
</DIR>
<H2><A NAME="cindex_u">u</A></H2>
<DIR>
<LI><A HREF="bison.html#IDX193">unary operator precedence</A>
<LI><A HREF="bison.html#IDX224">useless nonterminal</A>
<LI><A HREF="bison.html#IDX226">useless rule</A>
<LI><A HREF="bison.html#IDX222">useless token</A>
<LI><A HREF="bison.html#IDX37">using Bison</A>
</DIR>
<H2><A NAME="cindex_v">v</A></H2>
<DIR>
<LI><A HREF="bison.html#IDX98">value type, semantic</A>
<LI><A HREF="bison.html#IDX129">value types, declaring</A>
<LI><A HREF="bison.html#IDX132">value types, nonterminals, declaring</A>
<LI><A HREF="bison.html#IDX21">value, semantic</A>
<LI><A HREF="bison.html#IDX244">VMS</A>
</DIR>
<H2><A NAME="cindex_w">w</A></H2>
<DIR>
<LI><A HREF="bison.html#IDX136">warnings, preventing</A>
<LI><A HREF="bison.html#IDX48">writing a lexical analyzer</A>
</DIR>
<H2><A NAME="cindex_y">y</A></H2>
<DIR>
<LI><A HREF="bison.html#IDX153">YYABORT</A>
<LI><A HREF="bison.html#IDX152">YYACCEPT</A>
<LI><A HREF="bison.html#IDX169">YYBACKUP</A>
<LI><A HREF="bison.html#IDX181">yychar</A>
<LI><A HREF="bison.html#IDX218">yyclearin</A>
<LI><A HREF="bison.html#IDX234">yydebug</A>
<LI><A HREF="bison.html#IDX237">YYDEBUG</A>
<LI><A HREF="bison.html#IDX170">YYEMPTY</A>
<LI><A HREF="bison.html#IDX217">yyerrok</A>
<LI><A HREF="bison.html#IDX162">yyerror</A>
<LI><A HREF="bison.html#IDX171">YYERROR</A>
<LI><A HREF="bison.html#IDX165">YYERROR_VERBOSE</A>
<LI><A HREF="bison.html#IDX213">YYINITDEPTH</A>
<LI><A HREF="bison.html#IDX154">yylex</A>
<LI><A HREF="bison.html#IDX160">YYLEX_PARAM</A>
<LI><A HREF="bison.html#IDX157">yylloc</A>
<LI><A HREF="bison.html#IDX118">YYLLOC_DEFAULT</A>
<LI><A HREF="bison.html#IDX158">YYLTYPE</A>
<LI><A HREF="bison.html#IDX156">yylval</A>
<LI><A HREF="bison.html#IDX211">YYMAXDEPTH</A>
<LI><A HREF="bison.html#IDX166">yynerrs</A>
<LI><A HREF="bison.html#IDX151">yyparse</A>
<LI><A HREF="bison.html#IDX159">YYPARSE_PARAM</A>
<LI><A HREF="bison.html#IDX239">YYPRINT</A>
<LI><A HREF="bison.html#IDX219">YYRECOVERING</A>
</DIR>
<H2><A NAME="cindex_|">|</A></H2>
<DIR>
<LI><A HREF="bison.html#IDX90">|</A>
</DIR>
<P><HR><P>
This document was generated on 9 November 2002 using
<A HREF="http://wwwinfo.cern.ch/dis/texi2html/">texi2html</A> 1.56k.
</BODY>
</HTML>
