Efficient Computation of LALR(1) Look-Ahead Sets
- 1 October 1982
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Programming Languages and Systems
- Vol. 4 (4) , 615-649
- https://doi.org/10.1145/69622.357187
Abstract
No abstract availableThis publication has 8 references indexed in Scilit:
- Methods for Computing LALR( k ) LookaheadACM Transactions on Programming Languages and Systems, 1981
- A syntax diagram for (preliminary) AdaACM SIGPLAN Notices, 1980
- On computing the transitive closure of a relationActa Informatica, 1977
- The lane-tracing algorithm for constructing LR (k) parsers and ways of enhancing its efficiencyInformation Sciences, 1977
- LR ParsingACM Computing Surveys, 1974
- EfficientLR (1) parsersActa Informatica, 1973
- Simple LR(k) grammarsCommunications of the ACM, 1971
- On the translation of languages from left to rightInformation and Control, 1965