Eljas Soisalon-Soininen
- 1 AHo, A.V., ASD ULLMAN, J.D. Principles of Compiler Design. Addison-Wesley, Reading, Mass., 1977. Google Scholar
- 2 AHO, A.V., AND ULLMAN, J.D. A technique for speeding up LR(k) parsers. SIAMJ. Comput. 2, 2 (June 1973), 106-127.Google Scholar
- 3 AHO, A.V., AND ULLMAN, J.D. Optimization of LR(k) parsers. J. Comput. Syst. Sci. 6, 6 (Dec. 1972), 573-602.Google Scholar
- 4 AHo, A.V., AND ULLMAN, J.D. The Theory of Parsing, Translation, and Compiling, vol. 1: Parsing. Prentice-Hall, Englewood Cliffs, N.J., 1972. Google Scholar
- 5 DEREMER, F.L. Simple LR(k) grammars. Comrnun. ACM 14, 7 (July 1971), 453-460. Google Scholar
- 6 DEREMER, F.L. Practical translators for LR(k) languages. Project MAC Tech. Rep. TR-65, M.I.T., Cambridge, Mass., 1969. Google Scholar
- 7 KNuT~, D.E. On the translation of languages from left to right. Inf. Control 8, 6 (Dec. 1965), 607-639.Google Scholar
- 8 PACEa, D. A solution to an open problem by Knuth. Inf. Control 17, 6 (Dec. 1970), 462-473.Google Scholar
- 9 PACER, D. Eliminating unit productions from LR parsers. Acta Inf. 9, I (1977), 31-59.Google Scholar
- 10 SIPPV, S., AND SOISALON-SoININE~, E. A scheme for LR(k) parsing with error recovery, pt. I: Parsing. Int. J. Comput. Math. 8, 1 (1980), 27-42.Google Scholar
- 11 SOISALON-SoINI~EN, E. On the space optimizing effect of eliminating single productions from LR parsers. Acta Inf. 14, 2 (1980), 157-174.Google Scholar
Index Terms
- Inessential Error Entries and Their Use in LR Parser Optimization
Recommendations
LR Automatic Parser Generator and LR(1) Parser
LR is an LR(1) parser generation system. It is written entirely in portable ANS1 standard Fortran 66 and has been successfully operated on a number of computers. LR uses a powerful algorithm of Pager's to generate a space efficient parser for any LR(1) ...
An LR substring parser for noncorrecting syntax error recovery
PLDI '89: Proceedings of the ACM SIGPLAN 1989 conference on Programming language design and implementationFor a context-free grammar G, a construction is given to produce an LR parser that recognizes any substring of the language generated by G. The construction yields a conflict-free (deterministic) parser for the bounded context class of grammars (Floyd, ...
An efficient LR parser generator for tree-adjoining grammars
New developments in parsing technologyIn this chapter we discuss practical LR-like parser generator models for Tree Adjoining Grammars (TAGs) and propose a new algorithm. The algorithm has been implemented and applied to two large coverage TAGs for English: the XTAG English grammar, and a ...
Comments