Abstract
Predictive shift-reduce (PSR) parsing for a subclass of hyperedge replacement graph grammars has recently been devised by Frank Drewes and the authors. This paper describes in detail how efficient PSR parsers are generated with the Grappa parser generator implemented by Mark Minas. Measurements confirm that the generated parsers run in linear time.
Author supplied keywords
Cite
CITATION STYLE
Hoffmann, B., & Minas, M. (2018). Generating Efficient Predictive Shift-Reduce Parsers for Hyperedge Replacement Grammars. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10748 LNCS, pp. 76–91). Springer Verlag. https://doi.org/10.1007/978-3-319-74730-9_7
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
