Abstract
The traditional LALR analysis is reexamined using a new operator and an associated graph. An improved method that allows factoring out a crucial part of the computation for defining states of LR(0) canonical collection and for computing LALR(1) lookahead sets is presented. This factorization leads to significantly improved algorithms with respect to execution time as well as storage requirements. Experimental results including comparison with other known methods are presented. © 1985, ACM. All rights reserved.
Cite
CITATION STYLE
Park, J. C. H., Choe, K. M., & Chang, C. H. (1985). A New Analysis of LALR Formalisms. ACM Transactions on Programming Languages and Systems (TOPLAS), 7(1), 159–175. https://doi.org/10.1145/2363.2527
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
