head	1.2;
access;
symbols
	RELENG_3_5_0_RELEASE:1.1.1.1
	RELENG_3_4_0_RELEASE:1.1.1.1
	RELENG_3_3_0_RELEASE:1.1.1.1
	v1_28:1.1.1.1
	RELENG_3_2_PAO:1.1.1.1.0.6
	RELENG_3_2_PAO_BP:1.1.1.1
	RELENG_3_2_0_RELEASE:1.1.1.1
	RELENG_3_1_0_RELEASE:1.1.1.1
	RELENG_3:1.1.1.1.0.4
	RELENG_3_BP:1.1.1.1
	RELENG_2_2_8_RELEASE:1.1.1.1
	RELENG_3_0_0_RELEASE:1.1.1.1
	RELENG_2_2_7_RELEASE:1.1.1.1
	RELENG_2_2_6_RELEASE:1.1.1.1
	RELENG_2_2_5_RELEASE:1.1.1.1
	RELENG_2_2_2_RELEASE:1.1.1.1
	RELENG_2_2_1_RELEASE:1.1.1.1
	RELENG_2_2_0_RELEASE:1.1.1.1
	RELENG_2_2:1.1.1.1.0.2
	RELENG_2_2_BP:1.1.1.1
	v1_25:1.1.1.1
	FSF:1.1.1;
locks; strict;
comment	@# @;


1.2
date	2000.01.30.19.24.10;	author obrien;	state dead;
branches;
next	1.1;

1.1
date	96.09.10.13.12.02;	author peter;	state Exp;
branches
	1.1.1.1;
next	;

1.1.1.1
date	96.09.10.13.12.02;	author peter;	state Exp;
branches;
next	;


desc
@@


1.2
log
@Retire Bison as it is not need to build GCC any more.

Ok'ed by:	JKH
@
text
@From phr Tue Jul  8 10:36:19 1986
Date: Tue, 8 Jul 86 00:52:24 EDT
From: phr (Paul Rubin)
To: riferguson%watmath.waterloo.edu@@CSNET-RELAY.ARPA, tower
Subject: Re:  Bison documentation?

The main difference between Bison and Yacc that I know of is that
Bison supports the @@N construction, which gives you access to
the starting and ending line number and character number associated
with any of the symbols in the current rule.

Also, Bison supports the command `%expect N' which says not to mention
the conflicts if there are N shift/reduce conflicts and no reduce/reduce
conflicts.

The differences in the algorithms stem mainly from the horrible
kludges that Johnson had to perpetrate to make Yacc fit in a PDP-11.

Also, Bison uses a faster but less space-efficient encoding for the
parse tables (see Corbett's PhD thesis from Berkeley, "Static
Semantics in Compiler Error Recovery", June 1985, Report No. UCB/CSD
85/251), and more modern technique for generating the lookahead sets.
(See "Efficient Construction of LALR(1) Lookahead Sets" by F. DeRemer
and A. Pennello, in ACM TOPLS Vol 4 No 4, October 1982.  Their
technique is the standard one now.)

	paul rubin
	free software foundation


@


1.1
log
@Initial revision
@
text
@@


1.1.1.1
log
@Import the FSF release of bison-1.25 onto the vendor branch.

In case you're wondering, the gcc-2.7.2.1 import uses this to generate
code.  The size of the generated code is bigger than the entire bison
release, making this a saving.  The bison doc is pretty good apparently.
@
text
@@
