title: Research on the Top-Down Parsing Method for Context-Sensitive Graph Grammars.
abstract: The parsing problem is one of the key problems of graph grammars. The typical parsing algorithm uses the bottom-up method. The time-complexity of this method is high, and it is difficult to apply. In order to reduce the time-complexity, this paper uses the top-down method for parsing. This method avoids the subgraph isomorphism judgment and selects the productions specifically, so that the time-complexity is greatly reduced.
authors.affiliation: Institute of Intelligence Science and Technology, Hohai University, Nanjing, P.R. China.|School of Mathematical and Computer Sciences, Hubei University of Arts and Science, Xiangyang, China.
authors.forename: Yi
authors.initials: Y
authors.lastname: Wang
authors.affiliation: Institute of Intelligence Science and Technology, Hohai University, Nanjing, P.R. China.
authors.forename: XiaoQin
authors.initials: X
authors.lastname: Zeng
authors.affiliation: School of Mathematical and Computer Sciences, Hubei University of Arts and Science, Xiangyang, China.
authors.forename: Han
authors.initials: H
authors.lastname: Ding
mesh_terms: D055641:Mathematical Concepts