* src/files.c (strsuffix): New.

[bison.git] / doc / bison.texinfo

diff --git a/doc/bison.texinfo b/doc/bison.texinfo
index 4ae798d5ac761120de3d15b09c9a2d9a57db75ea..da8508211a64dc52a3eab90c19767b85710ab054 100644 (file)
--- a/doc/bison.texinfo
+++ b/doc/bison.texinfo
@@ -9,9 +9,9 @@
 @finalout
 @end iftex
 
 @finalout
 @end iftex
 

-@c SMALL BOOK version   
+@c SMALL BOOK version

 @c This edition has been formatted so that you can format and print it in
 @c This edition has been formatted so that you can format and print it in

-@c the smallbook format. 
+@c the smallbook format.

 @c @smallbook
 
 @c Set following if you have the new `shorttitlepage' command
 @c @smallbook
 
 @c Set following if you have the new `shorttitlepage' command


@@ -46,7 +46,8 @@ END-INFO-DIR-ENTRY
 @ifinfo
 This file documents the Bison parser generator.
 
 @ifinfo
 This file documents the Bison parser generator.
 

-Copyright (C) 1988, 89, 90, 91, 92, 93, 95, 98, 1999 Free Software Foundation, Inc.
+Copyright (C) 1988, 1989, 1990, 1991, 1992, 1993, 1995, 1998, 1999, 2000
+Free Software Foundation, Inc.

 
 Permission is granted to make and distribute verbatim copies of
 this manual provided the copyright notice and this permission notice
 
 Permission is granted to make and distribute verbatim copies of
 this manual provided the copyright notice and this permission notice


@@ -86,8 +87,9 @@ instead of in the original English.
 
 @page
 @vskip 0pt plus 1filll
 
 @page
 @vskip 0pt plus 1filll

-Copyright @copyright{} 1988, 89, 90, 91, 92, 93, 95, 98, 1999 Free Software
-Foundation 
+Copyright @copyright{} 1988, 1989, 1990, 1991, 1992, 1993, 1995, 1998,
+1999, 2000
+Free Software Foundation, Inc.

 
 @sp 2
 Published by the Free Software Foundation @*
 
 @sp 2
 Published by the Free Software Foundation @*


@@ -123,7 +125,8 @@ instead of in the original English.
 @sp 2
 Cover art by Etienne Suvasa.
 @end titlepage
 @sp 2
 Cover art by Etienne Suvasa.
 @end titlepage

-@page
+
+@contents

 
 @node Top, Introduction, (dir), (dir)
 
 
 @node Top, Introduction, (dir), (dir)
 


@@ -132,8 +135,8 @@ This manual documents version @value{VERSION} of Bison.
 @end ifinfo
 
 @menu
 @end ifinfo
 
 @menu

-* Introduction::      
-* Conditions::        
+* Introduction::
+* Conditions::

 * Copying::           The GNU General Public License says
                         how you can copy and share Bison
 
 * Copying::           The GNU General Public License says
                         how you can copy and share Bison
 


@@ -193,9 +196,9 @@ Reverse Polish Notation Calculator
 
 Grammar Rules for @code{rpcalc}
 
 
 Grammar Rules for @code{rpcalc}
 

-* Rpcalc Input::      
-* Rpcalc Line::       
-* Rpcalc Expr::       
+* Rpcalc Input::
+* Rpcalc Line::
+* Rpcalc Expr::

 
 Multi-Function Calculator: @code{mfcalc}
 
 
 Multi-Function Calculator: @code{mfcalc}
 


@@ -244,7 +247,7 @@ Bison Declarations
 Parser C-Language Interface
 
 * Parser Function::   How to call @code{yyparse} and what it returns.
 Parser C-Language Interface
 
 * Parser Function::   How to call @code{yyparse} and what it returns.

-* Lexical::           You must supply a function @code{yylex} 
+* Lexical::           You must supply a function @code{yylex}

                         which reads tokens.
 * Error Reporting::   You must supply a function @code{yyerror}.
 * Action Features::   Special features for use in actions.
                         which reads tokens.
 * Error Reporting::   You must supply a function @code{yyerror}.
 * Action Features::   Special features for use in actions.


@@ -260,7 +263,7 @@ The Lexical Analyzer Function @code{yylex}
 * Pure Calling::      How the calling convention differs
                         in a pure parser (@pxref{Pure Decl, ,A Pure (Reentrant) Parser}).
 
 * Pure Calling::      How the calling convention differs
                         in a pure parser (@pxref{Pure Decl, ,A Pure (Reentrant) Parser}).
 

-The Bison Parser Algorithm 
+The Bison Parser Algorithm

 
 * Look-Ahead::        Parser looks one token ahead when deciding what to do.
 * Shift/Reduce::      Conflicts: when either shifting or reduction is valid.
 
 * Look-Ahead::        Parser looks one token ahead when deciding what to do.
 * Shift/Reduce::      Conflicts: when either shifting or reduction is valid.


@@ -287,7 +290,7 @@ Handling Context Dependencies
 
 Invoking Bison
 
 
 Invoking Bison
 

-* Bison Options::     All the options described in detail, 
+* Bison Options::     All the options described in detail,

                        in alphabetical order by short options.
 * Option Cross Key::  Alphabetical list of long options.
 * VMS Invocation::    Bison command syntax on VMS.
                        in alphabetical order by short options.
 * Option Cross Key::  Alphabetical list of long options.
 * VMS Invocation::    Bison command syntax on VMS.


@@ -315,7 +318,7 @@ chapters follow which describe specific aspects of Bison in detail.
 
 Bison was written primarily by Robert Corbett; Richard Stallman made it
 Yacc-compatible.  Wilfred Hansen of Carnegie Mellon University added
 
 Bison was written primarily by Robert Corbett; Richard Stallman made it
 Yacc-compatible.  Wilfred Hansen of Carnegie Mellon University added

-multicharacter string literals and other features.
+multi-character string literals and other features.

 
 This edition corresponds to version @value{VERSION} of Bison.
 
 
 This edition corresponds to version @value{VERSION} of Bison.
 


@@ -710,7 +713,7 @@ when it starts in an interactive mode:
 
 @smallexample
 Gnomovision version 69, Copyright (C) 19@var{yy} @var{name of author}
 
 @smallexample
 Gnomovision version 69, Copyright (C) 19@var{yy} @var{name of author}

-Gnomovision comes with ABSOLUTELY NO WARRANTY; for details 
+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.
 type `show w'.
 This is free software, and you are welcome to redistribute it
 under certain conditions; type `show c' for details.


@@ -967,7 +970,7 @@ also produce some output based on the input.  In a Bison grammar, a grammar
 rule can have an @dfn{action} made up of C statements.  Each time the
 parser recognizes a match for that rule, the action is executed.
 @xref{Actions}.
 rule can have an @dfn{action} made up of C statements.  Each time the
 parser recognizes a match for that rule, the action is executed.
 @xref{Actions}.

-        
+

 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
 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


@@ -1258,9 +1261,9 @@ main job of most actions.  The semantic values of the components of the
 rule are referred to as @code{$1}, @code{$2}, and so on.
 
 @menu
 rule are referred to as @code{$1}, @code{$2}, and so on.
 
 @menu

-* Rpcalc Input::      
-* Rpcalc Line::       
-* Rpcalc Expr::       
+* Rpcalc Input::
+* Rpcalc Line::
+* Rpcalc Expr::

 @end menu
 
 @node Rpcalc Input, Rpcalc Line,  , Rpcalc Rules
 @end menu
 
 @node Rpcalc Input, Rpcalc Line,  , Rpcalc Rules


@@ -1419,7 +1422,7 @@ Here is the code for the lexical analyzer:
 
 @example
 @group
 
 @example
 @group

-/* Lexical analyzer returns a double floating point 
+/* Lexical analyzer returns a double floating point

    number on the stack and the token NUM, or the ASCII
    character read if not a number.  Skips all blanks
    and tabs, returns 0 for EOF. */
    number on the stack and the token NUM, or the ASCII
    character read if not a number.  Skips all blanks
    and tabs, returns 0 for EOF. */


@@ -1428,17 +1431,18 @@ Here is the code for the lexical analyzer:
 @end group
 
 @group
 @end group
 
 @group

-yylex ()
+int
+yylex (void)

 @{
   int c;
 
   /* skip white space  */
 @{
   int c;
 
   /* skip white space  */

-  while ((c = getchar ()) == ' ' || c == '\t')  
+  while ((c = getchar ()) == ' ' || c == '\t')

     ;
 @end group
 @group
   /* process numbers   */
     ;
 @end group
 @group
   /* process numbers   */

-  if (c == '.' || isdigit (c))                
+  if (c == '.' || isdigit (c))

     @{
       ungetc (c, stdin);
       scanf ("%lf", &yylval);
     @{
       ungetc (c, stdin);
       scanf ("%lf", &yylval);


@@ -1447,10 +1451,10 @@ yylex ()
 @end group
 @group
   /* return end-of-file  */
 @end group
 @group
   /* return end-of-file  */

-  if (c == EOF)                            
+  if (c == EOF)

     return 0;
   /* return single chars */
     return 0;
   /* return single chars */

-  return c;                                
+  return c;

 @}
 @end group
 @end example
 @}
 @end group
 @end example


@@ -1466,9 +1470,10 @@ kept to the bare minimum.  The only requirement is that it call
 
 @example
 @group
 
 @example
 @group

-main ()
+int
+main (void)

 @{
 @{

-  yyparse ();
+  return yyparse ();

 @}
 @end group
 @end example
 @}
 @end group
 @end example


@@ -1478,16 +1483,17 @@ main ()
 @cindex error reporting routine
 
 When @code{yyparse} detects a syntax error, it calls the error reporting
 @cindex error reporting routine
 
 When @code{yyparse} detects a syntax error, it calls the error reporting

-function @code{yyerror} to print an error message (usually but not always
-@code{"parse error"}).  It is up to the programmer to supply @code{yyerror}
-(@pxref{Interface, ,Parser C-Language Interface}), so here is the definition we will use:
+function @code{yyerror} to print an error message (usually but not
+always @code{"parse error"}).  It is up to the programmer to supply
+@code{yyerror} (@pxref{Interface, ,Parser C-Language Interface}), so
+here is the definition we will use:

 
 @example
 @group
 #include <stdio.h>
 
 
 @example
 @group
 #include <stdio.h>
 

-yyerror (s)  /* Called by yyparse on error */
-     char *s;
+void
+yyerror (const char *s)  /* Called by yyparse on error */

 @{
   printf ("%s\n", s);
 @}
 @{
   printf ("%s\n", s);
 @}


@@ -1505,11 +1511,12 @@ real calculator, but it is adequate for the first example.
 @subsection Running Bison to Make the Parser
 @cindex running Bison (introduction)
 
 @subsection Running Bison to Make the Parser
 @cindex running Bison (introduction)
 

-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{yyerror} and @code{main} go at the end, in the
-``additional C code'' section of the file (@pxref{Grammar Layout, ,The Overall Layout of a Bison Grammar}).
+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{yyerror} and @code{main} go at the
+end, in the ``additional C code'' section of the file (@pxref{Grammar
+Layout, ,The Overall Layout of a Bison Grammar}).

 
 For a large project, you would probably have several source files, and use
 @code{make} to arrange to recompile them.
 
 For a large project, you would probably have several source files, and use
 @code{make} to arrange to recompile them.


@@ -1623,8 +1630,8 @@ exp:      NUM                @{ $$ = $1;         @}
 @end example
 
 @noindent
 @end example
 
 @noindent

-The functions @code{yylex}, @code{yyerror} and @code{main} can be the same
-as before.
+The functions @code{yylex}, @code{yyerror} and @code{main} can be the
+same as before.

 
 There are two important new features shown in this code.
 
 
 There are two important new features shown in this code.
 


@@ -1666,10 +1673,10 @@ Here is a sample run of @file{calc.y}:
 
 Up to this point, this manual has not addressed the issue of @dfn{error
 recovery}---how to continue parsing after the parser detects a syntax
 
 Up to this point, this manual has not addressed the issue of @dfn{error
 recovery}---how to continue parsing after the parser detects a syntax

-error.  All we have handled is error reporting with @code{yyerror}.  Recall
-that by default @code{yyparse} returns after calling @code{yyerror}.  This
-means that an erroneous input line causes the calculator program to exit.
-Now we show how to rectify this deficiency.
+error.  All we have handled is error reporting with @code{yyerror}.
+Recall that by default @code{yyparse} returns after calling
+@code{yyerror}.  This means that an erroneous input line causes the
+calculator program to exit.  Now we show how to rectify this deficiency.

 
 The Bison language itself includes the reserved word @code{error}, which
 may be included in the grammar rules.  In the example below it has
 
 The Bison language itself includes the reserved word @code{error}, which
 may be included in the grammar rules.  In the example below it has


@@ -1684,14 +1691,15 @@ line:     '\n'
 @end group
 @end example
 
 @end group
 @end example
 

-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}, and parsing
-will continue.  (The @code{yyerror} function is still called upon to print
-its message as well.)  The action executes the statement @code{yyerrok}, a
-macro defined automatically by Bison; its meaning is that error recovery is
-complete (@pxref{Error Recovery}).  Note the difference between
-@code{yyerrok} and @code{yyerror}; neither one is a misprint.@refill
+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},
+and parsing will continue.  (The @code{yyerror} function is still called
+upon to print its message as well.)  The action executes the statement
+@code{yyerrok}, a macro defined automatically by Bison; its meaning is
+that error recovery is complete (@pxref{Error Recovery}).  Note the
+difference between @code{yyerrok} and @code{yyerror}; neither one is a
+misprint.@refill

 
 This form of error recovery deals with syntax errors.  There are other
 kinds of errors; for example, division by zero, which raises an exception
 
 This form of error recovery deals with syntax errors.  There are other
 kinds of errors; for example, division by zero, which raises an exception


@@ -1851,6 +1859,7 @@ The symbol table itself consists of a linked list of records.  Its
 definition, which is kept in the header @file{calc.h}, is as follows.  It
 provides for either functions or variables to be placed in the table.
 
 definition, which is kept in the header @file{calc.h}, is as follows.  It
 provides for either functions or variables to be placed in the table.
 

+@c FIXME: ANSIfy the prototypes for FNCTPTR etc.

 @smallexample
 @group
 /* Data type for links in the chain of symbols.      */
 @smallexample
 @group
 /* Data type for links in the chain of symbols.      */


@@ -1885,16 +1894,17 @@ function that initializes the symbol table.  Here it is, and
 @group
 #include <stdio.h>
 
 @group
 #include <stdio.h>
 

-main ()
+int
+main (void)

 @{
   init_table ();
 @{
   init_table ();

-  yyparse ();
+  return yyparse ();

 @}
 @end group
 
 @group
 @}
 @end group
 
 @group

-yyerror (s)  /* Called by yyparse on error */
-     char *s;
+void
+yyerror (const char *s)  /* Called by yyparse on error */

 @{
   printf ("%s\n", s);
 @}
 @{
   printf ("%s\n", s);
 @}


@@ -1907,23 +1917,25 @@ struct init
 @end group
 
 @group
 @end group
 
 @group

-struct init arith_fncts[]
-  = @{
-      "sin", sin,
-      "cos", cos,
-      "atan", atan,
-      "ln", log,
-      "exp", exp,
-      "sqrt", sqrt,
-      0, 0
-    @};
+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;
 @end group
 
 @group
 
 /* The symbol table: a chain of `struct symrec'.  */
 symrec *sym_table = (symrec *)0;
 @end group
 
 @group

-init_table ()  /* puts arithmetic functions in table. */
+/* Put arithmetic functions in table. */
+void
+init_table (void)

 @{
   int i;
   symrec *ptr;
 @{
   int i;
   symrec *ptr;


@@ -1948,9 +1960,7 @@ found, a pointer to that symbol is returned; otherwise zero is returned.
 
 @smallexample
 symrec *
 
 @smallexample
 symrec *

-putsym (sym_name,sym_type)
-     char *sym_name;
-     int sym_type;
+putsym (char *sym_name, int sym_type)

 @{
   symrec *ptr;
   ptr = (symrec *) malloc (sizeof (symrec));
 @{
   symrec *ptr;
   ptr = (symrec *) malloc (sizeof (symrec));


@@ -1964,8 +1974,7 @@ putsym (sym_name,sym_type)
 @}
 
 symrec *
 @}
 
 symrec *

-getsym (sym_name)
-     char *sym_name;
+getsym (const char *sym_name)

 @{
   symrec *ptr;
   for (ptr = sym_table; ptr != (symrec *) 0;
 @{
   symrec *ptr;
   for (ptr = sym_table; ptr != (symrec *) 0;


@@ -1978,7 +1987,7 @@ getsym (sym_name)
 
 The function @code{yylex} must now recognize variables, numeric values, and
 the single-character arithmetic operators.  Strings of alphanumeric
 
 The function @code{yylex} must now recognize variables, numeric values, and
 the single-character arithmetic operators.  Strings of alphanumeric

-characters with a leading nondigit are recognized as either variables or
+characters with a leading non-digit are recognized as either variables or

 functions depending on what the symbol table says about them.
 
 The string is passed to @code{getsym} for look up in the symbol table.  If
 functions depending on what the symbol table says about them.
 
 The string is passed to @code{getsym} for look up in the symbol table.  If


@@ -1994,7 +2003,9 @@ operators in @code{yylex}.
 @smallexample
 @group
 #include <ctype.h>
 @smallexample
 @group
 #include <ctype.h>

-yylex ()
+
+int
+yylex (void)

 @{
   int c;
 
 @{
   int c;
 


@@ -2178,12 +2189,13 @@ if it is the first thing in the file.
 @cindex additional C code section
 @cindex C code, section for additional
 
 @cindex additional C code section
 @cindex C code, section for additional
 

-The @var{additional C code} section is copied verbatim to the end of
-the parser file, just as the @var{C declarations} section 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}.  For example, the definitions of
-@code{yylex} and @code{yyerror} often go here.  @xref{Interface, ,Parser C-Language Interface}.
+The @var{additional C code} section is copied verbatim to the end of the
+parser file, just as the @var{C declarations} section 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}.  For example, the definitions of
+@code{yylex} and @code{yyerror} often go here.  @xref{Interface, ,Parser
+C-Language Interface}.

 
 If the last section is empty, you may omit the @samp{%%} that separates it
 from the grammar rules.
 
 If the last section is empty, you may omit the @samp{%%} that separates it
 from the grammar rules.


@@ -2258,7 +2270,7 @@ for @code{yylex}}).
 A @dfn{literal string token} is written like a C string constant; for
 example, @code{"<="} is a literal string token.  A literal string token
 doesn't need to be declared unless you need to specify its semantic
 A @dfn{literal string token} is written like a C string constant; for
 example, @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 (@pxref{Value Type}), associativity, precedence
+value data type (@pxref{Value Type}), associativity, or precedence

 (@pxref{Precedence}).
 
 You can associate the literal string token with a symbolic name as an
 (@pxref{Precedence}).
 
 You can associate the literal string token with a symbolic name as an


@@ -2292,7 +2304,7 @@ The numeric code for a character token type is simply the ASCII code for
 the character, so @code{yylex} can use the identical character constant to
 generate the requisite code.  Each named token type becomes a C macro in
 the parser file, so @code{yylex} can use the name to stand for the code.
 the character, so @code{yylex} can use the identical character constant to
 generate the requisite code.  Each named token type becomes a C macro in
 the parser file, so @code{yylex} can use the name to stand for the code.

-(This is why periods don't make sense in terminal symbols.)  
+(This is why periods don't make sense in terminal symbols.)

 @xref{Calling Convention, ,Calling Convention for @code{yylex}}.
 
 If @code{yylex} is defined in a separate file, you need to arrange for the
 @xref{Calling Convention, ,Calling Convention for @code{yylex}}.
 
 If @code{yylex} is defined in a separate file, you need to arrange for the


@@ -2323,7 +2335,7 @@ A Bison grammar rule has the following general form:
 @noindent
 where @var{result} is the nonterminal symbol that this rule describes,
 and @var{components} are various terminal and nonterminal symbols that
 @noindent
 where @var{result} is the nonterminal symbol that this rule describes,
 and @var{components} are various terminal and nonterminal symbols that

-are put together by this rule (@pxref{Symbols}).  
+are put together by this rule (@pxref{Symbols}).

 
 For example,
 
 
 For example,
 


@@ -2447,7 +2459,7 @@ further explanation of this.
 @dfn{Indirect} or @dfn{mutual} 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
 @dfn{Indirect} or @dfn{mutual} 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.  
+side.

 
 For example:
 
 
 For example:
 


@@ -2472,7 +2484,7 @@ other.
 @node Semantics, Declarations, Recursion, Grammar File
 @section Defining Language Semantics
 @cindex defining language semantics
 @node Semantics, Declarations, Recursion, Grammar File
 @section Defining Language Semantics
 @cindex defining language semantics

-@cindex language semantics, defining 
+@cindex language semantics, defining

 
 The grammar rules for a language determine only the syntax.  The semantics
 are determined by the semantic values associated with various tokens and
 
 The grammar rules for a language determine only the syntax.  The semantics
 are determined by the semantic values associated with various tokens and


@@ -2532,10 +2544,11 @@ Specify the entire collection of possible data types, with the
 @code{%union} Bison declaration (@pxref{Union Decl, ,The Collection of Value Types}).
 
 @item
 @code{%union} Bison declaration (@pxref{Union Decl, ,The Collection of Value Types}).
 
 @item

-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} Bison declaration (@pxref{Token Decl, ,Token Type Names}) and for groupings
-with the @code{%type} Bison declaration (@pxref{Type Decl, ,Nonterminal Symbols}).
+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} Bison declaration (@pxref{Token Decl, ,Token Type Names})
+and for groupings with the @code{%type} Bison declaration (@pxref{Type
+Decl, ,Nonterminal Symbols}).

 @end itemize
 
 @node Actions, Action Types, Multiple Types, Semantics
 @end itemize
 
 @node Actions, Action Types, Multiple Types, Semantics


@@ -2867,9 +2880,10 @@ Bison will convert this into a @code{#define} directive in
 the parser, so that the function @code{yylex} (if it is in this file)
 can use the name @var{name} to stand for this token type's code.
 
 the parser, so that the function @code{yylex} (if it is in this file)
 can use the name @var{name} to stand for this token type's code.
 

-Alternatively, you can use @code{%left}, @code{%right}, or @code{%nonassoc}
-instead of @code{%token}, if you wish to specify associativity and precedence.
-@xref{Precedence Decl, ,Operator Precedence}.
+Alternatively, you can use @code{%left}, @code{%right}, or
+@code{%nonassoc} instead of @code{%token}, if you wish to specify
+associativity and precedence.  @xref{Precedence Decl, ,Operator
+Precedence}.

 
 You can explicitly specify the numeric code for a token type by appending
 an integer value in the field immediately following the token name:
 
 You can explicitly specify the numeric code for a token type by appending
 an integer value in the field immediately following the token name:


@@ -2885,7 +2899,7 @@ with each other or with ASCII characters.
 
 In the event that the stack type is a union, you must augment the
 @code{%token} or other token declaration to include the data type
 
 In the event that the stack type is a union, you must augment the
 @code{%token} or other token declaration to include the data type

-alternative delimited by angle-brackets (@pxref{Multiple Types, ,More Than One Value Type}).  
+alternative delimited by angle-brackets (@pxref{Multiple Types, ,More Than One Value Type}).

 
 For example:
 
 
 For example:
 


@@ -2981,7 +2995,7 @@ the one declared later has the higher precedence and is grouped first.
 The @code{%union} declaration specifies the entire collection of possible
 data types for semantic values.  The keyword @code{%union} is followed by a
 pair of braces containing the same thing that goes inside a @code{union} in
 The @code{%union} declaration specifies the entire collection of possible
 data types for semantic values.  The keyword @code{%union} is followed by a
 pair of braces containing the same thing that goes inside a @code{union} in

-C.  
+C.

 
 For example:
 
 
 For example:
 


@@ -3102,8 +3116,8 @@ may override this restriction with the @code{%start} declaration as follows:
 A @dfn{reentrant} program is one which does not alter in the course of
 execution; in other words, it consists entirely of @dfn{pure} (read-only)
 code.  Reentrancy is important whenever asynchronous execution is possible;
 A @dfn{reentrant} program is one which does not alter in the course of
 execution; in other words, it consists entirely of @dfn{pure} (read-only)
 code.  Reentrancy is important whenever asynchronous execution is possible;

-for example, a nonreentrant program may not be safe to call from a signal
-handler.  In systems with multiple threads of control, a nonreentrant
+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.
 
 Normally, Bison generates a parser which is not reentrant.  This is
 program must be called only within interlocks.
 
 Normally, Bison generates a parser which is not reentrant.  This is


@@ -3168,14 +3182,23 @@ Declare the type of semantic values for a nonterminal symbol
 (@pxref{Type Decl, ,Nonterminal Symbols}).
 
 @item %start
 (@pxref{Type Decl, ,Nonterminal Symbols}).
 
 @item %start

-Specify the grammar's start symbol (@pxref{Start Decl, ,The Start-Symbol}).
+Specify the grammar's start symbol (@pxref{Start Decl, ,The
+Start-Symbol}).

 
 @item %expect
 Declare the expected number of shift-reduce conflicts
 (@pxref{Expect Decl, ,Suppressing Conflict Warnings}).
 
 
 @item %expect
 Declare the expected number of shift-reduce conflicts
 (@pxref{Expect Decl, ,Suppressing Conflict Warnings}).
 

+@item %locations
+Generate the code processing the locations (@pxref{Action Features,
+,Special Features for Use in Actions}).  This mode is enabled as soon as
+the grammar uses the special @samp{@@@var{n}} tokens, but if your
+grammar does not use it, using @samp{%locations} allows for more
+accurate parse error messages.
+

 @item %pure_parser
 @item %pure_parser

-Request a pure (reentrant) parser program (@pxref{Pure Decl, ,A Pure (Reentrant) Parser}).
+Request a pure (reentrant) parser program (@pxref{Pure Decl, ,A Pure
+(Reentrant) Parser}).

 
 @item %no_lines
 Don't generate any @code{#line} preprocessor commands in the parser
 
 @item %no_lines
 Don't generate any @code{#line} preprocessor commands in the parser


@@ -3272,7 +3295,7 @@ C code in the grammar file, you are likely to run into trouble.
 
 @menu
 * Parser Function::   How to call @code{yyparse} and what it returns.
 
 @menu
 * Parser Function::   How to call @code{yyparse} and what it returns.

-* Lexical::           You must supply a function @code{yylex} 
+* Lexical::           You must supply a function @code{yylex}

                         which reads tokens.
 * Error Reporting::   You must supply a function @code{yyerror}.
 * Action Features::   Special features for use in actions.
                         which reads tokens.
 * Error Reporting::   You must supply a function @code{yyerror}.
 * Action Features::   Special features for use in actions.


@@ -3285,8 +3308,8 @@ C code in the grammar file, you are likely to run into trouble.
 You call the function @code{yyparse} 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
 You call the function @code{yyparse} 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} to return immediately without
-reading further.
+write an action which directs @code{yyparse} to return immediately
+without reading further.

 
 The value returned by @code{yyparse} is 0 if parsing was successful (return
 is due to end-of-input).
 
 The value returned by @code{yyparse} is 0 if parsing was successful (return
 is due to end-of-input).


@@ -3355,7 +3378,8 @@ signifies end-of-input.
 Here is an example showing these things:
 
 @example
 Here is an example showing these things:
 
 @example

-yylex ()
+int
+yylex (void)

 @{
   @dots{}
   if (c == EOF)     /* Detect end of file. */
 @{
   @dots{}
   if (c == EOF)     /* Detect end of file. */


@@ -3415,7 +3439,7 @@ The @code{yytname} table is generated only if you use the
 @subsection Semantic Values of Tokens
 
 @vindex yylval
 @subsection Semantic Values of Tokens
 
 @vindex yylval

-In an ordinary (nonreentrant) parser, the semantic value of the token must
+In an ordinary (non-reentrant) parser, the semantic value of the token must

 be stored into the global variable @code{yylval}.  When you are using
 just one data type for semantic values, @code{yylval} has that type.
 Thus, if the type is @code{int} (the default), you might write this in
 be stored into the global variable @code{yylval}.  When you are using
 just one data type for semantic values, @code{yylval} has that type.
 Thus, if the type is @code{int} (the default), you might write this in


@@ -3461,16 +3485,17 @@ then the code in @code{yylex} might look like this:
 @subsection Textual Positions of Tokens
 
 @vindex yylloc
 @subsection Textual Positions of Tokens
 
 @vindex yylloc

-If you are using the @samp{@@@var{n}}-feature (@pxref{Action Features, ,Special Features for Use in Actions}) in
-actions to keep track of the textual locations of tokens and groupings,
-then you must provide this information in @code{yylex}.  The function
-@code{yyparse} expects to find the textual location of a token just parsed
-in the global variable @code{yylloc}.  So @code{yylex} must store the
-proper data in that variable.  The value of @code{yylloc} 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{first_column}, @code{last_line} and @code{last_column}.  Note that
-the use of this feature makes the parser noticeably slower.
+If you are using the @samp{@@@var{n}}-feature (@pxref{Action Features,
+,Special Features for Use in Actions}) in actions to keep track of the
+textual locations of tokens and groupings, then you must provide this
+information in @code{yylex}.  The function @code{yyparse} expects to
+find the textual location of a token just parsed in the global variable
+@code{yylloc}.  So @code{yylex} must store the proper data in that
+variable.  The value of @code{yylloc} 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{first_column},
+@code{last_line} and @code{last_column}.  Note that the use of this
+feature makes the parser noticeably slower.

 
 @tindex YYLTYPE
 The data type of @code{yylloc} has the name @code{YYLTYPE}.
 
 @tindex YYLTYPE
 The data type of @code{yylloc} has the name @code{YYLTYPE}.


@@ -3487,9 +3512,8 @@ shown here, and pass the information back by storing it through those
 pointers.
 
 @example
 pointers.
 
 @example

-yylex (lvalp, llocp)
-     YYSTYPE *lvalp;
-     YYLTYPE *llocp;
+int
+yylex (YYSTYPE *lvalp, YYLTYPE *llocp)

 @{
   @dots{}
   *lvalp = value;  /* Put value onto Bison stack.  */
 @{
   @dots{}
   *lvalp = value;  /* Put value onto Bison stack.  */


@@ -3593,7 +3617,8 @@ with no arguments, as usual.
 The Bison parser detects a @dfn{parse error} or @dfn{syntax error}
 whenever it reads a token which cannot satisfy any syntax rule.  An
 action in the grammar can also explicitly proclaim an error, using the
 The Bison parser detects a @dfn{parse error} or @dfn{syntax error}
 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} (@pxref{Action Features, ,Special Features for Use in Actions}).
+macro @code{YYERROR} (@pxref{Action Features, ,Special Features for Use
+in Actions}).

 
 The Bison parser expects to report the error by calling an error
 reporting function named @code{yyerror}, which you must supply.  It is
 
 The Bison parser expects to report the error by calling an error
 reporting function named @code{yyerror}, which you must supply.  It is


@@ -3603,10 +3628,11 @@ receives one argument.  For a parse error, the string is normally
 
 @findex YYERROR_VERBOSE
 If you define the macro @code{YYERROR_VERBOSE} in the Bison declarations
 
 @findex YYERROR_VERBOSE
 If you define the macro @code{YYERROR_VERBOSE} in the Bison declarations

-section (@pxref{Bison Declarations, ,The Bison Declarations Section}), then Bison provides a more verbose
-and specific error message string instead of just plain @w{@code{"parse
-error"}}.  It doesn't matter what definition you use for
-@code{YYERROR_VERBOSE}, just whether you define it.
+section (@pxref{Bison Declarations, ,The Bison Declarations Section}),
+then Bison provides a more verbose and specific error message string
+instead of just plain @w{@code{"parse error"}}.  It doesn't matter what
+definition you use for @code{YYERROR_VERBOSE}, just whether you define
+it.

 
 The parser can detect one other kind of error: stack overflow.  This
 happens when the input contains constructions that are very deeply
 
 The parser can detect one other kind of error: stack overflow.  This
 happens when the input contains constructions that are very deeply


@@ -3620,8 +3646,8 @@ The following definition suffices in simple programs:
 
 @example
 @group
 
 @example
 @group

-yyerror (s)
-     char *s;
+void
+yyerror (char *s)

 @{
 @end group
 @group
 @{
 @end group
 @group


@@ -3664,7 +3690,7 @@ specified by the @code{%union} declaration.  @xref{Action Types, ,Data Types of
 
 @item $<@var{typealt}>@var{n}
 Like @code{$@var{n}} but specifies alternative @var{typealt} in the
 
 @item $<@var{typealt}>@var{n}
 Like @code{$@var{n}} but specifies alternative @var{typealt} in the

-union specified by the @code{%union} declaration.  
+union specified by the @code{%union} declaration.

 @xref{Action Types, ,Data Types of Values in Actions}.@refill
 
 @item YYABORT;
 @xref{Action Types, ,Data Types of Values in Actions}.@refill
 
 @item YYABORT;


@@ -3719,7 +3745,7 @@ error rules.  @xref{Error Recovery}.
 
 @item yyerrok;
 Resume generating error messages immediately for subsequent syntax
 
 @item yyerrok;
 Resume generating error messages immediately for subsequent syntax

-errors.  This is useful primarily in error rules.  
+errors.  This is useful primarily in error rules.

 @xref{Error Recovery}.
 
 @item @@@var{n}
 @xref{Error Recovery}.
 
 @item @@@var{n}


@@ -3747,8 +3773,8 @@ The use of this feature makes the parser noticeably slower.
 @end table
 
 @node Algorithm, Error Recovery, Interface, Top
 @end table
 
 @node Algorithm, Error Recovery, Interface, Top

-@chapter The Bison Parser Algorithm 
-@cindex Bison parser algorithm 
+@chapter The Bison Parser Algorithm
+@cindex Bison parser algorithm

 @cindex algorithm of parser
 @cindex shifting
 @cindex reduction
 @cindex algorithm of parser
 @cindex shifting
 @cindex reduction


@@ -4000,33 +4026,33 @@ expr:     expr '-' expr
 
 @noindent
 Suppose the parser has seen the tokens @samp{1}, @samp{-} and @samp{2};
 
 @noindent
 Suppose the parser has seen the tokens @samp{1}, @samp{-} and @samp{2};

-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{)}, we must
-reduce; shifting is invalid because no single rule can reduce the token
-sequence @w{@samp{- 2 )}} or anything starting with that.  But if the next
-token is @samp{*} or @samp{<}, we have a choice: either shifting or
-reduction would allow the parse to complete, but with different
-results.
-
-To decide which one Bison should do, we must consider the
-results.  If the next operator token @var{op} is shifted, then it
-must be reduced first in order to permit another opportunity to
-reduce the difference.  The result is (in effect) @w{@samp{1 - (2
-@var{op} 3)}}.  On the other hand, if the subtraction is reduced
-before shifting @var{op}, the result is @w{@samp{(1 - 2) @var{op}
-3}}.  Clearly, then, the choice of shift or reduce should depend
-on the relative precedence of the operators @samp{-} and
-@var{op}: @samp{*} should be shifted first, but not @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{)}, we
+must reduce; shifting is invalid because no single rule can reduce the
+token sequence @w{@samp{- 2 )}} or anything starting with that.  But if
+the next token is @samp{*} or @samp{<}, we have a choice: either
+shifting or reduction would allow the parse to complete, but with
+different results.
+
+To decide which one Bison should do, we must consider the results.  If
+the next operator token @var{op} is shifted, then it must be reduced
+first in order to permit another opportunity to reduce the difference.
+The result is (in effect) @w{@samp{1 - (2 @var{op} 3)}}.  On the other
+hand, if the subtraction is reduced before shifting @var{op}, the result
+is @w{@samp{(1 - 2) @var{op} 3}}.  Clearly, then, the choice of shift or
+reduce should depend on the relative precedence of the operators
+@samp{-} and @var{op}: @samp{*} should be shifted first, but not
+@samp{<}.

 
 @cindex associativity
 What about input such as @w{@samp{1 - 2 - 5}}; should this be
 
 @cindex associativity
 What about input such as @w{@samp{1 - 2 - 5}}; should this be

-@w{@samp{(1 - 2) - 5}} or should it be @w{@samp{1 - (2 - 5)}}?  For
-most operators we prefer the former, which is called @dfn{left
-association}.  The latter alternative, @dfn{right association}, 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 @w{@samp{1 - 2}} and the look-ahead
-token is @samp{-}: shifting makes right-associativity.
+@w{@samp{(1 - 2) - 5}} or should it be @w{@samp{1 - (2 - 5)}}?  For most
+operators we prefer the former, which is called @dfn{left association}.
+The latter alternative, @dfn{right association}, 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 @w{@samp{1 - 2}} and the look-ahead token is @samp{-}: shifting
+makes right-associativity.

 
 @node Using Precedence, Precedence Examples, Why Precedence, Precedence
 @subsection Specifying Operator Precedence
 
 @node Using Precedence, Precedence Examples, Why Precedence, Precedence
 @subsection Specifying Operator Precedence


@@ -4334,7 +4360,7 @@ name_list:
 @end example
 
 It would seem that this grammar can be parsed with only a single token
 @end example
 
 It would seem that this grammar can be parsed with only a single token

-of look-ahead: when a @code{param_spec} is being read, an @code{ID} is 
+of look-ahead: when a @code{param_spec} is being read, an @code{ID} is

 a @code{name} if a comma or colon follows, or a @code{type} if another
 @code{ID} follows.  In other words, this grammar is LR(1).
 
 a @code{name} if a comma or colon follows, or a @code{type} if another
 @code{ID} follows.  In other words, this grammar is LR(1).
 


@@ -4461,7 +4487,7 @@ recognize the special token @code{error}.  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} token whenever a
 syntax error happens; if you have provided a rule to recognize this token
 is always defined (you need not declare it) and reserved for error
 handling.  The Bison parser generates an @code{error} token whenever a
 syntax error happens; if you have provided a rule to recognize this token

-in the current context, the parse can continue.  
+in the current context, the parse can continue.

 
 For example:
 
 
 For example:
 


@@ -4618,10 +4644,10 @@ Unfortunately, the name being declared is separated from the declaration
 construct itself by a complicated syntactic structure---the ``declarator''.
 
 As a result, part of the Bison parser for C needs to be duplicated, with
 construct itself by a complicated syntactic structure---the ``declarator''.
 
 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:
+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:

 
 @example
 initdcl:
 
 @example
 initdcl:


@@ -4699,7 +4725,7 @@ it is nonzero, all integers are parsed in hexadecimal, and tokens starting
 with letters are parsed as integers if possible.
 
 The declaration of @code{hexflag} shown in the C declarations section of
 with letters are parsed as integers if possible.
 
 The declaration of @code{hexflag} shown in the C declarations section of

-the parser file is needed to make it accessible to the actions 
+the parser file is needed to make it accessible to the actions

 (@pxref{C Declarations, ,The C Declarations Section}).  You must also write the code in @code{yylex}
 to obey the flag.
 
 (@pxref{C Declarations, ,The C Declarations Section}).  You must also write the code in @code{yylex}
 to obey the flag.
 


@@ -4771,7 +4797,7 @@ runs, the @code{yydebug} parser-trace feature can help you figure out why.
 To enable compilation of trace facilities, you must define the macro
 @code{YYDEBUG} when you compile the parser.  You could use
 @samp{-DYYDEBUG=1} as a compiler option or you could put @samp{#define
 To enable compilation of trace facilities, you must define the macro
 @code{YYDEBUG} when you compile the parser.  You could use
 @samp{-DYYDEBUG=1} as a compiler option or you could put @samp{#define

-YYDEBUG 1} in the C declarations section of the grammar file 
+YYDEBUG 1} in the C declarations section of the grammar file

 (@pxref{C Declarations, ,The C Declarations Section}).  Alternatively, use the @samp{-t} option when
 you run Bison (@pxref{Invocation, ,Invoking Bison}).  We always define @code{YYDEBUG} so that
 debugging is always possible.
 (@pxref{C Declarations, ,The C Declarations Section}).  Alternatively, use the @samp{-t} option when
 you run Bison (@pxref{Invocation, ,Invoking Bison}).  We always define @code{YYDEBUG} so that
 debugging is always possible.


@@ -4831,10 +4857,7 @@ calculator (@pxref{Mfcalc Decl, ,Declarations for @code{mfcalc}}):
 #define YYPRINT(file, type, value)   yyprint (file, type, value)
 
 static void
 #define YYPRINT(file, type, value)   yyprint (file, type, value)
 
 static void

-yyprint (file, type, value)
-     FILE *file;
-     int type;
-     YYSTYPE value;
+yyprint (FILE *file, int type, YYSTYPE value)

 @{
   if (type == VAR)
     fprintf (file, " %s", value.tptr->name);
 @{
   if (type == VAR)
     fprintf (file, " %s", value.tptr->name);


@@ -4862,7 +4885,7 @@ with @samp{.tab.c}.  Thus, the @samp{bison foo.y} filename yields
 @file{hack/foo.tab.c}.@refill
 
 @menu
 @file{hack/foo.tab.c}.@refill
 
 @menu

-* Bison Options::     All the options described in detail, 
+* Bison Options::     All the options described in detail,

                        in alphabetical order by short options.
 * Environment Variables::  Variables which affect Bison execution.
 * Option Cross Key::  Alphabetical list of long options.
                        in alphabetical order by short options.
 * Environment Variables::  Variables which affect Bison execution.
 * Option Cross Key::  Alphabetical list of long options.


@@ -4883,25 +4906,56 @@ 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.
 
 short option.  It is followed by a cross key alphabetized by long
 option.
 

-@table @samp
-@item -b @var{file-prefix}
-@itemx --file-prefix=@var{prefix}
-Specify a prefix to use for all Bison output file names.  The names are
-chosen as if the input file were named @file{@var{prefix}.c}.
+@c Please, keep this ordered as in `bison --help'.
+@noindent
+Operations modes:
+@table @option
+@item -h
+@itemx --help
+Print a summary of the command-line options to Bison and exit.

 
 

-@item -d
-@itemx --defines
-Write an extra output file containing macro definitions for the token
-type names defined in the grammar and the semantic value type
-@code{YYSTYPE}, as well as a few @code{extern} variable declarations.
+@item -V
+@itemx --version
+Print the version number of Bison and exit.

 
 

-If the parser output file is named @file{@var{name}.c} then this file
-is named @file{@var{name}.h}.@refill
+@need 1750
+@item -y
+@itemx --yacc
+@itemx --fixed-output-files
+Equivalent to @samp{-o y.tab.c}; the parser output file is called
+@file{y.tab.c}, and the other outputs are called @file{y.output} and
+@file{y.tab.h}.  The purpose of this option is to imitate Yacc's output
+file name conventions.  Thus, the following shell script can substitute
+for Yacc:@refill

 
 

-This output file is essential if you wish to put the definition of
-@code{yylex} in a separate source file, because @code{yylex} needs to
-be able to refer to token type codes and the variable
-@code{yylval}.  @xref{Token Values, ,Semantic Values of Tokens}.@refill
+@example
+bison -y $*
+@end example
+@end table
+
+@noindent
+Tuning the parser:
+
+@table @option
+@item -t
+@itemx --debug
+Output a definition of the macro @code{YYDEBUG} into the parser file,
+so that the debugging facilities are compiled.  @xref{Debugging, ,Debugging Your Parser}.
+
+@item --locations
+Pretend that @code{%locactions} was specified.  @xref{Decl Summary}.
+
+@item -p @var{prefix}
+@itemx --name-prefix=@var{prefix}
+Rename the external symbols used in the parser so that they start with
+@var{prefix} instead of @samp{yy}.  The precise list of symbols renamed
+is @code{yyparse}, @code{yylex}, @code{yyerror}, @code{yynerrs},
+@code{yylval}, @code{yychar} and @code{yydebug}.
+
+For example, if you use @samp{-p c}, the names become @code{cparse},
+@code{clex}, and so on.
+
+@xref{Multiple Parsers, ,Multiple Parsers in the Same Program}.

 
 @item -l
 @itemx --no-lines
 
 @item -l
 @itemx --no-lines


@@ -4921,33 +4975,37 @@ This option also tells Bison to write the C code for the grammar actions
 into a file named @file{@var{filename}.act}, in the form of a
 brace-surrounded body fit for a @code{switch} statement.
 
 into a file named @file{@var{filename}.act}, in the form of a
 brace-surrounded body fit for a @code{switch} statement.
 

-@item -o @var{outfile}
-@itemx --output-file=@var{outfile}
-Specify the name @var{outfile} for the parser file.
+@item -r
+@itemx --raw
+Pretend that @code{%raw} was specified.  @xref{Decl Summary}.

 
 

-The other output files' names are constructed from @var{outfile}
-as described under the @samp{-v} and @samp{-d} options.
+@item -k
+@itemx --token-table
+Pretend that @code{%token_table} was specified.  @xref{Decl Summary}.
+@end table

 
 

-@item -p @var{prefix}
-@itemx --name-prefix=@var{prefix}
-Rename the external symbols used in the parser so that they start with
-@var{prefix} instead of @samp{yy}.  The precise list of symbols renamed
-is @code{yyparse}, @code{yylex}, @code{yyerror}, @code{yynerrs},
-@code{yylval}, @code{yychar} and @code{yydebug}.
+@noindent
+Adjust the output:

 
 

-For example, if you use @samp{-p c}, the names become @code{cparse},
-@code{clex}, and so on.
+@table @option
+@item -d
+@itemx --defines
+Write an extra output file containing macro definitions for the token
+type names defined in the grammar and the semantic value type
+@code{YYSTYPE}, as well as a few @code{extern} variable declarations.

 
 

-@xref{Multiple Parsers, ,Multiple Parsers in the Same Program}.
+If the parser output file is named @file{@var{name}.c} then this file
+is named @file{@var{name}.h}.@refill

 
 

-@item -r
-@itemx --raw
-Pretend that @code{%raw} was specified.  @xref{Decl Summary}.
+This output file is essential if you wish to put the definition of
+@code{yylex} in a separate source file, because @code{yylex} needs to
+be able to refer to token type codes and the variable
+@code{yylval}.  @xref{Token Values, ,Semantic Values of Tokens}.@refill

 
 

-@item -t
-@itemx --debug
-Output a definition of the macro @code{YYDEBUG} into the parser file,
-so that the debugging facilities are compiled.  @xref{Debugging, ,Debugging Your Parser}.
+@item -b @var{file-prefix}
+@itemx --file-prefix=@var{prefix}
+Specify a prefix to use for all Bison output file names.  The names are
+chosen as if the input file were named @file{@var{prefix}.c}.

 
 @item -v
 @itemx --verbose
 
 @item -v
 @itemx --verbose


@@ -4965,27 +5023,12 @@ Therefore, if the input file is @file{foo.y}, then the parser file is
 called @file{foo.tab.c} by default.  As a consequence, the verbose
 output file is called @file{foo.output}.@refill
 
 called @file{foo.tab.c} by default.  As a consequence, the verbose
 output file is called @file{foo.output}.@refill
 

-@item -V
-@itemx --version
-Print the version number of Bison and exit.
-
-@item -h
-@itemx --help
-Print a summary of the command-line options to Bison and exit.
-
-@need 1750
-@item -y
-@itemx --yacc
-@itemx --fixed-output-files
-Equivalent to @samp{-o y.tab.c}; the parser output file is called
-@file{y.tab.c}, and the other outputs are called @file{y.output} and
-@file{y.tab.h}.  The purpose of this option is to imitate Yacc's output
-file name conventions.  Thus, the following shell script can substitute
-for Yacc:@refill
+@item -o @var{outfile}
+@itemx --output-file=@var{outfile}
+Specify the name @var{outfile} for the parser file.

 
 

-@example
-bison -y $*
-@end example
+The other output files' names are constructed from @var{outfile}
+as described under the @samp{-v} and @samp{-d} options.

 @end table
 
 @node Environment Variables, Option Cross Key, Bison Options, Invocation
 @end table
 
 @node Environment Variables, Option Cross Key, Bison Options, Invocation


@@ -5006,7 +5049,7 @@ would like to direct Bison to use a different copy, setting the
 environment variable @code{BISON_SIMPLE} to the path of the file will
 cause Bison to use that copy instead.
 
 environment variable @code{BISON_SIMPLE} to the path of the file will
 cause Bison to use that copy instead.
 

-When the @samp{%semantic_parser} delcaration is used, Bison copies from
+When the @samp{%semantic_parser} declaration is used, Bison copies from

 a file called @file{bison.hairy} instead.  The location of this file can
 also be specified or overridden in a similar fashion, with the
 @code{BISON_HAIRY} environment variable.
 a file called @file{bison.hairy} instead.  The location of this file can
 also be specified or overridden in a similar fashion, with the
 @code{BISON_HAIRY} environment variable.


@@ -5051,7 +5094,7 @@ the corresponding short option.
 --no-lines                            -l
 --no-parser                           -n
 --output-file=@var{outfile}                 -o @var{outfile}
 --no-lines                            -l
 --no-parser                           -n
 --output-file=@var{outfile}                 -o @var{outfile}

---raw                                 -r                       
+--raw                                 -r

 --token-table                         -k
 --verbose                             -v
 --version                             -V
 --token-table                         -k
 --verbose                             -v
 --version                             -V


@@ -5105,11 +5148,12 @@ token is reset to the token that originally caused the violation.
 @item YYABORT
 Macro to pretend that an unrecoverable syntax error has occurred, by
 making @code{yyparse} return 1 immediately.  The error reporting
 @item YYABORT
 Macro to pretend that an unrecoverable syntax error has occurred, by
 making @code{yyparse} return 1 immediately.  The error reporting

-function @code{yyerror} is not called.  @xref{Parser Function, ,The Parser Function @code{yyparse}}.
+function @code{yyerror} is not called.  @xref{Parser Function, ,The
+Parser Function @code{yyparse}}.

 
 @item YYACCEPT
 Macro to pretend that a complete utterance of the language has been
 
 @item YYACCEPT
 Macro to pretend that a complete utterance of the language has been

-read, by making @code{yyparse} return 0 immediately.  
+read, by making @code{yyparse} return 0 immediately.

 @xref{Parser Function, ,The Parser Function @code{yyparse}}.
 
 @item YYBACKUP
 @xref{Parser Function, ,The Parser Function @code{yyparse}}.
 
 @item YYBACKUP


@@ -5160,10 +5204,10 @@ Macro for the data type of semantic values; @code{int} by default.
 @xref{Value Type, ,Data Types of Semantic Values}.
 
 @item yychar
 @xref{Value Type, ,Data Types of Semantic Values}.
 
 @item yychar

-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}.)  Error-recovery rule actions may examine this
-variable.  @xref{Action Features, ,Special Features for Use in Actions}.
+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}.)  Error-recovery rule actions may examine this variable.
+@xref{Action Features, ,Special Features for Use in Actions}.

 
 @item yyclearin
 Macro used in error-recovery rule actions.  It clears the previous
 
 @item yyclearin
 Macro used in error-recovery rule actions.  It clears the previous


@@ -5181,7 +5225,8 @@ after a parse error.  @xref{Error Recovery}.
 @item yyerror
 User-supplied function to be called by @code{yyparse} on error.  The
 function receives one argument, a pointer to a character string
 @item yyerror
 User-supplied function to be called by @code{yyparse} on error.  The
 function receives one argument, a pointer to a character string

-containing an error message.  @xref{Error Reporting, ,The Error Reporting Function @code{yyerror}}.
+containing an error message.  @xref{Error Reporting, ,The Error
+Reporting Function @code{yyerror}}.

 
 @item yylex
 User-supplied lexical analyzer function, called with no arguments
 
 @item yylex
 User-supplied lexical analyzer function, called with no arguments


@@ -5194,16 +5239,17 @@ variable within @code{yyparse}, and its address is passed to
 @code{yylex}.)  @xref{Token Values, ,Semantic Values of Tokens}.
 
 @item yylloc
 @code{yylex}.)  @xref{Token Values, ,Semantic Values of Tokens}.
 
 @item yylloc

-External variable in which @code{yylex} should place the line and
-column numbers associated with a token.  (In a pure parser, it is a
-local variable within @code{yyparse}, and its address is passed to
+External variable in which @code{yylex} should place the line and column
+numbers associated with a token.  (In a pure parser, it is a local
+variable within @code{yyparse}, and its address is passed to

 @code{yylex}.)  You can ignore this variable if you don't use the
 @code{yylex}.)  You can ignore this variable if you don't use the

-@samp{@@} feature in the grammar actions.  @xref{Token Positions, ,Textual Positions of Tokens}.
+@samp{@@} feature in the grammar actions.  @xref{Token Positions,
+,Textual Positions of Tokens}.

 
 @item yynerrs
 
 @item yynerrs

-Global variable which Bison increments each time there is a parse
-error.  (In a pure parser, it is a local variable within
-@code{yyparse}.)  @xref{Error Reporting, ,The Error Reporting Function @code{yyerror}}.
+Global variable which Bison increments each time there is a parse error.
+(In a pure parser, it is a local variable within @code{yyparse}.)
+@xref{Error Reporting, ,The Error Reporting Function @code{yyerror}}.

 
 @item yyparse
 The parser function produced by Bison; call this function to start
 
 @item yyparse
 The parser function produced by Bison; call this function to start


@@ -5218,7 +5264,7 @@ Bison declaration to avoid generating @code{#line} directives in the
 parser file.  @xref{Decl Summary}.
 
 @item %nonassoc
 parser file.  @xref{Decl Summary}.
 
 @item %nonassoc

-Bison declaration to assign nonassociativity to token(s).
+Bison declaration to assign non-associativity to token(s).

 @xref{Precedence Decl, ,Operator Precedence}.
 
 @item %prec
 @xref{Precedence Decl, ,Operator Precedence}.
 
 @item %prec


@@ -5266,15 +5312,17 @@ Bison declarations section or the additional C code section.
 @xref{Grammar Layout, ,The Overall Layout of a Bison Grammar}.
 
 @item %@{ %@}
 @xref{Grammar Layout, ,The Overall Layout of a Bison Grammar}.
 
 @item %@{ %@}

-All code listed between @samp{%@{} and @samp{%@}} is copied directly
-to the output file uninterpreted.  Such code forms the ``C
-declarations'' section of the input file.  @xref{Grammar Outline, ,Outline of a Bison Grammar}.
+All code listed between @samp{%@{} and @samp{%@}} is copied directly to
+the output file uninterpreted.  Such code forms the ``C declarations''
+section of the input file.  @xref{Grammar Outline, ,Outline of a Bison
+Grammar}.

 
 @item /*@dots{}*/
 Comment delimiters, as in C.
 
 @item :
 
 @item /*@dots{}*/
 Comment delimiters, as in C.
 
 @item :

-Separates a rule's result from its components.  @xref{Rules, ,Syntax of Grammar Rules}.
+Separates a rule's result from its components.  @xref{Rules, ,Syntax of
+Grammar Rules}.

 
 @item ;
 Terminates a rule.  @xref{Rules, ,Syntax of Grammar Rules}.
 
 @item ;
 Terminates a rule.  @xref{Rules, ,Syntax of Grammar Rules}.


@@ -5291,13 +5339,15 @@ Separates alternate rules for the same result nonterminal.
 @table @asis
 @item Backus-Naur Form (BNF)
 Formal method of specifying context-free grammars.  BNF was first used
 @table @asis
 @item Backus-Naur Form (BNF)
 Formal method of specifying context-free grammars.  BNF was first used

-in the @cite{ALGOL-60} report, 1963.  @xref{Language and Grammar, ,Languages and Context-Free Grammars}.
+in the @cite{ALGOL-60} report, 1963.  @xref{Language and Grammar,
+,Languages and Context-Free Grammars}.

 
 @item Context-free grammars
 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 @emph{anywhere} an expression is
 
 @item Context-free grammars
 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 @emph{anywhere} an expression is

-permitted.  @xref{Language and Grammar, ,Languages and Context-Free Grammars}.
+permitted.  @xref{Language and Grammar, ,Languages and Context-Free
+Grammars}.

 
 @item Dynamic allocation
 Allocation of memory that occurs during execution, rather than at
 
 @item Dynamic allocation
 Allocation of memory that occurs during execution, rather than at


@@ -5317,7 +5367,7 @@ rules.  @xref{Algorithm, ,The Bison Parser Algorithm }.
 
 @item Grouping
 A language construct that is (in general) grammatically divisible;
 
 @item Grouping
 A language construct that is (in general) grammatically divisible;

-for example, `expression' or `declaration' in C.  
+for example, `expression' or `declaration' in C.

 @xref{Language and Grammar, ,Languages and Context-Free Grammars}.
 
 @item Infix operator
 @xref{Language and Grammar, ,Languages and Context-Free Grammars}.
 
 @item Infix operator


@@ -5338,8 +5388,9 @@ Operators having left associativity are analyzed from left to right:
 @samp{c}.  @xref{Precedence, ,Operator Precedence}.
 
 @item Left recursion
 @samp{c}.  @xref{Precedence, ,Operator Precedence}.
 
 @item Left recursion

-A rule whose result symbol is also its first component symbol;
-for example, @samp{expseq1 : expseq1 ',' exp;}.  @xref{Recursion, ,Recursive Rules}.
+A rule whose result symbol is also its first component symbol; for
+example, @samp{expseq1 : expseq1 ',' exp;}.  @xref{Recursion, ,Recursive
+Rules}.

 
 @item Left-to-right parsing
 Parsing a sentence of a language by analyzing it token by token from
 
 @item Left-to-right parsing
 Parsing a sentence of a language by analyzing it token by token from


@@ -5354,11 +5405,11 @@ A flag, set by actions in the grammar rules, which alters the way
 tokens are parsed.  @xref{Lexical Tie-ins}.
 
 @item Literal string token
 tokens are parsed.  @xref{Lexical Tie-ins}.
 
 @item Literal string token

-A token which consists of two or more fixed characters.
-@xref{Symbols}.
+A token which consists of two or more fixed characters.  @xref{Symbols}.

 
 @item Look-ahead token
 
 @item Look-ahead token

-A token already read but not yet shifted.  @xref{Look-Ahead, ,Look-Ahead Tokens}.
+A token already read but not yet shifted.  @xref{Look-Ahead, ,Look-Ahead
+Tokens}.

 
 @item LALR(1)
 The class of context-free grammars that Bison (like most other parser
 
 @item LALR(1)
 The class of context-free grammars that Bison (like most other parser


@@ -5389,7 +5440,8 @@ performs some operation.
 
 @item Reduction
 Replacing a string of nonterminals and/or terminals with a single
 
 @item Reduction
 Replacing a string of nonterminals and/or terminals with a single

-nonterminal, according to a grammar rule.  @xref{Algorithm, ,The Bison Parser Algorithm }.
+nonterminal, according to a grammar rule.  @xref{Algorithm, ,The Bison
+Parser Algorithm }.

 
 @item Reentrant
 A reentrant subprogram is a subprogram which can be in invoked any
 
 @item Reentrant
 A reentrant subprogram is a subprogram which can be in invoked any


@@ -5400,8 +5452,9 @@ invocations.  @xref{Pure Decl, ,A Pure (Reentrant) Parser}.
 A language in which all operators are postfix operators.
 
 @item Right recursion
 A language in which all operators are postfix operators.
 
 @item Right recursion

-A rule whose result symbol is also its last component symbol;
-for example, @samp{expseq1: exp ',' expseq1;}.  @xref{Recursion, ,Recursive Rules}.
+A rule whose result symbol is also its last component symbol; for
+example, @samp{expseq1: exp ',' expseq1;}.  @xref{Recursion, ,Recursive
+Rules}.

 
 @item Semantics
 In computer languages, the semantics are specified by the actions
 
 @item Semantics
 In computer languages, the semantics are specified by the actions


@@ -5420,7 +5473,7 @@ A single character that is recognized and interpreted as is.
 @item Start symbol
 The nonterminal symbol that stands for a complete valid utterance in
 the language being parsed.  The start symbol is usually listed as the
 @item Start symbol
 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.  
+first nonterminal symbol in a language specification.

 @xref{Start Decl, ,The Start-Symbol}.
 
 @item Symbol table
 @xref{Start Decl, ,The Start-Symbol}.
 
 @item Symbol table


@@ -5435,9 +5488,9 @@ The input of the Bison parser is a stream of tokens which comes from
 the lexical analyzer.  @xref{Symbols}.
 
 @item Terminal symbol
 the lexical analyzer.  @xref{Symbols}.
 
 @item Terminal symbol

-A grammar symbol that has no rules in the grammar and therefore
-is grammatically indivisible.  The piece of text it represents
-is a token.  @xref{Language and Grammar, ,Languages and Context-Free Grammars}.
+A grammar symbol that has no rules in the grammar and therefore is
+grammatically indivisible.  The piece of text it represents is a token.
+@xref{Language and Grammar, ,Languages and Context-Free Grammars}.

 @end table
 
 @node Index,  , Glossary, Top
 @end table
 
 @node Index,  , Glossary, Top


@@ -5445,34 +5498,4 @@ is a token.  @xref{Language and Grammar, ,Languages and Context-Free Grammars}.
 
 @printindex cp
 
 
 @printindex cp
 

-@contents
-

 @bye
 @bye

-
-
-\f
-
-@c old menu
-
-* Introduction::
-* Conditions::
-* Copying::           The GNU General Public License says
-                        how you can copy and share Bison
-
-Tutorial sections:
-* Concepts::          Basic concepts for understanding Bison.
-* Examples::          Three simple explained examples of using Bison.
-
-Reference sections:
-* Grammar File::      Writing Bison declarations and rules.
-* Interface::         C-language interface to the parser function @code{yyparse}.
-* Algorithm::         How the Bison parser works at run-time.
-* Error Recovery::    Writing rules for error recovery.
-* Context Dependency::What to do if your language syntax is too
-                        messy for Bison to handle straightforwardly.
-* Debugging::         Debugging Bison parsers that parse wrong.
-* Invocation::        How to run Bison (to produce the parser source file).
-* Table of Symbols::  All the keywords of the Bison language are explained.
-* Glossary::          Basic concepts are explained.
-* Index::             Cross-references to the text.
-