summaryrefslogtreecommitdiff
path: root/usr.bin/yacc/yacc.1
diff options
context:
space:
mode:
authorJason McIntyre <jmc@cvs.openbsd.org>2014-01-28 15:43:43 +0000
committerJason McIntyre <jmc@cvs.openbsd.org>2014-01-28 15:43:43 +0000
commit69273f2ab1730bb4a29472050c4da74a747a981a (patch)
tree3fe2fffc84ba6a65286c074fa0f822ba4af9e353 /usr.bin/yacc/yacc.1
parent9fad45642f1ad667085bf7be2cdde552f0f16a9b (diff)
bit more info for the toplas article;
From: Jan Stary tweaked a bit by myself
Diffstat (limited to 'usr.bin/yacc/yacc.1')
-rw-r--r--usr.bin/yacc/yacc.19
1 files changed, 6 insertions, 3 deletions
diff --git a/usr.bin/yacc/yacc.1 b/usr.bin/yacc/yacc.1
index c149b11b075..cc35d0c19f7 100644
--- a/usr.bin/yacc/yacc.1
+++ b/usr.bin/yacc/yacc.1
@@ -1,4 +1,4 @@
-.\" $OpenBSD: yacc.1,v 1.27 2013/08/15 16:26:59 jmc Exp $
+.\" $OpenBSD: yacc.1,v 1.28 2014/01/28 15:43:42 jmc Exp $
.\"
.\" Copyright (c) 1989, 1990 The Regents of the University of California.
.\" All rights reserved.
@@ -32,7 +32,7 @@
.\"
.\" from: @(#)yacc.1 5.7 (Berkeley) 7/30/91
.\"
-.Dd $Mdocdate: August 15 2013 $
+.Dd $Mdocdate: January 28 2014 $
.Dt YACC 1
.Os
.Sh NAME
@@ -187,7 +187,10 @@ to the standard error.
.%A T. J. Pennello
.%D 1982
.%J TOPLAS
+.%N Issue 4
+.%P pp. 615\(en649
.%T Efficient Computation of LALR(1) Look-Ahead Sets
+.%V Volume 4
.Re
.Sh STANDARDS
The
@@ -212,7 +215,7 @@ quit.
Berkeley Yacc is based on the excellent algorithm for computing
LALR(1) lookaheads developed by Tom Pennello and Frank DeRemer.
The algorithm is described in their almost impenetrable article in
-TOPLAS 4,4.
+TOPLAS (see above).
.Pp
Finally, much credit must go to those who pointed out deficiencies
of earlier releases.