Approximating Parikh Images for Generating Deterministic Graph Parsers
2016 (English)In: 7th International Workshop on Graph Computation Models / [ed] Barbara König, 2016Conference paper (Refereed)
The Parikh image of a word abstracts from the order of its letters. Parikh's famous theorem states that the set of Parikh images of a context-free string language forms a semilinear set that can be effectively computed from its grammar. In this paper we study the computation of Parikh images for graph grammars defined by contextual hyperedge replacement (CHR). Our motivation is to generate efficient predictive top-down (PTD) parsers for a subclass of CHR grammars. We illustrate this by describing the subtask that identifies the nodes of the input graph that parsing starts with.
Place, publisher, year, edition, pages
IdentifiersURN: urn:nbn:se:umu:diva-121079OAI: oai:DiVA.org:umu-121079DiVA: diva2:930933
7th International Workshop on Graph Computation Models