Journal of the ACM Bibliography

Additional Key Words and Phrases: parsing, deterministic language, LR(k), strict deterministic, context-free grammars, pushdown automata

Selected papers that cite this one

• John C. Beatty. On the relationship between LL(1) and LR(1) grammars. Journal of the ACM, 29(4):1007-1022, October 1982.

• Bruno Courcelle. A representation of trees by languages I. Theoretical Computer Science, 6(3):255-279, June 1978.

• Bruno Courcelle. A representation of trees by languages II. Theoretical Computer Science, 7(1):25-55, August 1978.

Selected references

• A. V. Aho, P. J. Denning, and J. D. Ullman. Weak and mixed strategy precedence parsing. Journal of the ACM, 19(2):225-243, April 1972.

• Matthew M. Geller and Michael A. Harrison. Characterizations of LR(0) languages (extended abstract). In 14th Annual Symposium on Switching and Automata Theory, pages 103-108, The University of Iowa, 15-17 October 1973. IEEE.

• Seymour Ginsburg and Sheila A. Greibach. Deterministic context free languages. Information and Control, 9(6):620-648, December 1966.

• James N. Gray and Michael A. Harrison. On the covering and reduction problems for context-free grammars. Journal of the ACM, 19(4):675-698, October 1972.

• James N. Gray and Michael A. Harrison. Canonical precedence schemes. Journal of the ACM, 20(2):214-234, April 1973.

• Donald E. Knuth. On the translation of languages from left to right. Information and Control, 8(6):607-639, December 1965.

Shortcuts: