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 styles of the productions of CGG.
© Copyright Policy
Related In: Results  -  Collection

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

pone.0142776.g007: The styles of the productions of CGG.

Mentions: Definition 16 A production P: pL: = pR, pL and pR are two Open-Unions. Specifically, when the left-hand side of a production is the initial graph, the right-hand side is a Closed-Union. It is shown in Fig 7.


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

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

The styles of the productions of CGG.
© Copyright Policy
Related In: Results  -  Collection

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

pone.0142776.g007: The styles of the productions of CGG.
Mentions: Definition 16 A production P: pL: = pR, pL and pR are two Open-Unions. Specifically, when the left-hand side of a production is the initial graph, the right-hand side is a Closed-Union. It is shown in Fig 7.

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