Abstract
This chapter is concerned with a family of deterministic parsing techniques based on a method first described by Knuth [1965]. These parsers, and the grammars acceptable to them, share most of the desirable properties of the LL(k) family [Chapter 2.B.]. In addition, the class of LR(k)-parsable grammars is probably the largest class accepted by any currently practical parsing technique. The techniques with which we are mostly concerned are, in order of increasing power, LR(0), SLR(1), LALR(1) and LR(1). Collectively, we call these four techniques the LR family [McKeeman 1970] [Aho 1974].
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aho, A.V., Johnson, S.C.: LR parsing. Computing Surveys (to appear 1974 ).
Aho, A.V., Ullman, J.D.: The theory of parsing, translation and compiling. Volume 1: Parsing 1972. Volume 2: Compiling 1973. Prentice-Hall.
Aho, A.V., Ullman, J.D.: Optimization of LR(k) parsers. J. Computer and System Sciences 6, 6 573–602 (1972).
Aho, A.V., Ullman, J.D.: A technique for speeding up LR(k) parsers. SIAM J. Computing 2, 2 106–127 (1973).
Anderson, T., Eve, J., Horning, J.J.: Efficient LR(1) parsers. Acta Informatica 2, 12–39 (1973).
DeRemer, F.L.: Simple LR(k) grammars. Comm. ACM 14, 453–460 (1971).
Feldman, J.A., Gries, D.: Translator writing systems. Comm. ACM 11, 77–113 (1968).
Joliat, M.L.: On the reduced matrix representation of LR(k) parser tables. University of Toronto, Computer Systems Research Group Techn. Rep. CSRG-28, 1973.
Knuth, D.E.: On the translation of languages from left to right. Information and Control 8, 607–639 (1965).
Lalonde, W.R.: An efficient LALR parser generator. University of Toronto, Computer Systems Research Group Tech. Rep. CSRG - 2, 1971.
McKeeman, W.M., Horning, J.J., Wortman, D.B.: A compiler generator. Prentice-Hall 1970.
Pager, D.: A solution to an open problem by Knuth. Information and Control 17, 462–473 (1970).
Wirth, N., Weber, H.: Euler: a generalization of Algol 60 and its formal description. Comm. ACM 9, 13–25, 89–99 (1966).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1974 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Horning, J.J. (1974). LR Grammars and Analysers. In: Bauer, F.L., Eickel, J. (eds) Compiler Construction. Lecture Notes in Computer Science, vol 21. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-21549-4_4
Download citation
DOI: https://doi.org/10.1007/978-3-662-21549-4_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-06958-4
Online ISBN: 978-3-662-21549-4
eBook Packages: Springer Book Archive