Additional Key Words and Phrases: canonical precedence schemes, precedence analysis, simple precedence, operator precedence, parsing, LR($k$) grammars, bounded right context grammars, compiler construction, fast parsing methods
Selected papers that cite this one
- 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.
- Michael A. Harrison and Ivan M. Havel. On the parsing of deterministic languages. Journal of the ACM, 21(4):525-548, October 1974.
Selected references
- Michael J. Fischer. Some properties of precedence languages. In Conference Record of ACM Symposium on Theory of Computing, pages 181-190, Marina del Rey, California, 5-7 May 1969.
- Robert W. Floyd. Syntactic analysis and operator precedence. Journal of the ACM, 10(3):316-333, July 1963.
- Seymour Ginsburg and Michael A. Harrison. One-way nondeterministic real-time list-storage languages. Journal of the ACM, 15(3):428-446, July 1968.
- Susan L. Graham. Extended precedence languages, bounded right context languages, and deterministic languages (extended abstract). In Conference Record of 1970 Eleventh Annual Symposium on Switching and Automata Theory, pages 175-180, Santa Monica, California, 28-30 October 1970. IEEE.
- 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.
- Sheila A. Greibach. A new normal-form theorem for context-free phrase structure grammars. Journal of the ACM, 12(1):42-52, January 1965.
- Donald E. Knuth. On the translation of languages from left to right. Information and Control, 8(6):607-639, December 1965.