Advertisement

Production prefix parsing

Extended abstract
  • Matthew M. Geller
  • Susan L. Graham
  • Michael A. Harrison
Tuesday Afternoon
Part of the Lecture Notes in Computer Science book series (LNCS, volume 14)

Keywords

Production Number Computing Machinery Input Tape Conference Record Nonterminal Symbol 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Aho, A.V. and Ullman, J.D., "Optimization of LR(k) Parsers," Journal of Computer and System Sciences, Vol. 6, pp. 573–602, 1972.Google Scholar
  2. 2.
    Aho, A.V. and Ullman, J.D., The Theory of Parsing, Translating, and Compiling, Vols. I and II, Prentice Hall, Englewood Cliffs, New Jersey, 1972 and 1973.Google Scholar
  3. 3.
    DeRemer, F.L., "Simple LR(k) Grammars," Communications of the Association for Computing Machinery, Vol. 14, pp. 453–460, 1971.Google Scholar
  4. 4.
    Earley, J., "An Efficient Context-Free Parsing Algorithm," Ph.D. Thesis, Department of Computer Science, Carnegie-Mellon University, Pittsburgh, Pa., 1968.Google Scholar
  5. 5.
    Geller, M.M. and Harrison, M.A., "Characterizations of LR(O) Languages," Proceedings of Symposium on Switching and Automata Theory, pp. 103–108, 1973.Google Scholar
  6. 6.
    Geller, M.M. and Harrison, M.A., "Strict Deterministic Versus LR(O) Parsing," Conference Record of ACM Symposium on Principles of Programming Languages, pp. 22–32, 1973.Google Scholar
  7. 7.
    Graham, S.L., "Precedence Languages and Bounded Right Context Languages," Ph.D. Thesis and Technical Report CS-71-233, Department of Computer Science, Stanford University, 1970.Google Scholar
  8. 8.
    Graham, S.L., "Extended Precedence, Bounded Right Context Languages and Deterministic Languages," Proceedings of Symposium on Switching and Automata Theory, pp. 175–180, 1970.Google Scholar
  9. 9.
    Graham, S.L., "On Bounded Right Context Languages and Grammars," SIAM Journal on Computing (to appear), 1974.Google Scholar
  10. 10.
    Graham, S.L. and Rhodes, S.P., "Practical Syntactic Error Recovery in Compilers," Conference Record of ACM Symposium on Principles of Programming Languages, pp. 52–58, 1973.Google Scholar
  11. 11.
    Gray, J.N. and Harrison, M.A., "On the Covering and Reduction Problems for Context-Free Grammars," Journal of the Association for Computing Machinery, Vol. 19, pp. 675–698, 1972.Google Scholar
  12. 12.
    Gray, J.N. and Harrison, M.A., "Canonical Precedence Schemes," Journal of the Association for Computing Machinery, Vol. 20, pp. 214–234, 1973.Google Scholar
  13. 13.
    Harrison, M.A. and Havel, I.M., "Strict Deterministic Grammars," Journal of Computer and System Sciences, Vol. 7, pp. 237–277, 1973.Google Scholar
  14. 14.
    Harrison, M.A. and Havel, I.M., "On the Parsing of Deterministic Languages," to appear in Journal of the Association for Computing Machinery, 1974.Google Scholar
  15. 15.
    Kemp, R., "An Estimation of the Set of States of the Minimal LR(O)-acceptor," in Automata, Languages and Programming, (M. Nivat, ed.), North Holland Publishing Co., Amsterdam, pp. 563–574, 1973.Google Scholar
  16. 16.
    Kemp, R., "LR(k) Analysatoren," Technical Report A73/02, Mathematisches Institut und Institut für Angewandte Mathematik, Universität des Saarlandes, Saarbrucken, Germany, 1973.Google Scholar
  17. 17.
    Knuth, D.E., "On the Translation of Languages from Left to Right," Information and Control, Vol. 8, pp. 607–639, 1965.CrossRefGoogle Scholar
  18. 18.
    Korenjak, A.J., "A Practical Method for Constructing LR(k) Processors," Communications of the Association for Computing Machinery, Vol. 12, pp. 613–623, 1969.Google Scholar
  19. 19.
    Pager, D., "A Solution to an Open Problem by Knuth," Information and Control, Vol. 17, pp. 462–473, 1970.CrossRefGoogle Scholar
  20. 20.
    Schkolnick, M., "Labelled Precedence Parsing," Conference Record of ACM Symposium on Principles of Programming Languages, pp. 33–40, 1973.Google Scholar
  21. 21.
    Wirth, N. and Weber, H., "Euler, A Generalization of Algol and Its Formal Definition," Communications of the Association for Computing Machinery, Vol. 9, January and February 1966, pp. 13–23 and pp. 89–99, respectively.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1974

Authors and Affiliations

  • Matthew M. Geller
    • 1
  • Susan L. Graham
    • 1
  • Michael A. Harrison
    • 1
  1. 1.Computer Science DivisionUniversity of CaliforniaBerkeleyU.S.A.

Personalised recommendations