Advertisement

Transition diagrams and strict deterministic grammars

  • Dietmar Friede
Vorträge (In Alphabetischer Reihenfolge)
Part of the Lecture Notes in Computer Science book series (LNCS, volume 67)

Keywords

Finite Automaton Transition Diagram Entry State Exit State Pushdown Automaton 
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.

7. 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. [Conway63]
    Conway, M.E., Design of a seperable transition diagram compiler, Communication of the ACM Vol. 6, Nr. 7, S. 396–400, New York, 1963.CrossRefGoogle Scholar
  4. [Friede78]
    Friede, D., Uber determistisch kontextfreie Sprachen und rekursiven Abstieg, Bericht Nr. 49 des Fachbereich Informatik der Universität Hamburg, 1978.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. [HarrisonHave172]
    Harrison, M.A., Havel, I.M., Real-Time Strict Deterministic Languages, SIAM J. Computing, Vol. 7 Nr.4, 1974Google Scholar
  7. [HarrisonHavel73]
    Harrison, M.A., Havel, I.M., Strict Deterministic Grammars, Journal of Computer and System Sciences, Vol. 7, Nr. 3, 1973.Google Scholar
  8. [HarrisonHavel74]
    Harrison, M.A., Havel, I.M., On the Parsing of Deterministic Languages, Journal of the ACM, Vol. 21 Nr. 4, 1974.Google Scholar
  9. [KrálDemner73]
    Král, J., Demner, J., Semi-Top-Down Syntactic Analysis, Technical Report 6/73, Techniqual University of Prague, 1973.Google Scholar
  10. [Král74]
    Král, J., Bottum-up versus top-down syntax analysis revised. Technical Report 10/74, Techniqual University of Prague, 1974. Král, J., Semi-top-down transition diagrams driven syntactic analysis: Part 2. Techniqual Report 11/74, Techniqual University of Prague, 1974.Google Scholar
  11. [Lomet73]
    Lomet, D.B., A Formalisation of Transition Diagram Systems, Journal of the ACM, Vol. 20 Nr 2, 1973.Google Scholar
  12. [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
  13. [Pittl77]
    Pittl, Jan, Exponential Optimization for the LLP(k) Parsing Method, Lecture Notes in Computer Science 53: Mathematical Foundations of Computer Science, 1977.Google Scholar
  14. [Tixier67]
    Tixier, Recursive Functions of Regular Expressions in Language Analysis, Ph.D.Thesis Stanford, 1967.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1979

Authors and Affiliations

  • Dietmar Friede

There are no affiliations available

Personalised recommendations