| Art der Veröffentlichung: |
Artikel |
| Autor: |
Frank Drewes, Berthold Hoffmann, Mark Minas |
| Titel: |
Formalization and Correctness of Predictive Shift-Reduce Parsers for Graph Grammars based on Hyperedge Replacement |
| Band: |
104 |
| Seite(n): |
303 – 341 |
| Zeitschrift: |
Journal on Locical and Algebraic Methods for Programming |
| Erscheinungsjahr: |
2019 |
| Abstract / Kurzbeschreibung: |
Hyperedge replacement (HR) grammars can generate NP-complete graph languages, which makes parsing is hard even for fixed HR languages. Therefore, we study predictive shift-reduce (PSR) parsing that yields efficient parsing for a subclass of HR grammars, by generalizing the concepts of SLR(1) string parsing to graphs. We formalize the construction of PSR parsers and show that it is correct. SR parsers run in linear space and time, and are more efficient than predictive top-down (PTD) parsers recently developed by the authors. |
| Internet: |
https://arxiv.org/abs/1812.11927}{https://arxiv.org/abs/1812.11927 |
| PDF Version: |
http://www.informatik.uni-bremen.de/~hof/papers/JLAMP19.pdf |
| Status: |
Reviewed |
| Letzte Aktualisierung: |
15. 03. 2019 |
