Simple LR(k) Grammars

Communications of the ACM

Volumn 14, Issue 7, 1971, Pages 453-460

  DeRemer, Franklin L ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

context free grammar; deterministic pushdown automaton; finite state machine; LR(k) grammar; parser; parsing algorithm; precedence grammar; syntactic analysis

Indexed keywords

CONTEXT-FREE GRAMMARS;

AUTOMATA THEORY;

EID: 0015099399     PISSN: 00010782     EISSN: 15577317     Source Type: Journal    
DOI: 10.1145/362619.362625     Document Type: Article

References (16)

1. Cheatham, T. E. Jr. The Theory and Construction of Compilers. Massachusetts Computer Associates, Inc., Wakefield, Mass., 1967.
2. DeRemer, F. L. Practical translation for LR(k) languages. Ph.D. thesis. MIT, Cambridge, Mass. Sept., 1969.
3. DeRemer, F. L. Simple LR(k) grammars: Definition and implementation. CEP Rep. 2, 4 (Sept. 1970), U. of Calif., Santa Cruz.
4. De Remer, F. L. Minimal LR(k) parsers (In preparation).
5. De Remer, F. L. Error recovery using LR(k) techniques (In preparation).
6. Earley, J. An efficient context-free parsing algorithm. Comm. ACM 13, 2 (Feb. 1970), 94-102.
7. Horning, J. J., and Lalonde, W. R. Empirical comparison of LR(k) and precedence parsers. Tech. Rep. CSRG-1, Computer Syst. Res. Gr., U. of Toronto, Canada, undated (rec. Sept. 1970).
8. Hopcroft, J. E., and Ullman, J. D. Formal Languages and Their Relation to Automata, Addison-Wesley, Reading, Mass., 1969.
9. Ichbiah, J. D., and Morse, S. P. A technique for generating almost optimal Floyd-Evans productions for precedence grammars. Comm. ACM 13, 8 (Aug. 1970), 501-508.
10. Korenjak, A. J. A practical method for constructing LR(k) processors. Comm. ACM 12, 11 (Nov. 1969), 613-623.
11. Knuth, D. E. On the translation of languages from left to right. Inf. Contr. 8 (Oct. 1965), 607-639.
12. McKeeman, W. M., Horning, J. J., and Wortman, D. B. A Complier Generator. Prentice-Hall, Englewood Cliffs, N.J., 1970.
13. Naur, P. (Ed.) Revised report on the algorithmic language algol 60. Comm. ACM 6, 1 (Jan. 1963), 1-17.
14. Wirth, N. and Weber, H. EULER: A generalization of algol, and its formal definition: I, II. Comm. ACM 9, 1, 2 (Jan., Feb., 1966) 13-25, 89-99.
15. Reddy, D. R., and McKeeman, W. M. Computer programming: An introduction to PL. Prelimin. Rep., Stanford U., Stanford, Calif., 1969.
16. Evans, A. Jr. PAL—a language designed for teaching programming linguistics. Proc. acm 23rd Nat. Conf., 1968, Brandon/Systems Press, Princeton, N.J., pp. 395-403.