Skip to main content
SpringerLink
Log in

Predictive Top-Down Parsing for Hyperedge Replacement Grammars

  • Conference paper
  • First Online:
Graph Transformation (ICGT 2015)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 9151))

Included in the following conference series:

Abstract

Graph languages defined by hyperedge replacement grammars can be NP-complete. We invent predictive top-down (PTD) parsers for a subclass of these grammars, similar to recursive descent parsers for string languages. The focus of this paper lies on the grammar analysis that computes neighbor edges of nonterminals, in analogy to the first and follow symbols used in SLL(1) parsing. The analysis checks whether a grammar is PTD parsable and yields all information for generating a parser that runs in linear space and quadratic time.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    Lautemann’s result has been exploited for parsing natural language in the system Bolinas [2].

  2. 2.

    We assume that the order of edges in a right-hand side is provided with the HR grammar. Finding an appropriate order automatically is left to future work.

  3. 3.

    On \(\mathbb {N}^k\), sums and scalar products are defined component-wise as usual.

References

  1. Aalbersberg, I., Ehrenfeucht, A., Rozenberg, G.: On the membership problem for regular DNLC grammars. Discrete Appl. Math. 13, 79–85 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  2. Chiang, D., Andreas, J., Bauer, D., Hermann, K. M., Jones, B., Knight, K.: Parsing graphs with hyperedge replacement grammars. In: Proceedings of the 51st Annual Meeting of the Association for Computational Linguistics, Sofia, Bulgaria. Long Papers, vol. 1, pp. 924–932, August 2013

    Google Scholar 

  3. Costagliola, G., De Lucia, A., Orefice, S., Tortora, G.: A parsing methodology for the implementation of visual systems. IEEE Trans. Softw. Eng. 23(12), 777–799 (1997)

    Article  Google Scholar 

  4. Drewes, F.: Recognising \(k\)-connected hypergraphs in cubic time. Theor. Comput. Sci. 109, 83–122 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  5. Drewes, F., Hoffmann, B.: Contextual hyperedge replacement. Acta Informatica, 31 (2015, accepted for publication). doi:10.1007/s00236-015-0223-4

    Google Scholar 

  6. Franck, R.: A class of linearly parsable graph grammars. Acta Informatica 10(2), 175–201 (1978)

    Article  MathSciNet  MATH  Google Scholar 

  7. Fürst, L., Mernik, M., Mahnič, V.: Improving the graph grammar parser of Rekers and Schürr. IET Softw. 5(2), 246–261 (2011)

    Article  Google Scholar 

  8. Habel, A. (ed.): Hyperedge Replacement: Grammars and Languages. LNCS, vol. 643. Springer, Heidelberg (1992)

    MATH  Google Scholar 

  9. Hoffmann, B., Minas, M.: Defining models - meta models versus graph grammars. In: Proceedings of the 6th Workshop on Graph Transformation and Visual Modeling Techniques (GT-VMT 2010), Electronic Communications of the EASST, 29, Paphos, Cyprus (2010)

    Google Scholar 

  10. Kaul, M.: Practical applications of precedence graph grammars. In: Ehrig, H., Nagl, M., Rozenberg, G., Rosenfeld, A. (eds.) Graph-Grammars and Their Application to Computer Science. LNCS, vol. 291, pp. 326–342. Springer, Heidelberg (1986)

    Chapter  Google Scholar 

  11. Lautemann, C.: The complexity of graph languages generated by hyperedge replacement. Acta Informatica 27, 399–421 (1990)

    Article  MathSciNet  Google Scholar 

  12. Lewis II, P.M., Stearns, R.E.: Syntax-directed transduction. JACM 15(3), 465–488 (1968)

    Article  MATH  Google Scholar 

  13. Ludwigs, H.J.: A LR-like analyzer algorithm for graphs. In: Wilhelm, R. (ed.) GI - 10. Jahrestagung: Saarbrücken, 30. September - 2. Oktober 1980. Informatik-Fachberichte, vol. 33, pp. 321–335. Springer, Heidelberg (1980)

    Google Scholar 

  14. Minas, M.: Diagram editing with hypergraph parser support. In: Proceedings of 1997 IEEE Symposium on Visual Languages (VL 1997), Capri, Italy, pp. 226–233 (1997)

    Google Scholar 

  15. Parikh, R.J.: On context-free languages. JACM 13(4), 570–581 (1966)

    Article  MathSciNet  MATH  Google Scholar 

  16. Rekers, J., Schürr, A.: Defining and parsing visual languages with layered graph grammars. J. Vis. Lang. Comput. 8(1), 27–55 (1997)

    Article  Google Scholar 

  17. Vogler, W.: Recognizing edge replacement graph languages in cubic time. In: Ehrig, H., Kreowski, H.-J., Rozenberg, G. (eds.) Graph Grammars and Their Application to Computer Science. LNCS, vol. 532, pp. 676–687. Springer, Heidelberg (1991)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Umeå Universitet, Umeå, Sweden

    Frank Drewes

  2. DFKI Bremen and Universität Bremen, Bremen, Germany

    Berthold Hoffmann

  3. Universität der Bundeswehr München, Neubiberg, Germany

    Mark Minas

Authors
  1. Frank Drewes
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Berthold Hoffmann
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Mark Minas
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Berthold Hoffmann .

Editor information

Editors and Affiliations

  1. Dipartimento di Informatica, Sapienza Università di Roma, Rome, Italy

    Francesco Parisi-Presicce

  2. Angewandte Informatik 1, Universität Bayreuth, Bayreuth, Germany

    Bernhard Westfechtel

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Drewes, F., Hoffmann, B., Minas, M. (2015). Predictive Top-Down Parsing for Hyperedge Replacement Grammars. In: Parisi-Presicce, F., Westfechtel, B. (eds) Graph Transformation. ICGT 2015. Lecture Notes in Computer Science(), vol 9151. Springer, Cham. https://doi.org/10.1007/978-3-319-21145-9_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-21145-9_2

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-21144-2

  • Online ISBN: 978-3-319-21145-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation