Načítá se...
Graph Parsing as Graph Transformation: Correctness of Predictive Top-Down Parsers
Hyperedge replacement (HR) allows to define context-free graph languages, but parsing is NP-hard in the general case. Predictive top-down (PTD) is an efficient, backtrack-free parsing algorithm for subclasses of HR and contextual HR grammars, which has been described and implemented in earlier work,...
Uloženo v:
| Vydáno v: | Graph Transformation |
|---|---|
| Hlavní autoři: | , , |
| Médium: | Artigo |
| Jazyk: | Inglês |
| Vydáno: |
2020
|
| Témata: | |
| On-line přístup: | https://ncbi.nlm.nih.gov/pmc/articles/PMC7314914/ https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1007/978-3-030-51372-6_13 |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo otaguje tento záznam!
|