Cargando…
Research on the Top-Down Parsing Method for Context-Sensitive Graph Grammars
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 av...
Autores principales: | Wang, Yi, Zeng, XiaoQin, Ding, Han |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Public Library of Science
2015
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4664237/ https://www.ncbi.nlm.nih.gov/pubmed/26618493 http://dx.doi.org/10.1371/journal.pone.0142776 |
Ejemplares similares
-
Graph Parsing as Graph Transformation: Correctness of Predictive Top-Down Parsers
por: Drewes, Frank, et al.
Publicado: (2020) -
When Grammar and Parsing Agree
por: Mancini, Simona
Publicado: (2018) -
Event parsing and the origins of grammar
por: Zuberbühler, Klaus
Publicado: (2021) -
Parsing with Perl 6 regexes and grammars: a recursive descent into parsing
por: Lenz, Moritz
Publicado: (2017) -
Parsing Social Network Survey Data from Hidden Populations Using Stochastic Context-Free Grammars
por: Poon, Art F. Y., et al.
Publicado: (2009)