Advertisement

Partitioned LL(k) grammars

  • Dietmar Friede
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 71)

Keywords

Equivalence Relation Induction Hypothesis Transition Diagram Left Derivation Algorithm Halt 
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. [AhoUllmanI72]
    Aho, A.V., Ullman, J.D., The Theory of Parsing, Translation, and Compiling, Vol. 1: Parsing, Prentice Hall, Englewood Cliffs, New York, 1972.Google Scholar
  2. [AhoUllmanII73]
    Aho, A.V., Ullman, J.D., The Theory of Parsing, Translation, and Compiling, Vol. 2: Compiling, Prentice Hall, Englewood Cliffs, New York, 1973.Google Scholar
  3. [Friede78]
    Friede, D., Über determistisch kontextfreie Sprachen und rekursiven Abstieg, Bericht Nr. 49 des Fachbereichs Informatik der Universität Hamburg, 1978.Google Scholar
  4. [Friede79]
    Friede,D., Transition Diagrams and Strict Deterministic Grammars, Lecture Notes in Computer Science 67: Theoretical Computer Science 4th GI Conference, 1979.Google Scholar
  5. [GellerHarrison73]
    Geller, M.M, Harrison, M.A., Strict Deterministic versus LR(0) Parsing, Conference Record of ACM Symposium on Principles of Programming Languages, 1973.Google Scholar
  6. [HarrisonHave173]
    Harrison, M.A., Havel, I.M., Strict Deterministic Grammars, Journal of Computer and System Sciences, Vol. 7, Nr. 3, 1973.Google Scholar
  7. [HarrisonHave174]
    Harrison, M.A., Havel, I.M., On the Parsing of Deterministic Languages, Journal of the ACM, Vol.21 Nr.4, 1974.Google Scholar
  8. [Lomet73]
    Lomet, D.B., A Formalisation of Transition Diagram Systems, Journal of the ACM, Vol. 20 Nr 2, 1973.Google Scholar
  9. [Lomet74]
    Lomet, D.B., Automatic generation of multiple exit parsing subroutines. Proc. of the 2nd Colloquium on Automata, Languages and Programming. Springer-Verlag, Lecture Notes in Computer Science 14, New York, 1974, 214–231.Google Scholar
  10. [Pitt177]
    Pittl, Jan, Exponential Optimization for the LLP(k) Parsing Method, Lecture Notes in Computer Science 53: Mathematical Foundations of Computer Science, 1977.Google Scholar
  11. [RosenkrantzStearns69]
    Rosenkrantz, D.J., Stearns, R.E., Properties of Deterministic Top-Down Grammars, ACM Symposium, Marina del Rey 1969.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1979

Authors and Affiliations

  • Dietmar Friede
    • 1
  1. 1.Fachbereich Informatik der Universität HamburgHamburg 13Germany

Personalised recommendations