Graph languages defined by hyperedge replacement grammars can be NP-complete. We invent predictive top-down (PTD) parsers for a subclass of these grammars, similar to recursive descent parsers for string languages. The focus of this paper lies on the grammar analysis that computes neighbor edges of nonterminals, in analogy to the first and follow symbols used in SLL(1) parsing. The analysis checks whether a grammar is PTD parsable and yields all information for generating a parser that runs in linear space and quadratic time.
CITATION STYLE
Drewes, F., Hoffmann, B., & Minas, M. (2015). Predictive top-down parsing for hyperedge replacement grammars. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9151, pp. 19–34). Springer Verlag. https://doi.org/10.1007/978-3-319-21145-9_2
Mendeley helps you to discover research relevant for your work.