Journal of the ACM Bibliography

Selected papers that cite this one

• A. V. Aho and J. D. Ullman. A technique for speeding up LR(k) parsers. SIAM Journal on Computing, 2(2):106-127, June 1973.

• M. Flasi\'nski. Power properties of NLC graph grammars with a polynomial membership problem. Theoretical Computer Science, 201(1-2):189-231, 6 July 1998.

• Edward M. Reingold. Infix to prefix translation: The insufficiency of a pushdown stack. SIAM Journal on Computing, 1(4):350-353, December 1972.

• D. J. Rosenkrantz and R. E. Stearns. Properties of deterministic top down grammars. In Conference Record of ACM Symposium on Theory of Computing, pages 165-180, Marina del Rey, California, 5-7 May 1969.

• Teodor Rus and James S. Jones. PHRASE parsers from multi-axiom grammars. Theoretical Computer Science, 199(1-2):199-229, 15 June 1998.

• James P. Schmeiser and David T. Banard. Producing a top-down parse order with bottom-up parsing. Information Processing Letters, 54(6):323-326, 23 June 1995.

• Seppo Sippu and Eljas Soisalon-Soininen. On LL(k) parsing. Information and Control, 53(3):141-164, June 1982.

• James W. Thatcher. Transformations and translations from the point of view of generalized finite automata theory. In Conference Record of ACM Symposium on Theory of Computing, pages 129-142, Marina del Rey, California, 5-7 May 1969.

• Leslie G. Valiant. Regularity and related problems for deterministic pushdown automata. Journal of the ACM, 22(1):1-10, January 1975.

Selected references

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

• Daniel H. Younger. Recognition and parsing of context-free languages in time Information and Control, 10(2):189-208, February 1967.

Shortcuts: