Limits...
Research on the Top-Down Parsing Method for Context-Sensitive Graph Grammars.

Wang Y, Zeng X, Ding H - PLoS ONE (2015)

Bottom Line: The parsing problem is one of the key problems of graph grammars.The typical parsing algorithm uses the bottom-up method.This method avoids the subgraph isomorphism judgment and selects the productions specifically, so that the time-complexity is greatly reduced.

View Article: PubMed Central - PubMed

Affiliation: Institute of Intelligence Science and Technology, Hohai University, Nanjing, P.R. China.

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.

Show MeSH
A derivation process of LGG.
© Copyright Policy
Related In: Results  -  Collection

License
getmorefigures.php?uid=PMC4664237&req=5

pone.0142776.g002: A derivation process of LGG.

Mentions: On embedding method of LGG, the corresponding entity is the node both side of the productions, so these nodes are the context nodes. When embedding, through the context nodes connected to the residual graph and the nodes among the residual graph can not connect with other than the context nodes among the replacing graph. As shown in Fig 2.


Research on the Top-Down Parsing Method for Context-Sensitive Graph Grammars.

Wang Y, Zeng X, Ding H - PLoS ONE (2015)

A derivation process of LGG.
© Copyright Policy
Related In: Results  -  Collection

License
Show All Figures
getmorefigures.php?uid=PMC4664237&req=5

pone.0142776.g002: A derivation process of LGG.
Mentions: On embedding method of LGG, the corresponding entity is the node both side of the productions, so these nodes are the context nodes. When embedding, through the context nodes connected to the residual graph and the nodes among the residual graph can not connect with other than the context nodes among the replacing graph. As shown in Fig 2.

Bottom Line: The parsing problem is one of the key problems of graph grammars.The typical parsing algorithm uses the bottom-up method.This method avoids the subgraph isomorphism judgment and selects the productions specifically, so that the time-complexity is greatly reduced.

View Article: PubMed Central - PubMed

Affiliation: Institute of Intelligence Science and Technology, Hohai University, Nanjing, P.R. China.

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.

Show MeSH