Efficient computation of LALR(1) look-ahead sets
- 1 August 1979
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGPLAN Notices
- Vol. 14 (8) , 176-187
- https://doi.org/10.1145/872732.806968
Abstract
No abstract availableThis publication has 2 references indexed in Scilit:
- On computing the transitive closure of a relationActa Informatica, 1977
- EfficientLR (1) parsersActa Informatica, 1973