Context-sensitive graph grammars have been intuitive and rigorous formalisms for specifying visual programming languages, as they are 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 proposes a general parsing algorithm with two embedded strategies, context matching and production-set partitioning. The two strategies can greatly narrow down the search space of redexes and thus significantly improve parsing efficiency, even though the worst-case time complexity is not theoretically reduced. Moreover, a detailed case study and an experiment are provided accordingly to demonstrate the paring process and performance of the proposed algorithm.

上下文敏感的图文法一直是用于指定可视化编程语言的直观和严格的形式，因为它们具有足够的表现力并配备了解析机制。解析一直是上下文敏感图文法研究中的一个基本问题。然而，现有的解析算法要么效率低下，要么仅限于少数图文法。本文提出了一种具有两种嵌入策略的通用解析算法，上下文匹配和生产集分区。这两种策略可以大大缩小redexes的搜索空间，从而显着提高解析效率，即使最坏情况的时间复杂度在理论上并没有降低。而且，