Parsing Hypergraphs using Context-Free Positional Grammars
Fuente:
arXiv
Salvato in:
| Autori principali: | , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2026
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866908751672377344 |
|---|---|
| author | Costagliola, Gennaro Vastarini, Federico |
| author_facet | Costagliola, Gennaro Vastarini, Federico |
| contents | We present a novel work-in-progress approach to the parsing of hypergraphs generated by context-free hyperedge replacement grammars. This method is based on a new LR parsing technique for positional grammars, which is also under active development. Central to our approach is a reduction from hyperedge replacement to positional grammars with additional structural constraints, enabling the use of permutation-based operations to determine the correct ordering of hyperedges on the right-hand side of productions. Preliminary results also reveal a distinction between ambiguity in graph generation and ambiguity in graph recognition. While the exact class of hyperedge replacement languages parsable under this method remains under investigation, the approach provides a promising foundation for future generalisations to more expressive grammar formalisms. Graph parsing remains a broadly relevant problem across numerous domains, and our contribution aims to advance both the theoretical and practical understanding of this challenge. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2601_03896 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Parsing Hypergraphs using Context-Free Positional Grammars Costagliola, Gennaro Vastarini, Federico Formal Languages and Automata Theory F.4.2,F.4.3 We present a novel work-in-progress approach to the parsing of hypergraphs generated by context-free hyperedge replacement grammars. This method is based on a new LR parsing technique for positional grammars, which is also under active development. Central to our approach is a reduction from hyperedge replacement to positional grammars with additional structural constraints, enabling the use of permutation-based operations to determine the correct ordering of hyperedges on the right-hand side of productions. Preliminary results also reveal a distinction between ambiguity in graph generation and ambiguity in graph recognition. While the exact class of hyperedge replacement languages parsable under this method remains under investigation, the approach provides a promising foundation for future generalisations to more expressive grammar formalisms. Graph parsing remains a broadly relevant problem across numerous domains, and our contribution aims to advance both the theoretical and practical understanding of this challenge. |
| title | Parsing Hypergraphs using Context-Free Positional Grammars |
| topic | Formal Languages and Automata Theory F.4.2,F.4.3 |
| url | https://arxiv.org/abs/2601.03896 |