Parsing Algorithm of Context-Sensitive Graph Grammar: Overview and Experience
上下文相关图文法分析及其应用初探

Graph grammars are natural and efficient in formally specifying visual programming languages, which are often the keys to the end user programming. Parsing based on graph grammars, especially more expressive context-sensitive grammars, is increasingly becoming important and prominent in the industrial applications. Existing references either focus only on theoretical aspects or limit to particular uses of some self-defined grammars. In this paper, we over view the general parsing process with concise notations, and abstract the step of selecting rules as a CSP problem in or der to use existing optimization methods for CSP to optimize the parsing algorithm. In addition, we present our experience on the development of an architecture-oriented Web services integration system in which a context-sensitive attributed graph grammar is used to describe and check software architectures.