AN EFFICIENT PARSING ALGORITHM ON NODE LABEL CONTEXT FREE GRAPH GRAMMAR
一种有效的结点标号上下文无关图文法分析算法

This paper discusses the property of context --free graph grammar firstly,and proves the order independence property of graph grammar derivation. An efficientgraph parsing algorithm which has a polynomial time Complexity is proposed, and the correctness of the parsing algorithm is proved.