===================================================================
RCS file: /cvsrepo/anoncvs/cvs/src/usr.bin/yacc/yacc.1,v
retrieving revision 1.27
retrieving revision 1.28
diff -u -r1.27 -r1.28
--- src/usr.bin/yacc/yacc.1	2013/08/15 16:26:59	1.27
+++ src/usr.bin/yacc/yacc.1	2014/01/28 15:43:42	1.28
@@ -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 @@
 .%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 @@
 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.