2001-08-10 Pascal Bart <pascal.bart@epita.fr>
- * doc/bison.texinfo: Include GNU General Public License from
+ * doc/bison.texinfo: Include GNU General Public License from
`gpl.texi'.
* doc/gpl.texi: Add to package.
* src/vcg.c (complain.h): Include it.
Unepitaize `return' invocations.
[NDEBUG] (main): Remove.
- * src/vcg.h (node_t, edge_t, graph_t): Constify the char * memebers.
+ * src/vcg.h (node_t, edge_t, graph_t): Constify the char * members.
* src/files.c (open_files): Initialize graph_obstack.
* src/print_graph.c (print_actions): CPP out useless code.
(print_core): Don't output the last `\n' in labels.
info_TEXINFOS = bison.texinfo
man_MANS = bison.1
+bison_TEXINFOS = gpl.texi
EXTRA_DIST = FAQ bison.1 bison.rnh refcard.tex
MANS = $(man_MANS)
NROFF = nroff
-DIST_COMMON = Makefile.am Makefile.in stamp-vti version.texi
+DIST_COMMON = $(bison_TEXINFOS) Makefile.am Makefile.in stamp-vti \
+version.texi
DISTFILES = $(DIST_COMMON) $(SOURCES) $(HEADERS) $(TEXINFOS) $(EXTRA_DIST)
maintainer-clean-vti:
-rm -f $(srcdir)/stamp-vti $(srcdir)/version.texi
-bison.info: bison.texinfo version.texi
-bison.dvi: bison.texinfo version.texi
+bison.info: bison.texinfo version.texi $(bison_TEXINFOS)
+bison.dvi: bison.texinfo version.texi $(bison_TEXINFOS)
DVIPS = dvips
\1f
Indirect:
bison.info-1: 1307
-bison.info-2: 50189
-bison.info-3: 99814
-bison.info-4: 148012
-bison.info-5: 190796
+bison.info-2: 50202
+bison.info-3: 99827
+bison.info-4: 148025
+bison.info-5: 190809
\1f
Tag Table:
(Indirect)
Node: Introduction\7f8543
Node: Conditions\7f9818
Node: Copying\7f11282
-Node: Concepts\7f30472
-Node: Language and Grammar\7f31551
-Node: Grammar in Bison\7f36567
-Node: Semantic Values\7f38491
-Node: Semantic Actions\7f40592
-Node: Locations Overview\7f41781
-Node: Bison Parser\7f43228
-Node: Stages\7f45540
-Node: Grammar Layout\7f46823
-Node: Examples\7f48080
-Node: RPN Calc\7f49215
-Node: Rpcalc Decls\7f50189
-Node: Rpcalc Rules\7f51776
-Node: Rpcalc Input\7f53576
-Node: Rpcalc Line\7f55037
-Node: Rpcalc Expr\7f56152
-Node: Rpcalc Lexer\7f58097
-Node: Rpcalc Main\7f60669
-Node: Rpcalc Error\7f61067
-Node: Rpcalc Gen\7f62075
-Node: Rpcalc Compile\7f63224
-Node: Infix Calc\7f64099
-Node: Simple Error Recovery\7f66806
-Node: Multi-function Calc\7f68692
-Node: Mfcalc Decl\7f70258
-Node: Mfcalc Rules\7f72281
-Node: Mfcalc Symtab\7f73661
-Node: Exercises\7f80034
-Node: Grammar File\7f80540
-Node: Grammar Outline\7f81388
-Node: C Declarations\7f82122
-Node: Bison Declarations\7f82702
-Node: Grammar Rules\7f83114
-Node: C Code\7f83574
-Node: Symbols\7f84504
-Node: Rules\7f89585
-Node: Recursion\7f91224
-Node: Semantics\7f92943
-Node: Value Type\7f94037
-Node: Multiple Types\7f94709
-Node: Actions\7f95726
-Node: Action Types\7f98511
-Node: Mid-Rule Actions\7f99814
-Node: Locations\7f105384
-Node: Location Type\7f106032
-Node: Actions and Locations\7f106590
-Node: Location Default Action\7f108746
-Node: Declarations\7f110209
-Node: Token Decl\7f111528
-Node: Precedence Decl\7f113541
-Node: Union Decl\7f115092
-Node: Type Decl\7f115936
-Node: Expect Decl\7f116842
-Node: Start Decl\7f118388
-Node: Pure Decl\7f118766
-Node: Decl Summary\7f120443
-Node: Multiple Parsers\7f125826
-Node: Interface\7f127320
-Node: Parser Function\7f128192
-Node: Lexical\7f129027
-Node: Calling Convention\7f130433
-Node: Token Values\7f133204
-Node: Token Positions\7f134353
-Node: Pure Calling\7f135238
-Node: Error Reporting\7f138170
-Node: Action Features\7f140292
-Node: Algorithm\7f143587
-Node: Look-Ahead\7f145880
-Node: Shift/Reduce\7f148012
-Node: Precedence\7f150924
-Node: Why Precedence\7f151575
-Node: Using Precedence\7f153440
-Node: Precedence Examples\7f154408
-Node: How Precedence\7f155109
-Node: Contextual Precedence\7f156258
-Node: Parser States\7f158049
-Node: Reduce/Reduce\7f159292
-Node: Mystery Conflicts\7f162853
-Node: Stack Overflow\7f166239
-Node: Error Recovery\7f167612
-Node: Context Dependency\7f172748
-Node: Semantic Tokens\7f173596
-Node: Lexical Tie-ins\7f176613
-Node: Tie-in Recovery\7f178161
-Node: Debugging\7f180333
-Node: Invocation\7f183634
-Node: Bison Options\7f184886
-Node: Environment Variables\7f188320
-Node: Option Cross Key\7f189168
-Node: VMS Invocation\7f190012
-Node: Table of Symbols\7f190796
-Node: Glossary\7f198189
-Node: Index\7f204479
+Node: Concepts\7f30485
+Node: Language and Grammar\7f31564
+Node: Grammar in Bison\7f36580
+Node: Semantic Values\7f38504
+Node: Semantic Actions\7f40605
+Node: Locations Overview\7f41794
+Node: Bison Parser\7f43241
+Node: Stages\7f45553
+Node: Grammar Layout\7f46836
+Node: Examples\7f48093
+Node: RPN Calc\7f49228
+Node: Rpcalc Decls\7f50202
+Node: Rpcalc Rules\7f51789
+Node: Rpcalc Input\7f53589
+Node: Rpcalc Line\7f55050
+Node: Rpcalc Expr\7f56165
+Node: Rpcalc Lexer\7f58110
+Node: Rpcalc Main\7f60682
+Node: Rpcalc Error\7f61080
+Node: Rpcalc Gen\7f62088
+Node: Rpcalc Compile\7f63237
+Node: Infix Calc\7f64112
+Node: Simple Error Recovery\7f66819
+Node: Multi-function Calc\7f68705
+Node: Mfcalc Decl\7f70271
+Node: Mfcalc Rules\7f72294
+Node: Mfcalc Symtab\7f73674
+Node: Exercises\7f80047
+Node: Grammar File\7f80553
+Node: Grammar Outline\7f81401
+Node: C Declarations\7f82135
+Node: Bison Declarations\7f82715
+Node: Grammar Rules\7f83127
+Node: C Code\7f83587
+Node: Symbols\7f84517
+Node: Rules\7f89598
+Node: Recursion\7f91237
+Node: Semantics\7f92956
+Node: Value Type\7f94050
+Node: Multiple Types\7f94722
+Node: Actions\7f95739
+Node: Action Types\7f98524
+Node: Mid-Rule Actions\7f99827
+Node: Locations\7f105397
+Node: Location Type\7f106045
+Node: Actions and Locations\7f106603
+Node: Location Default Action\7f108759
+Node: Declarations\7f110222
+Node: Token Decl\7f111541
+Node: Precedence Decl\7f113554
+Node: Union Decl\7f115105
+Node: Type Decl\7f115949
+Node: Expect Decl\7f116855
+Node: Start Decl\7f118401
+Node: Pure Decl\7f118779
+Node: Decl Summary\7f120456
+Node: Multiple Parsers\7f125839
+Node: Interface\7f127333
+Node: Parser Function\7f128205
+Node: Lexical\7f129040
+Node: Calling Convention\7f130446
+Node: Token Values\7f133217
+Node: Token Positions\7f134366
+Node: Pure Calling\7f135251
+Node: Error Reporting\7f138183
+Node: Action Features\7f140305
+Node: Algorithm\7f143600
+Node: Look-Ahead\7f145893
+Node: Shift/Reduce\7f148025
+Node: Precedence\7f150937
+Node: Why Precedence\7f151588
+Node: Using Precedence\7f153453
+Node: Precedence Examples\7f154421
+Node: How Precedence\7f155122
+Node: Contextual Precedence\7f156271
+Node: Parser States\7f158062
+Node: Reduce/Reduce\7f159305
+Node: Mystery Conflicts\7f162866
+Node: Stack Overflow\7f166252
+Node: Error Recovery\7f167625
+Node: Context Dependency\7f172761
+Node: Semantic Tokens\7f173609
+Node: Lexical Tie-ins\7f176626
+Node: Tie-in Recovery\7f178174
+Node: Debugging\7f180346
+Node: Invocation\7f183647
+Node: Bison Options\7f184899
+Node: Environment Variables\7f188333
+Node: Option Cross Key\7f189181
+Node: VMS Invocation\7f190025
+Node: Table of Symbols\7f190809
+Node: Glossary\7f198202
+Node: Index\7f204492
\1f
End Tag Table
**************************
Version 2, June 1991
+
Copyright (C) 1989, 1991 Free Software Foundation, Inc.
- 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA
+ 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.
END OF TERMS AND CONDITIONS
-How to Apply These Terms to Your New Programs
-=============================================
+Appendix: How to Apply These Terms to Your New Programs
+=======================================================
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
the "copyright" line and a pointer to where the full notice is found.
ONE LINE TO GIVE THE PROGRAM'S NAME AND A BRIEF IDEA OF WHAT IT DOES.
- Copyright (C) 19YY NAME OF AUTHOR
+ Copyright (C) YYYY NAME OF AUTHOR
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
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.
+ Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
Also add information on how to contact you by electronic and paper
mail.
this when it starts in an interactive mode:
Gnomovision version 69, Copyright (C) 19YY NAME OF AUTHOR
- Gnomovision comes with ABSOLUTELY NO WARRANTY; for details
- type `show w'.
+ 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.
@ifinfo
This file documents the Bison parser generator.
-Copyright (C) 1988, 1989, 1990, 1991, 1992, 1993, 1995, 1998, 1999, 2000
+Copyright (C) 1988, 1989, 1990, 1991, 1992, 1993, 1995, 1998, 1999,
+2000, 2001
Free Software Foundation, Inc.
Permission is granted to make and distribute verbatim copies of
@page
@vskip 0pt plus 1filll
Copyright @copyright{} 1988, 1989, 1990, 1991, 1992, 1993, 1995, 1998,
-1999, 2000
+1999, 2000, 2001
Free Software Foundation, Inc.
@sp 2
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{@@$} to the
beginning of the first symbol, and the end of @code{@@$} to the end of the
-last symbol.
+last symbol.
With this default action, the location tracking can be fully automatic. The
example above simply rewrites this way:
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
+to redefine the default action to take for each rule. The
@code{YYLLOC_DEFAULT} macro is called each time a rule is matched, before the
-associated action is run.
+associated action is run.
Most of the time, this macro is general enough to suppress location
-dedicated code from semantic actions.
+dedicated code from semantic actions.
-The @code{YYLLOC_DEFAULT} 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
+The @code{YYLLOC_DEFAULT} 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.
By default, it is defined this way:
When defining @code{YYLLOC_DEFAULT}, you should consider that:
@itemize @bullet
-@item
+@item
All arguments are free of side-effects. However, only the first one (the
result) should be modified by @code{YYLLOC_DEFAULT}.
with @samp{.tab.c}. Thus, the @samp{bison foo.y} filename yields
@file{foo.tab.c}, and the @samp{bison hack/foo.y} filename yields
@file{hack/foo.tab.c}. It's is also possible, in case you are writting
-C++ code instead of C in your grammar file, to name it @file{foo.ypp}
+C++ code instead of C in your grammar file, to name it @file{foo.ypp}
or @file{foo.y++}. Then, the output files will take an extention like
the given one as input (repectively @file{foo.tab.cpp} and @file{foo.tab.c++}).
This feature takes effect with all options that manipulate filenames like
-@set UPDATED 10 August 2001
+@set UPDATED 13 August 2001
@set EDITION 1.28c
@set VERSION 1.28c
-@set UPDATED 10 August 2001
+@set UPDATED 13 August 2001
@set EDITION 1.28c
@set VERSION 1.28c
quote.h quote.c quotearg.h quotearg.c \
xalloc.h xmalloc.c xstrdup.c
-libbison_a_LIBADD = @LIBOBJS@ @ALLOCA@
+libbison_a_LIBADD = @LIBOBJS@
libbison_a_DEPENDENCIES = $(libbison_a_LIBADD)
libbison_a_SOURCES = error.c error.h getopt.h getopt.c getopt1.c obstack.h obstack.c quote.h quote.c quotearg.h quotearg.c xalloc.h xmalloc.c xstrdup.c
-libbison_a_LIBADD = @LIBOBJS@ @ALLOCA@
+libbison_a_LIBADD = @LIBOBJS@
libbison_a_DEPENDENCIES = $(libbison_a_LIBADD)
mkinstalldirs = $(SHELL) $(top_srcdir)/config/mkinstalldirs
CONFIG_HEADER = ../config.h
COMPILE = $(CC) $(DEFS) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS)
CCLD = $(CC)
LINK = $(CCLD) $(AM_CFLAGS) $(CFLAGS) $(LDFLAGS) -o $@
-DIST_COMMON = Makefile.am Makefile.in alloca.c ansi2knr.1 ansi2knr.c \
-memchr.c stpcpy.c strndup.c strnlen.c strspn.c
+DIST_COMMON = Makefile.am Makefile.in ansi2knr.1 ansi2knr.c memchr.c \
+stpcpy.c strndup.c strnlen.c strspn.c
DISTFILES = $(DIST_COMMON) $(SOURCES) $(HEADERS) $(TEXINFOS) $(EXTRA_DIST)
TAR = tar
GZIP_ENV = --best
-DEP_FILES = .deps/alloca.P .deps/error.P .deps/getopt.P .deps/getopt1.P \
-.deps/memchr.P .deps/obstack.P .deps/quote.P .deps/quotearg.P \
-.deps/stpcpy.P .deps/strndup.P .deps/strnlen.P .deps/strspn.P \
-.deps/xmalloc.P .deps/xstrdup.P
+DEP_FILES = .deps/error.P .deps/getopt.P .deps/getopt1.P .deps/memchr.P \
+.deps/obstack.P .deps/quote.P .deps/quotearg.P .deps/stpcpy.P \
+.deps/strndup.P .deps/strnlen.P .deps/strspn.P .deps/xmalloc.P \
+.deps/xstrdup.P
SOURCES = $(libbison_a_SOURCES)
OBJECTS = $(libbison_a_OBJECTS)
projects / bison.git / commitdiff
