Skip to main content

One abstract accepting algorithm for all kinds of parsers

  • Conference paper
  • First Online:
Automata, Languages and Programming (ICALP 1979)

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

Included in the following conference series:

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aho, A.V., Ullman, J.D.: The theory of parsing, translating, and compiling. Prentice Hall 1972

    Google Scholar 

  2. Backhouse, R.C.: An alternative approach to the improvements of LR(k) parsers. Acta Informatica 6, 277–296 (1976)

    Google Scholar 

  3. Culik II, K., Cohen, R.: LR-regular grammars — an extension of LR(k)-grammars. Journal Comp. Syst. Sc. 7, 66–96 (1973)

    Google Scholar 

  4. Deussen, P.: A unified approach to the generation and acception of formal languages. Acta Informatica 9, 377–390 (1978)

    Google Scholar 

  5. DeRemer, F.L.: Simple LR(k) grammars. Comm. ACM 14, 453–460 (1971)

    Google Scholar 

  6. Eickel, J., Loeckx, J.: The relation between derivations and syntactical structures in phrase-structure grammars. Journ. Comp. Syst. Sc. 6, 267–282 (1972)

    Google Scholar 

  7. Harrison, M.A., Havel, I.M.: On the parsing of deterministic languages. Journ. ACM 21, 525–548 (1974)

    Google Scholar 

  8. Geller, M.M., Harrison, M.A.: On LR(k) grammars and languages. Theor. Comp. Sc. 4, 245–276 (1977)

    Google Scholar 

  9. Hotz, G.: Eindeutigkeit und Mehrdeutigkeit formaler Sprachen. Elektron. Informationsverarb. Kybernetik 2, 235–246 (1966)

    Google Scholar 

  10. Langmaack, H.: Application of regular canonical systems to grammars translatable from left to right. Acta Informatica 1, 111–114 (1971)

    Google Scholar 

  11. Langmaack, H.: Zur Äquivalenz der Hotz'schen und Paul'schen Definition der Mehrdeutigkeit von Chomsky-Sprachen. in: 4. Kolloquium über Automatentheorie, Erlangen 1967

    Google Scholar 

  12. Loeckx, J.: An algorithm for the construction of bounded-context parsers. Comm. ACM 13, 297–307 (1970)

    Google Scholar 

  13. Loeckx, J.: The parsing for general phrase-structure grammars. Inform. Contr. 16, 443–464 (1970)

    Google Scholar 

  14. Mayer, O.: Syntaxanalyse. B.I. 1978

    Google Scholar 

  15. Nelson, R.J.: Introduction to automata. Wiley, New York 1968

    Google Scholar 

  16. Salomaa, A.: Formal languages. Academic Press, New York 1973

    Google Scholar 

  17. Szabő, P.: Der allgemeine LL-Akzeptor. Interner Bericht 3/78, Fakultät für Informatik, Universität Karlsruhe

    Google Scholar 

  18. Walters, D.A.: Deterministic context-sensitive languages. Inform. Contr. 17, 14–61 (1976)

    Google Scholar 

  19. Sattler, M.: Current diploma thesis

    Google Scholar 

  20. Drossopoulou, S.: Current diploma thesis

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Hermann A. Maurer

Rights and permissions

Reprints and permissions

Copyright information

© 1979 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Deussen, P. (1979). One abstract accepting algorithm for all kinds of parsers. In: Maurer, H.A. (eds) Automata, Languages and Programming. ICALP 1979. Lecture Notes in Computer Science, vol 71. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-09510-1_16

Download citation

  • DOI: https://doi.org/10.1007/3-540-09510-1_16

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-09510-1

  • Online ISBN: 978-3-540-35168-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics