Re: LAC (lookahead correction) for syntax error handling

[Joel E. Denny]

On Thu, 17 Feb 2011, Akim Demaille wrote:

> Yes, that's what I had in mind.  Nope, I don't know projects that do 
> that.  There's stuff on the Internet (e.g., 
> http://www.burlingtontelecom.net/~ashawley/gnu/texinfo/my-bib-macros.texi.html),
>  
> but I don't know what it's worth.  Karl once wrote he had something for 
> BibTeX and Texinfo, but that's ancient and probably too much efforts 
> (http://www.mail-archive.com/address@hidden/msg00097.html).

Thanks, but how about something simple like the following instead?  I 
wrote it against branch-2.5, but it applies cleanly to master.  Not yet 
pushed.

>From 71caec06614dc68d58229dd4e275c8c641df23ac Mon Sep 17 00:00:00 2001
From: Joel E. Denny <address@hidden>
Date: Sun, 20 Feb 2011 16:58:52 -0500
Subject: [PATCH] doc: add bibliography to manual.

* doc/bison.texinfo (Mystery Conflicts): Cross-reference
bibliography instead of citing publications directly.
(Generalized LR Parsing): Likewise.
(Bibliography): New section.  Not all entries are cross-referenced
yet, but that will come in future patches.
---
 ChangeLog         |    9 ++++++++
 doc/bison.texinfo |   55 ++++++++++++++++++++++++++++++++++++++++++----------
 2 files changed, 53 insertions(+), 11 deletions(-)

diff --git a/ChangeLog b/ChangeLog
index 90d9a08..82f6643 100644
--- a/ChangeLog
+++ b/ChangeLog
@@ -1,3 +1,12 @@
+2011-02-20  Joel E. Denny  <address@hidden>
+
+       doc: add bibliography to manual.
+       * doc/bison.texinfo (Mystery Conflicts): Cross-reference
+       bibliography instead of citing publications directly.
+       (Generalized LR Parsing): Likewise.
+       (Bibliography): New section.  Not all entries are cross-referenced
+       yet, but that will come in future patches.
+
 2011-02-19  Joel E. Denny  <address@hidden>
 
        java: test and document previous bug fix.
diff --git a/doc/bison.texinfo b/doc/bison.texinfo
index 6c8e980..8898570 100644
--- a/doc/bison.texinfo
+++ b/doc/bison.texinfo
@@ -109,6 +109,7 @@ Reference sections:
 * Table of Symbols::    All the keywords of the Bison language are explained.
 * Glossary::            Basic concepts are explained.
 * Copying This Manual:: License for copying this manual.
+* Bibliography::        Publications cited in this manual.
 * Index::               Cross-references to the text.
 
 @detailmenu
@@ -7109,11 +7110,7 @@ return_spec:
 @end example
 
 For a more detailed exposition of LALR(1) parsers and parser
-generators, please see:
-Frank DeRemer and Thomas Pennello, Efficient Computation of
-LALR(1) Look-Ahead Sets, @cite{ACM Transactions on
-Programming Languages and Systems}, Vol.@: 4, No.@: 4 (October 1982),
-pp.@: 615--649 @uref{http://doi.acm.org/10.1145/69622.357187}.
+generators, @pxref{Bibliography,,DeRemer 1982}.
 
 @node Generalized LR Parsing
 @section Generalized LR (GLR) Parsing
@@ -7194,12 +7191,8 @@ structure should generally be adequate.  On LR(1) 
portions of a
 grammar, in particular, it is only slightly slower than with the
 deterministic LR(1) Bison parser.
 
-For a more detailed exposition of GLR parsers, please see: Elizabeth
-Scott, Adrian Johnstone and Shamsa Sadaf Hussain, Tomita-Style
-Generalised LR Parsers, Royal Holloway, University of
-London, Department of Computer Science, TR-00-12,
address@hidden://www.cs.rhul.ac.uk/research/languages/publications/tomita_style_1.ps},
-(2000-12-24).
+For a more detailed exposition of GLR parsers, @pxref{Bibliography,,Scott
+2000}.
 
 @node Memory Management
 @section Memory Management, and How to Avoid Memory Exhaustion
@@ -10869,6 +10862,46 @@ grammatically indivisible.  The piece of text it 
represents is a token.
 @appendix Copying This Manual
 @include fdl.texi
 
address@hidden Bibliography
address@hidden Bibliography
+
address@hidden @asis
address@hidden [Denny 2008]
+Joel E. Denny and Brian A. Malloy, IELR(1): Practical LR(1) Parser Tables
+for Non-LR(1) Grammars with Conflict Resolution, in @cite{Proceedings of the
+2008 ACM Symposium on Applied Computing} (SAC'08), ACM, New York, NY, USA,
+pp.@: 240--245.  @uref{http://dx.doi.org/10.1145/1363686.1363747}
+
address@hidden [Denny 2010 May]
+Joel E. Denny, PSLR(1): Pseudo-Scannerless Minimal LR(1) for the
+Deterministic Parsing of Composite Languages, Ph.D. Dissertation, Clemson
+University, Clemson, SC, USA (May 2010).
address@hidden://proquest.umi.com/pqdlink?did=2041473591&Fmt=7&clientId=79356&RQT=309&VName=PQD}
+
address@hidden [Denny 2010 November]
+Joel E. Denny and Brian A. Malloy, The IELR(1) Algorithm for Generating
+Minimal LR(1) Parser Tables for Non-LR(1) Grammars with Conflict Resolution,
+in @cite{Science of Computer Programming}, Vol.@: 75, Issue 11 (November
+2010), pp.@: 943--979.  @uref{http://dx.doi.org/10.1016/j.scico.2009.08.001}
+
address@hidden [DeRemer 1982]
+Frank DeRemer and Thomas Pennello, Efficient Computation of LALR(1)
+Look-Ahead Sets, in @cite{ACM Transactions on Programming Languages and
+Systems}, Vol.@: 4, No.@: 4 (October 1982), pp.@:
+615--649. @uref{http://dx.doi.org/10.1145/69622.357187}
+
address@hidden [Knuth 1965]
+Donald E. Knuth, On the Translation of Languages from Left to Right, in
address@hidden and Control}, Vol.@: 8, Issue 6 (December 1965), pp.@:
+607--639. @uref{http://dx.doi.org/10.1016/S0019-9958(65)90426-2}
+
address@hidden [Scott 2000]
+Elizabeth Scott, Adrian Johnstone, and Shamsa Sadaf Hussain,
address@hidden Generalised LR Parsers}, Royal Holloway, University of
+London, Department of Computer Science, TR-00-12 (December 2000).
address@hidden://www.cs.rhul.ac.uk/research/languages/publications/tomita_style_1.ps}
address@hidden table
+
 @node Index
 @unnumbered Index
 
-- 
1.7.0.4