version 1.27, 2013/08/15 16:26:59 |
version 1.28, 2014/01/28 15:43:42 |
|
|
.%A T. J. Pennello |
.%A T. J. Pennello |
.%D 1982 |
.%D 1982 |
.%J TOPLAS |
.%J TOPLAS |
|
.%N Issue 4 |
|
.%P pp. 615\(en649 |
.%T Efficient Computation of LALR(1) Look-Ahead Sets |
.%T Efficient Computation of LALR(1) Look-Ahead Sets |
|
.%V Volume 4 |
.Re |
.Re |
.Sh STANDARDS |
.Sh STANDARDS |
The |
The |
|
|
Berkeley Yacc is based on the excellent algorithm for computing |
Berkeley Yacc is based on the excellent algorithm for computing |
LALR(1) lookaheads developed by Tom Pennello and Frank DeRemer. |
LALR(1) lookaheads developed by Tom Pennello and Frank DeRemer. |
The algorithm is described in their almost impenetrable article in |
The algorithm is described in their almost impenetrable article in |
TOPLAS 4,4. |
TOPLAS (see above). |
.Pp |
.Pp |
Finally, much credit must go to those who pointed out deficiencies |
Finally, much credit must go to those who pointed out deficiencies |
of earlier releases. |
of earlier releases. |