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
The node structure of RGG.
© Copyright Policy
Related In: Results  -  Collection

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

pone.0142776.g003: The node structure of RGG.

Mentions: Zhang presents the RGG based on the LGG. In RGG, a node is a two layers structure, which includes a super vertex and some vertexes. As shown in Fig 3, statement is the label of a super vertex, T and B are the labels of two vertex. These super vertex and vertex are the terminal nodes of the edge in the graph.


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

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

The node structure of RGG.
© Copyright Policy
Related In: Results  -  Collection

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

pone.0142776.g003: The node structure of RGG.
Mentions: Zhang presents the RGG based on the LGG. In RGG, a node is a two layers structure, which includes a super vertex and some vertexes. As shown in Fig 3, statement is the label of a super vertex, T and B are the labels of two vertex. These super vertex and vertex are the terminal nodes of the edge in the graph.

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