hdl:10013/epic.16a48876-fdd0-40fe-b762-2b8d7795dd3e

Rule-Based Top-Down Parsing for Acyclic Contextual Hyperedge Replacement Grammars


Drewes, Frank, Hoffmann, Berthold ORCID: https://orcid.org/0000-0001-8928-2080 and Minas, Mark ;
Contact
enquiries [ at ] symplectic.co.uk

Abstract

Contextual hyperedge replacement (CHR) strengthens the generative power of hyperedge replacement (HR) significantly, thus increasing its usefulness for practical modeling. We define top-down parsing for CHR grammars by graph transformation, and prove that it is correct as long as the generation and use of context nodes in productions does not create cyclic dependencies. An efficient predictive version of this algorithm can be obtained as in the case of HR grammars.



Item Type
Conference (Paper)
Authors
Drewes, Frank, Hoffmann, Berthold ORCID: https://orcid.org/0000-0001-8928-2080 and Minas, Mark ;
Publication Status
Published
Eprint ID
55035
DOI https://www.doi.org/10.1007/978-3-030-78946-6_9

Cite as
Drewes, F. , Hoffmann, B. and Minas, M. (2021): Rule-Based Top-Down Parsing for Acyclic Contextual Hyperedge Replacement Grammars , Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) doi: https://www.doi.org/10.1007/978-3-030-78946-6_9


Download
[thumbnail of This Document is for testing.pdf]
PDF
This Document is for testing.pdf
Download (37kB)

Share


Citation


Actions
Edit Item Edit Item