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 program flow chart.
© Copyright Policy
Related In: Results  -  Collection

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

pone.0142776.g011: A program flow chart.

Mentions: Below in the form of a chart descript the steps of the parsing for the program flow chart in Fig 11 using the productions in Fig 8. The Table 1 contains the current judgment node, the state of the host graph, the change of the target production and the target node, and lists the matching condition of the candidate production of the current judgment node and each step, and indicates the re-back condition.


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

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

A program flow chart.
© Copyright Policy
Related In: Results  -  Collection

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

pone.0142776.g011: A program flow chart.
Mentions: Below in the form of a chart descript the steps of the parsing for the program flow chart in Fig 11 using the productions in Fig 8. The Table 1 contains the current judgment node, the state of the host graph, the change of the target production and the target node, and lists the matching condition of the candidate production of the current judgment node and each step, and indicates the re-back condition.

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