| 一种有效的结点标号上下文无关图文法分析算法 |
| |
| 引用本文： | 花全香,邢汉承,冯纯伯.一种有效的结点标号上下文无关图文法分析算法[J].软件学报,1995,6(9):567-575. |
| |
| 作者姓名： | 花全香 邢汉承 冯纯伯 |
| |
| 作者单位： | 东南大学计算机系,南京,210018;东南大学计算机系,南京,210018;东南大学计算机系,南京,210018 |
| |
| 摘 要： | 本文讨论了上下文无关图文法的性质，并证明了图文法推导具有独立性．本文还给出了一种有效的上下文无关图文法分析算法，它具有多项式时间复杂性，并给出了算法的正确性证明．该算法已经用Ｃ语言实现．
|
| 关 键 词： | 上下文无关图文法，文法分析 |
| 收稿时间： | 1993/9/14 0:00:00 |
| 修稿时间： | 1994/4/26 0:00:00 |
AN EFFICIENT PARSING ALGORITHM ON NODE LABEL CONTEXT FREE GRAPH GRAMMAR |
| |
| Hua Quanxiang,Xing Hancheng and Feng Chunbo.AN EFFICIENT PARSING ALGORITHM ON NODE LABEL CONTEXT FREE GRAPH GRAMMAR[J].Journal of Software,1995,6(9):567-575. |
| |
| Authors: | Hua Quanxiang Xing Hancheng and Feng Chunbo |
| |
| Abstract: | 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. |
| |
| Keywords: | Context-free graph grammar parsing |
| 本文献已被 CNKI 维普 等数据库收录！ |
| 点击此处可从《软件学报》浏览原始摘要信息 |
|
点击此处可从《软件学报》下载全文 |
|
