Advertisement

Recognizing rooted context-free flowgraph languages in polynomial time

  • Ulrike Lichtblau
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 532)

Abstract

We introduce context-free flowgraph grammars, which allow to replace single vertices together with their outgoing edges, thereby using the basic embedding idea of the algebraic graph grammar approach. For a naturally defined subclass of these, called the rooted grammars, an algorithm is presented which solves the language recognizing problem in time polynomial in the number of vertices of the input graphs.

Keywords

flowgraph grammar Earley's recognizing algorithm decompilation 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [CIER79]
    Claus, V., Ehrig, H., Rozenberg, G. (eds.): Graph-Grammars and Their Application to Computer Science and Biology, LNCS 73, 1979.Google Scholar
  2. [Earl 70]
    Earley, J.: An Efficient Context-Free Parsing Algorithm, Comm. ACM, Vol. 13, No. 2, 1970, 94–102.CrossRefGoogle Scholar
  3. [EhNR 83]
    Ehrig, H., Nagl, M., Rozenberg, G. (eds.): Graph Grammars and Their Application to Computer Science, LNCS153, 1983.Google Scholar
  4. [EhPS 73]
    Ehrig, H., Pfender, M., Schneider, H.J.: Graph Grammars: An Algebraic Approach, Proc. 14th Annual IEEE Symposium on Switching and Automata Theory, 1973, 167–180.Google Scholar
  5. [ENRR 87]
    Ehrig, H., Nagl, M., Rozenberg, G., Rosenfeld, A. (eds.): Graph-Grammars and Their Application to Computer Science, LNCS 291, 1987.Google Scholar
  6. [FaKZ 76]
    Farrow, R., Kennedy, K., Zucconi, L.: Graph Grammars and Global Program Data Flow Analysis, Proc. 17th Annual IEEE Symposium on Foundations of Computer Science, 1976, 42–56.Google Scholar
  7. [Habe 89]
    Habel, A.: Hyperedge Replacement: Grammars and Languages. Ph. D. Thesis, University of Bremen, 1989.Google Scholar
  8. [Kaul 86]
    Kaul, M.: Syntaxanalyse von Graphen bei Präzedenz-Graph-Grammatiken. Ph. D. Thesis, University of Passau, 1986.Google Scholar
  9. [Laut 89]
    Lautemann, C.: The complexity of graph languages generated by hyperedge replacement. Report No. 4/89, Fachbereich Mathematik und Informatik, University of Bremen, 1989.Google Scholar
  10. [Lich 85]
    Lichtblau, U.: Decompilation of Control Structures by Means of Graph Transformations LNCS 185, 1985, 284–297.Google Scholar
  11. [Lich 90]
    Lichtblau,U.: Flußgraphgrammatiken. Ph. D. Thesis, University of Oldenburg, 1990.Google Scholar
  12. [MCre 87]
    McCreary, C.L.: An Algorithm for Parsing a Graph Grammar. Ph. D. Thesis, University of Colorado, 1987.Google Scholar
  13. [Schu 87]
    Schuster, R.: Graphgrammatiken und Grapheinbettungen: Algorithmen und Komplexität. Ph. D. Thesis, University of Passau, 1987.Google Scholar
  14. [Slis 82]
    Slisenko, A.O.: Context-Free Graph Grammars as a Tool for Describing Polynomial-time Subclasses of Hard Problems, Information processing Letters 14, 1982, 52–56.CrossRefGoogle Scholar
  15. [Vogl 90]
    Vogler, W.: Recognizing Edge Replacement Graph Languages in Cubic Time. Report TUM-19017, Technical University of Munich, 1990.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  • Ulrike Lichtblau
    • 1
  1. 1.Fachbereich InformatikUniversität OldenburgOldenburgF.R.Germany

Personalised recommendations