LR Grammars and Analysers
This chapter is concerned with a family of deterministic parsing techniques based on a method first described by Knuth . 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].
KeywordsAccessible State Input Symbol Error Entry Terminal Symbol Correct Sentence
Unable to display preview. Download preview PDF.
- 1.Aho, A.V., Johnson, S.C.: LR parsing. Computing Surveys (to appear 1974 ).Google Scholar
- 2.Aho, A.V., Ullman, J.D.: The theory of parsing, translation and compiling. Volume 1: Parsing 1972. Volume 2: Compiling 1973. Prentice-Hall.Google Scholar
- 8.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.Google Scholar
- 10.Lalonde, W.R.: An efficient LALR parser generator. University of Toronto, Computer Systems Research Group Tech. Rep. CSRG - 2, 1971.Google Scholar
- 11.McKeeman, W.M., Horning, J.J., Wortman, D.B.: A compiler generator. Prentice-Hall 1970.Google Scholar
- 13.Wirth, N., Weber, H.: Euler: a generalization of Algol 60 and its formal description. Comm. ACM 9, 13–25, 89–99 (1966).Google Scholar