Summary
To improve the readability of a grammar it is common to use extended context free grammars (ECFGs) which are context free grammars (CFGs) extended with the repetition operator (*), the alternation operator (¦) and parentheses to express the right hand sides of the productions. The topic treated here is LR-parsing of ECFGs. The LR(k) concept is generalized to ECFGs, a set of LR-preserving transformations from ECFGs to CFGs is given and finally it is shown how to construct LR-parsers directly from ECFGs.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Aho, A. V., Ullman, J. D.: The theory of parsing, translation, and compiling. Volume 1: Parsing. 1972. Volume 2: Compiling. 1973. Englewood Cliffs (N.J.): Prentice-Hall
DeRemer, F. L.: Practical translators for LR(k) languages. Massachusetts Institute of Technology, Cambridge (Mass.), Techn. Rep. MAC TR 65, Ph.D. Thesis, Oct. 1969
DeRemer, F. L.: Simple LR(k) grammars. Comm. ACM 14, 453–460 (1971)
DeRemer, F. L.: Lexical analysis. In: Bauer, F. L., Eickel, J. (eds.): Compiler construction, an advanced course. Lecture Notes in Computer Science 21. Berlin-Heidelberg-New York: Springer 1974, p. 109–120
Early, J.: An efficient context-free parsing algorithm. Comm. ACM 13, 94–102 (1970)
Knuth, D. E.: On the translation of languages from left to right. Information and Control 8, 607–639 (1965)
Madsen, O. L., Kristensen, B. B.: On extended context-free grammars and LR-parsing. Department of Computer Science, University of Aarhus, Aarhus, Denmark, DAIMI PB-53, 1975
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Madsen, O.L., Kristensen, B.B. LR-parsing of extended context free grammars. Acta Informatica 7, 61–73 (1976). https://doi.org/10.1007/BF00265221
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00265221