Title: Parsing Strategies for Context-Sensitive Graph Grammars
Abstract: Context-sensitive graph grammars have been suitable formalisms for specifying visual programming languages, as they are intuitive, sufficient expressive and equipped with parsing mechanisms. Parsing has been a fundamental issue in the research of context-sensitive graph grammars. However, the existent parsing algorithms are either inefficient or confined to a minority of graph grammars. This paper presents two strategies for general parsing algorithms, one is context matching, and the other is partitioning of productions. Through narrowing down the searching space of potential redexex, the two strategies can considerably improve the parsing performance.
Publication Year: 2019
Publication Date: 2019-09-20
Language: en
Type: article
Indexed In: ['crossref']
Access and Citation
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot