Research on the Top-Down Parsing Method for Context-Sensitive Graph Grammars.
basic_science · Level V
Where this comes from
- Record sourced from PubMed, PMID 26618493.
- Also identified by DOI 10.1371/journal.pone.0142776 and PMC identifier PMC4664237.
- No licence information is recorded for this record.
- Because redistribution is not established, this page shows the abstract only. Follow the links below for the full text.
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.