Skip to main content
SpringerLink
Log in

On the transformation of derivation graphs to derivation trees

Preliminary report

  • Communications
  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 1981 (MFCS 1981)

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

  • 131 Accesses

Abstract

Derivation graphs of arbitrary grammars are transformed into trees. The transformations are based on the notion of ancestors, mapping subderivations into single nodes. Using the weight and the diameter of these nodes as parameters two new complexity measures on grammars are introduced, which are compared with the time and the space complexity measures of nondeterministic turing machines.

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.

References

  1. R.V. Book, Time-bounded grammars and their languages. J. Comput. System Sciences 5, 397–418 (1971).

    Google Scholar 

  2. F.J. Brandenburg, On one-way auxiliary pushdown automata. Lecture Notes in Computer Science 48, 132–144 (1977).

    Google Scholar 

  3. F.J. Brandenburg, The contextsensitivity bounds of contextsensitive grammars and languages. Lecture Notes in Computer Science 52, 120–132 (1977).

    Google Scholar 

  4. F.J. Brandenburg, Die Zusammenhangskomplexität von nicht-kontext-freien Grammatiken. Dissertation, Universität Bonn (1978).

    Google Scholar 

  5. F.J. Brandenburg, On the height of syntactical graphs. Lecture Notes in Computer Science 104, 13–21 (1981).

    Google Scholar 

  6. K. Culik II and H.A. Maurer, On the height of derivation trees. Forschungsbericht Nr. 18, Institut für Informationsverarbeitung, TU Graz (1978).

    Google Scholar 

  7. M.A. Harrison, Introduction to Formal Language Theory. Addison-Wesley, Reading (1978).

    Google Scholar 

  8. J.M. Hart, Derivation languages and syntactic categories. Information and Control 28, 204–220 (1975).

    Google Scholar 

  9. J.E. Hopcroft and J.D. Ullman, Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading (1979).

    Google Scholar 

  10. G. Hotz, Eindeutigkeit und Mehrdeutigkeit formaler Sprachen. Elektron. Informationsverarbeitung Kybernetik 2, 235–246 (1966).

    Google Scholar 

  11. Y. Igarashi, General properties of derivational complexity. Acta Informatica 8, 267–283 (1977).

    Google Scholar 

  12. T. Kamimura and G. Slutzki, DAGs and Chomsky hierarchy. Lecture Notes in Computer Science 71, 331–337 (1979).

    Google Scholar 

  13. J. Loeckx, The parsing of general phrase-structure grammars. Information and Control 16, 443–464 (1970).

    Google Scholar 

  14. M. Paterson, personal communication to H.A. Maurer.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut fuer Informatik, Universitaet Bonn, Wegelerstr. 6, 5300, Bonn, Federal Republic of Germany

    Franz-Josef Brandenburg

Authors
  1. Franz-Josef Brandenburg
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jozef Gruska Michal Chytil

Rights and permissions

Reprints and permissions

Copyright information

© 1981 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Brandenburg, FJ. (1981). On the transformation of derivation graphs to derivation trees. In: Gruska, J., Chytil, M. (eds) Mathematical Foundations of Computer Science 1981. MFCS 1981. Lecture Notes in Computer Science, vol 118. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-10856-4_88

Download citation

  • DOI: https://doi.org/10.1007/3-540-10856-4_88

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-10856-6

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation