Skip to main content
SpringerLink
Log in

Transition diagrams and strict deterministic grammars

  • Vorträge (In Alphabetischer Reihenfolge)
  • Conference paper
  • First Online:
Book cover Theoretical Computer Science 4th GI Conference

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 67))

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

7. References

  1. 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. 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. Conway, M.E., Design of a seperable transition diagram compiler, Communication of the ACM Vol. 6, Nr. 7, S. 396–400, New York, 1963.

    Article  Google Scholar 

  4. Friede, D., Uber determistisch kontextfreie Sprachen und rekursiven Abstieg, Bericht Nr. 49 des Fachbereich Informatik der Universität Hamburg, 1978.

    Google Scholar 

  5. 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. Harrison, M.A., Havel, I.M., Real-Time Strict Deterministic Languages, SIAM J. Computing, Vol. 7 Nr.4, 1974

    Google Scholar 

  7. Harrison, M.A., Havel, I.M., Strict Deterministic Grammars, Journal of Computer and System Sciences, Vol. 7, Nr. 3, 1973.

    Google Scholar 

  8. 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ál, J., Demner, J., Semi-Top-Down Syntactic Analysis, Technical Report 6/73, Techniqual University of Prague, 1973.

    Google Scholar 

  10. 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. Lomet, D.B., A Formalisation of Transition Diagram Systems, Journal of the ACM, Vol. 20 Nr 2, 1973.

    Google Scholar 

  12. 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. 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. Tixier, Recursive Functions of Regular Expressions in Language Analysis, Ph.D.Thesis Stanford, 1967.

    Google Scholar 

Download references

Authors
  1. Dietmar Friede
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

K. Weihrauch

Rights and permissions

Reprints and permissions

Copyright information

© 1979 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Friede, D. (1979). Transition diagrams and strict deterministic grammars. In: Weihrauch, K. (eds) Theoretical Computer Science 4th GI Conference. Lecture Notes in Computer Science, vol 67. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-09118-1_13

Download citation

  • DOI: https://doi.org/10.1007/3-540-09118-1_13

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-09118-9

  • Online ISBN: 978-3-540-35517-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation