A parser for context free plex grammars

  • H. Bunke
  • B. Haller
Graph Grammars: Theory And Application
Part of the Lecture Notes in Computer Science book series (LNCS, volume 411)


Plex grammars according to [13], generating two-dimensional plex structures, are a generalization of string grammars. In this paper we describe a parser for context free plex grammars. The parser is an extension of Earley's algorithm, which was originally developed for context free string grammars. Our parser is able to recognize not only complete structures generated by a plex grammar but also partial ones. The algorithm has been implemented and tested on a number of examples. The time complexity of the parser is exponential in general, but there exist subclasses of plex languages for which the parser has a polynomial time complexity.

Key words

formal languages parsing Earley's algorithm two-dimensional structures plex grammars plex grammar parser 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Claus, V. / Ehrig, H. / Rozenberg, G. (eds.): Graph-grammars and their application to computer science and biology, Proc. 1st Int. Workshop, Lecture Notes in Comp. Sci. 73, Springer Verlag, 1979.Google Scholar
  2. [2]
    Ehrig, H. / Nagl, M. / Rozenberg, G. (eds.): Graph-grammars and their application to computer science, Proc. 2nd Int. Workshop, Lecture Notes in Comp. Sci. 153, Springer Verlag, 1982.Google Scholar
  3. [3]
    Ehrig, H. / Nagl, M. / Rozenberg, G. / Rosenfeld, A. (eds.): Graph-grammars and their application to computer science, Proc. 3rd Int. Workshop, Lecture Notes in Comp. Sci. 291, Springer Verlag, 1987.Google Scholar
  4. [4]
    Franck, R.: A class of linearly parsable graph grammars, Acta Informatica 10, 1978, 175–201.CrossRefGoogle Scholar
  5. [5]
    Kaul, M.: Syntaxanalyse von Graphen bei Präzedenz-Graph-Grammatiken, Techn. Report MIP-8610, University of Passau, FRG, 1986.Google Scholar
  6. [6]
    Kaul, M.: Computing the minimum error distance of graphs in O(n 3) time with precedence graph grammars, in Ferrate, G. / Paulidis, T. / Sanfeliu, A. / Bunke, H.: Syntactic and Structural Pattern Recognition, Springer Verlag, NATO ASI Series, 1988, 69–83.Google Scholar
  7. [7]
    Della Vigna, P. / Ghezzi, C.: Context-free graph grammars, Information and Control 37, 1978, 207–233.CrossRefGoogle Scholar
  8. [8]
    Sanfeliu, A. / Fu, K.S.: Tree graph grammars for pattern recognition, in [2], 349–368.Google Scholar
  9. [9]
    Shi, Q.-Y. / Fu, K.S.: Parsing and translation of (attributed) expansive graph languages for scene analysis, IEEE Trans. PAMI-5, 1983, 472–485.Google Scholar
  10. [10]
    Brandenburg, F.J.: On partially ordered graph grammars, in [3], 99–111Google Scholar
  11. [11]
    Flasinski, M.: Parsing of edNLC-grammars for scene analysis, Pattern Recognition 21, 1988, 623–629.CrossRefMathSciNetGoogle Scholar
  12. [12]
    Lautemann, C.: Efficient algorithms on context-free graph languages, in Lepistö, T. / Salomaa, A. (eds.): Automata, Languages and Programming, Proc. 15th Int. Coll., Lecture Notes in Comp. Sci. 317, Springer Verlag, 1988, 362–378.Google Scholar
  13. [13]
    Feder, J.: Plex languages, Information Sciences 3, 225–241, 1971Google Scholar
  14. [14]
    Lin, W.C. / Fu, K.S.: A syntactic approach to 3D object representation and recognition, TR-EE 84-16, Purdue University, West Lafayette, Indiana, June 1984.Google Scholar
  15. [15]
    Earley, J.: An efficient context-free parsing algorithm, Communications of the ACM, Vol. 13, No. 2, 94–102, Feb. 1970.CrossRefGoogle Scholar
  16. [16]
    Chang, S.K. et al., Visual programming, Plenum, 1986.Google Scholar
  17. [17]
    Lin, W.C. / Fu, K.S.: A syntactic approach to 3-D object representation, IEEE Transaction on Pattern Analysis and Machine Intelligence, Vol. PAMI-6, No. 3, 351–364, May 1984.Google Scholar
  18. [18]
    Habel, A. / Kreowski, H.-J.: May we introduce to you: hyperedge replacement, in [3], 15–26.Google Scholar
  19. [19]
    Courcelle, B.: Some applications of logic of universal algebra and of category theory to the theory of graph transformations, Bulletin of the EATCS 36, 1988, 161–213.Google Scholar
  20. [20]
    Haller, B.: A parser for context-free plex grammars, Diploma Thesis, Institute of Informatics and Applied Mathematics, University of Bern, Switzerland, 1989 (in German).Google Scholar
  21. [21]
    Leung, J.Y.-T. / Witthof, J. / Vornberger, O.: On some variations of the bandwith minimization problem, SIAM J. Comp. 13, 1984, 650–667.CrossRefGoogle Scholar
  22. [22]
    Aho, A.V. / Peterson, T.G.: A minimum distance error-correcting parser for context-free languages, SIAM J. Comput., Vol. 1, No. 4, 305–312, Dec. 1972.CrossRefGoogle Scholar
  23. [23]
    Lu, S.Y. / Fu, K.S.: Stochastic error-correcting syntax analysis for recognition of noisy patterns, IEEE Transactions on Systems, Men, and Cybernetics, Vol. SMC-8, 380–401, 1978.Google Scholar
  24. [24]
    Bunke, H. / Pasche, D.: Parsing multivalued strings and its application to image and waveform recognition, in Mohr, R. (ed.): Proceedings of the Workshop on Syntactical and Structural Pattern Recognition, Pont-à-Mousson, September 1988, World Scientific Publ. Co., Singapore, in print.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1990

Authors and Affiliations

  • H. Bunke
    • 1
  • B. Haller
    • 1
  1. 1.Institut fuer Informatik und Angewandte MathematikBernSwitzerland

Personalised recommendations