Constructing Confluent Context-sensitive Graph Grammars from Non-confluent Productions for Parsing Efficiency
The efficient parsing algorithms are usually confined to confluent graph grammars in context-sensitive formalisms, whereas the confluence condition is not frequently met by graph grammars in practical applications. This paper, based on the Reserved Graph Grammar (RGG) formalism, proposes an extended formalism XRGG which allows imposing constraints characterizing application situations on graph productions. The constraints can make the redexes of the XRGG productions' right graphs mutually exclusive so as to ensure the confluence of the corresponding graph grammar. Then an algorithm is developed to construct a confluent XRGG graph grammar from an RGG grammar with non-confluent productions for tackling identical graph languages. This method can be easily generalized to other context-sensitive graph grammar formalisms, thus making the efficient parsing algorithm of the RGG that depends on confluent graph grammars more widely applicable.
KeywordsContext-sensitive graph grammar confluence parsing algorithm constraint extended productions
Unable to display preview. Download preview PDF.
This work is supported by the National Grand Fundamental Research Program of China (973) under grant 2009CB320702, and the National Natural Science Foundation of China under grants 60571948, 60673186, 60736015 and 60721002.
- 8.Zou Y., Zeng X.Q., Han X.Q., Zhang K.: Context-Attributed Graph Grammar Framework for Specifying Visual Languages. Journal of Southeast University (English Edition) 24(4), 455-461 (2008)Google Scholar
- 11.Bottoni P., Taentzer G., Schürr A.: Efficient Parsing of Visual Languages based on Critical Pair Analysis and Contextual Layered Graph Transformation. In: 17th IEEE International Symposium on Visual Languages, pp.5–60. IEEE Press, Washington, DC (2000)Google Scholar