References

  1. Laura Banarescu, Claire Bonial, Shu Cai, Madalina Georgescu, Kira Griffitt, Ulf Hermjakob, Kevin Knight, Philipp Koehn, Martha Palmer & Nathan Schneider (2013): Abstract Meaning Representation for Sembanking. In: Proc. 7th Linguistic Annotation Workshop at ACL 2013 Workshop, pp. 178–186. Available at https://www.aclweb.org/anthology/W13-2322.
  2. David Chiang, Jacob Andreas, Daniel Bauer, Karl Moritz Hermann, Bevan Jones & Kevin Knight (2013): Parsing Graphs with Hyperedge Replacement Grammars. In: Proc. 51st Ann. Meeting of the Assoc. for Computational Linguistic (Vol. 1: Long Papers), pp. 924–932. Available at https://www.aclweb.org/anthology/P13-1091.
  3. Frank Drewes, Annegret Habel & Hans-Jörg Kreowski (1997): Hyperedge Replacement Graph Grammars. In: Grzegorz Rozenberg: Handbook of Graph Grammars and Computing by Graph Transformation. Vol. I: Foundations, chapter 2. World Scientific, Singapore, pp. 95–162, doi:10.1142/9789812384720_0002.
  4. Frank Drewes, Berthold Hoffmann & Mark Minas (2016): Approximating Parikh Images for Generating Deterministic Graph Parsers. In: Software Technologies: Applications and Foundations - STAF 2016 Collocated Workshops, Revised Selected Papers, LNCS 9946, pp. 112–128, doi:10.1007/978-3-319-50230-4_9.
  5. Frank Drewes, Berthold Hoffmann & Mark Minas (2019): Formalization and Correctness of Predictive Shift-Reduce Parsers for Graph Grammars based on Hyperedge Replacement. Journal of Logical and Algebraic Methods in Programming 104, pp. 303–341, doi:10.1016/j.jlamp.2018.12.006. Preprint available also at https://arxiv.org/abs/1812.11927.
  6. Giorgios Robert Economopoulos (2006): Generalised LR parsing algorithms. Ph.D. thesis. Department of Computer Science, Royal Holloway, University of London.
  7. Jonas Groschwitz, Alexander Koller & Christoph Teichmann (2015): Graph parsing with s-graph grammars. In: Proceedings of the 53rd Annual Meeting of the Association for Computational Linguistics, ACL 2015, Volume 1: Long Papers, pp. 1481–1490, doi:10.3115/v1/P15-1143.
  8. Annegret Habel (1992): Hyperedge Replacement: Grammars and Languages. LNCS 643. Springer, doi:10.1007/BFb0013875.
  9. Berthold Hoffmann & Mark Minas (2019): Generalized Predictive Shift-Reduce Parsing for Hyperedge Replacement Graph Grammars. In: Carlos Martín-Vide, Alexander Okhotin & Dana Shapira: Language and Automata Theory and Applications (LATA 2019), Proceedings, Lecture Notes in Computer Science 11417. Springer, pp. 233–245, doi:10.1007/978-3-030-13435-8_17.
  10. James R. Kipps (1991): GLR Parsing in Time O(n^3). In: Masaru Tomita: Generalized LR Parsing. Springer US, Boston, MA, pp. 43–59, doi:10.1007/978-1-4615-4034-2_4.
  11. Donald E. Knuth (1965): On the translation of languages from left to right. Information and Control 8(6), pp. 607 – 639, doi:10.1016/S0019-9958(65)90426-2.
  12. Clemens Lautemann (1990): The complexity of graph languages generated by hyperedge replacement. Acta Informatica 27, pp. 399–421, doi:10.1007/BF00289017.
  13. Mark Minas (2002): Concepts and Realization of a Diagram Editor Generator Based on Hypergraph Transformation. Science of Computer Programming 44(2), pp. 157–180, doi:10.1016/S0167-6423(02)00037-0.
  14. Elizabeth Scott & Adrian Johnstone (2006): Right nulled GLR parsers. ACM Transactions on Programming Languages and Systems 28(4), pp. 577–618, doi:10.1145/1146809.1146810.
  15. Elizabeth Scott, Adrian Johnstone & Giorgios Economopoulos (2007): BRNGLR: a cubic Tomita-style GLR parsing algorithm. Acta Informatica 44(6), pp. 427–461, doi:10.1007/s00236-007-0054-z.
  16. Gabriele Taentzer & Arend Rensink (2005): Ensuring Structural Constraints in Graph-Based Models with Type Inheritance. In: Maura Cerioli: Fundamental Approaches to Software Engineering. Springer Berlin Heidelberg, Berlin, Heidelberg, pp. 64–79, doi:10.1007/978-3-540-31984-9_6.
  17. Masaru Tomita (1985): An Efficient Context-Free Parsing Algorithm for Natural Languages. In: Proceedings of the 9th International Joint Conference on Artificial Intelligence, pp. 756–764. Available at http://dl.acm.org/citation.cfm?id=1623611.1623625.

Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org