%0 Journal Article
%T AN EFFICIENT PARSING ALGORITHM ON NODE LABEL CONTEXT FREE GRAPH GRAMMAR<br>一种有效的结点标号上下文无关图文法分析算法
%A Hua Quanxiang
%A Xing Hancheng
%A Feng Chunbo
%A <br>花全香
%A 邢汉承
%A 冯纯伯
%J 软件学报
%D 1995
%I 
%X 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.
%K Context-free graph grammar
%K parsing<br>上下文无关图文法，文法分析
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=7735F413D429542E610B3D6AC0D5EC59&aid=CC6A4FB19693AB4C6D64B4FDB5FF106D&yid=BBCD5003575B2B5F&vid=B31275AF3241DB2D&iid=9CF7A0430CBB2DFD&sid=41A78CBB5BAB6860&eid=E406B4E9A1BA9D8C&journal_id=1000-9825&journal_name=软件学报&referenced_num=0&reference_num=12