An Algorithm for Hypergraph Completion According to Hyperedge Replacement Grammars

  • Steffen Mazanek
  • Sonja Maier
  • Mark Minas
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5214)


The algorithm of Cocke, Younger, and Kasami is a dynamic programming technique well-known from string parsing. It has been adopted to hypergraphs successfully by Lautemann. Therewith, many practically relevant hypergraph languages generated by hyperedge replacement can be parsed in an acceptable time. In this paper we extend this algorithm by hypergraph completion: If necessary, appropriate fresh hyperedges are inserted in order to construct a derivation. The resulting algorithm is reasonably efficient and can be directly used, among other things, for auto-completion in the context of diagram editors.


hypergraph completion hyperedge replacement parsing 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Drewes, F., Habel, A., Kreowski, H.J.: Hyperedge replacement graph grammars. In: Rozenberg, G. (ed.) Handbook of Graph Grammars and Computing by Graph Transformation, Foundations, vol. I, pp. 95–162. World Scientific, Singapore (1997)Google Scholar
  2. 2.
    Lautemann, C.: The complexity of graph languages generated by hyperedge replacement. Acta Inf. 27(5), 399–421 (1989)CrossRefMathSciNetGoogle Scholar
  3. 3.
    Kasami, T.: An efficient recognition and syntax analysis algorithm for context free languages. Scientific Report AF CRL-65-758, Air Force Cambridge Research Laboratory, Bedford, Massachussetts (1965)Google Scholar
  4. 4.
    Minas, M.: Concepts and realization of a diagram editor generator based on hypergraph transformation. Science of Computer Programming 44(2), 157–180 (2002)zbMATHCrossRefGoogle Scholar
  5. 5.
    Mazanek, S., Minas, M.: Functional-logic graph parser combinators. In: Voronkov, A. (ed.) RTA 2008. LNCS, vol. 5117, pp. 261–275. Springer, Heidelberg (2008)Google Scholar
  6. 6.
    Minas, M.: Spezifikation und Generierung graphischer Diagrammeditoren. Shaker-Verlag, Aachen (2001) zugl. Habilitationsschrift Universität Erlangen-Nürnberg (2000)Google Scholar
  7. 7.
    Bengoetxea, E., Pedro Larra, n., Bloch, I., Perchant, A.: Estimation of distribution algorithms: A new evolutionary computation approach for graph matching problems. In: Figueiredo, M., Zerubia, J., Jain, A.K. (eds.) EMMCVPR 2001. LNCS, vol. 2134, pp. 454–468. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  8. 8.
    Kaul, M.: Specification of error distances for graphs by precedence graph grammars and fast recognition of similarity. In: Tinhofer, G., Schmidt, G. (eds.) WG 1986. LNCS, vol. 246, pp. 29–40. Springer, Heidelberg (1987)Google Scholar
  9. 9.
    Sánchez, G., Lladós, J., Tombre, K.: An error-correction graph grammar to recognize texture symbols. In: Blostein, D., Kwon, Y.-B. (eds.) GREC 2001. LNCS, vol. 2390, pp. 128–138. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  10. 10.
    Costagliola, G., Deufemia, V., Polese, G., Risi, M.: Building syntax-aware editors for visual languages. Journal of Visual Languages and Computing 16(6), 508–540 (2005)CrossRefGoogle Scholar
  11. 11.
    de Lara, J., Vangheluwe, H.: Atom3: A tool for multi-formalism and meta-modelling. In: Kutsche, R.-D., Weber, H. (eds.) FASE 2002. LNCS, vol. 2306, pp. 174–188. Springer, Heidelberg (2002)Google Scholar
  12. 12.
    Sen, S., Baudry, B., Vangheluwe, H.: Domain-specific model editors with model completion. In: Multi-paradigm Modelling Workshop at MoDELS 2007 (2007)Google Scholar
  13. 13.
    Taentzer, G., Crema, A., Schmutzler, R., Ermel, C.: Generating domain-specific model editors with complex editing commands. In: Proc. Third Intl. Workshop and Symposium on Applications of Graph Transformation with Industrial Relevance (AGTIVE 2007) (2007)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Steffen Mazanek
    • 1
  • Sonja Maier
    • 1
  • Mark Minas
    • 1
  1. 1.Universität der Bundeswehr MünchenGermany

Personalised recommendations