alloca.c, alloca.h and allocate.c are really to be removed.

This commit is contained in:
Akim Demaille
2001-08-13 14:54:50 +00:00
parent fabd3b431d
commit 79282c6c57
11 changed files with 133 additions and 131 deletions

View File

@@ -1,6 +1,6 @@
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.
@@ -62,7 +62,7 @@
* 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.

View File

@@ -98,6 +98,7 @@ AUTOMAKE_OPTIONS = 1.4
info_TEXINFOS = bison.texinfo
man_MANS = bison.1
bison_TEXINFOS = gpl.texi
EXTRA_DIST = FAQ bison.1 bison.rnh refcard.tex
@@ -114,7 +115,8 @@ man1dir = $(mandir)/man1
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)
@@ -155,8 +157,8 @@ distclean-vti:
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

View File

@@ -31,10 +31,10 @@ instead of in the original English.

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

Tag Table:
(Indirect)
@@ -42,98 +42,98 @@ Node: Top1307
Node: Introduction8543
Node: Conditions9818
Node: Copying11282
Node: Concepts30472
Node: Language and Grammar31551
Node: Grammar in Bison36567
Node: Semantic Values38491
Node: Semantic Actions40592
Node: Locations Overview41781
Node: Bison Parser43228
Node: Stages45540
Node: Grammar Layout46823
Node: Examples48080
Node: RPN Calc49215
Node: Rpcalc Decls50189
Node: Rpcalc Rules51776
Node: Rpcalc Input53576
Node: Rpcalc Line55037
Node: Rpcalc Expr56152
Node: Rpcalc Lexer58097
Node: Rpcalc Main60669
Node: Rpcalc Error61067
Node: Rpcalc Gen62075
Node: Rpcalc Compile63224
Node: Infix Calc64099
Node: Simple Error Recovery66806
Node: Multi-function Calc68692
Node: Mfcalc Decl70258
Node: Mfcalc Rules72281
Node: Mfcalc Symtab73661
Node: Exercises80034
Node: Grammar File80540
Node: Grammar Outline81388
Node: C Declarations82122
Node: Bison Declarations82702
Node: Grammar Rules83114
Node: C Code83574
Node: Symbols84504
Node: Rules89585
Node: Recursion91224
Node: Semantics92943
Node: Value Type94037
Node: Multiple Types94709
Node: Actions95726
Node: Action Types98511
Node: Mid-Rule Actions99814
Node: Locations105384
Node: Location Type106032
Node: Actions and Locations106590
Node: Location Default Action108746
Node: Declarations110209
Node: Token Decl111528
Node: Precedence Decl113541
Node: Union Decl115092
Node: Type Decl115936
Node: Expect Decl116842
Node: Start Decl118388
Node: Pure Decl118766
Node: Decl Summary120443
Node: Multiple Parsers125826
Node: Interface127320
Node: Parser Function128192
Node: Lexical129027
Node: Calling Convention130433
Node: Token Values133204
Node: Token Positions134353
Node: Pure Calling135238
Node: Error Reporting138170
Node: Action Features140292
Node: Algorithm143587
Node: Look-Ahead145880
Node: Shift/Reduce148012
Node: Precedence150924
Node: Why Precedence151575
Node: Using Precedence153440
Node: Precedence Examples154408
Node: How Precedence155109
Node: Contextual Precedence156258
Node: Parser States158049
Node: Reduce/Reduce159292
Node: Mystery Conflicts162853
Node: Stack Overflow166239
Node: Error Recovery167612
Node: Context Dependency172748
Node: Semantic Tokens173596
Node: Lexical Tie-ins176613
Node: Tie-in Recovery178161
Node: Debugging180333
Node: Invocation183634
Node: Bison Options184886
Node: Environment Variables188320
Node: Option Cross Key189168
Node: VMS Invocation190012
Node: Table of Symbols190796
Node: Glossary198189
Node: Index204479
Node: Concepts30485
Node: Language and Grammar31564
Node: Grammar in Bison36580
Node: Semantic Values38504
Node: Semantic Actions40605
Node: Locations Overview41794
Node: Bison Parser43241
Node: Stages45553
Node: Grammar Layout46836
Node: Examples48093
Node: RPN Calc49228
Node: Rpcalc Decls50202
Node: Rpcalc Rules51789
Node: Rpcalc Input53589
Node: Rpcalc Line55050
Node: Rpcalc Expr56165
Node: Rpcalc Lexer58110
Node: Rpcalc Main60682
Node: Rpcalc Error61080
Node: Rpcalc Gen62088
Node: Rpcalc Compile63237
Node: Infix Calc64112
Node: Simple Error Recovery66819
Node: Multi-function Calc68705
Node: Mfcalc Decl70271
Node: Mfcalc Rules72294
Node: Mfcalc Symtab73674
Node: Exercises80047
Node: Grammar File80553
Node: Grammar Outline81401
Node: C Declarations82135
Node: Bison Declarations82715
Node: Grammar Rules83127
Node: C Code83587
Node: Symbols84517
Node: Rules89598
Node: Recursion91237
Node: Semantics92956
Node: Value Type94050
Node: Multiple Types94722
Node: Actions95739
Node: Action Types98524
Node: Mid-Rule Actions99827
Node: Locations105397
Node: Location Type106045
Node: Actions and Locations106603
Node: Location Default Action108759
Node: Declarations110222
Node: Token Decl111541
Node: Precedence Decl113554
Node: Union Decl115105
Node: Type Decl115949
Node: Expect Decl116855
Node: Start Decl118401
Node: Pure Decl118779
Node: Decl Summary120456
Node: Multiple Parsers125839
Node: Interface127333
Node: Parser Function128205
Node: Lexical129040
Node: Calling Convention130446
Node: Token Values133217
Node: Token Positions134366
Node: Pure Calling135251
Node: Error Reporting138183
Node: Action Features140305
Node: Algorithm143600
Node: Look-Ahead145893
Node: Shift/Reduce148025
Node: Precedence150937
Node: Why Precedence151588
Node: Using Precedence153453
Node: Precedence Examples154421
Node: How Precedence155122
Node: Contextual Precedence156271
Node: Parser States158062
Node: Reduce/Reduce159305
Node: Mystery Conflicts162866
Node: Stack Overflow166252
Node: Error Recovery167625
Node: Context Dependency172761
Node: Semantic Tokens173609
Node: Lexical Tie-ins176626
Node: Tie-in Recovery178174
Node: Debugging180346
Node: Invocation183647
Node: Bison Options184899
Node: Environment Variables188333
Node: Option Cross Key189181
Node: VMS Invocation190025
Node: Table of Symbols190809
Node: Glossary198202
Node: Index204492

End Tag Table

View File

@@ -263,8 +263,9 @@ GNU GENERAL PUBLIC LICENSE
**************************
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.
@@ -552,8 +553,8 @@ modification follow.
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
@@ -566,7 +567,7 @@ 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.
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
@@ -580,8 +581,7 @@ the "copyright" line and a pointer to where the full notice is found.
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.
@@ -590,8 +590,7 @@ 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.

View File

@@ -46,7 +46,8 @@ END-INFO-DIR-ENTRY
@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
@@ -88,7 +89,7 @@ instead of in the original English.
@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
@@ -2565,7 +2566,7 @@ exp: @dots{}
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:
@@ -2594,16 +2595,16 @@ exp: @dots{}
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:
@@ -2619,7 +2620,7 @@ 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}.
@@ -4732,7 +4733,7 @@ Here @var{infile} is the grammar file name, which usually ends in
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

View File

@@ -1,3 +1,3 @@
@set UPDATED 10 August 2001
@set UPDATED 13 August 2001
@set EDITION 1.28c
@set VERSION 1.28c

View File

@@ -1,3 +1,3 @@
@set UPDATED 10 August 2001
@set UPDATED 13 August 2001
@set EDITION 1.28c
@set VERSION 1.28c

View File

@@ -18,5 +18,5 @@ libbison_a_SOURCES = \
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)

View File

@@ -108,7 +108,7 @@ EXTRA_DIST = malloc.c realloc.c
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
@@ -128,18 +128,18 @@ CFLAGS = @CFLAGS@
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)

View File

View File