Edge-based graph grammar: theory and support system

As a useful formal tool, graph grammar provides a rigorous but intuitive way for defining graphical languages and analyzing graphs. This paper presents a new context-sensitive graph grammar formalism called Edge-based Graph Grammar or EGG, in which a new methodology is proposed to tackle issues, such as the embedding problem, the membership problem and the parsing algorithm. It presents the formal definitions of EGG and its language with a proof of its decidability. Then, a new parsing algorithm with an analyses of its computational complexity is given for checking the structural correctness or validity of a given host graph. The paper finally describes the development of an EGG support system with friendly GUI. Keywords-component; graph grammar; graphical language; embedding problem; parsing; production rule