In this paper we describe a neighborhood-controlled embedding (NCE) context-sensitive graph grammar. The grammar can be flexibly used to formalize the graph-syntax rules of a wide range of visual languages. We discuss parsability, that is, whether or not a derivation can be found for a given graph by the reverse application of the grammar's productions. We also discuss the composition of the production copies. The composition of the production copies is of theoretical and practical significance in the definition of graph-rewriting rules that can be used to produce sub-graphs of desired structures on the basis of a given graph grammar. We also outline a system called GRAVIS that we have implemented. GRAVIS is intended to support the design of visual languages based on NCE context-sensitive graph grammars.
展开▼
