@inproceedings{7e805ca72e6246f2a4804ec1b316d7eb,
title = "A fast general parser for automatic code generation",
abstract = "The code generator in a compiler attempts to match a subject tree against a collection of tree-shaped patterns for generating instructions. Tree-pattern matching may be considered as a generalization of string parsing. We propose a new generalized LR (GLR) parser, which extends the LR parser stack with a parser cactus. GLR explores all plausible parsing steps to find the least-cost matching. GLR is fast due to two properties: (1) duplicate parsing steps are eliminated and (2) partial parse trees that will not lead to a least-cost matching are discarded as early as possible.",
keywords = "ambiguous grammar, code generator, compiler, context-free grammar, general parsing, parsing, pattern matching, tree pattern, tree-pattern matching",
author = "Wuu Yang",
year = "2010",
doi = "10.1007/978-3-642-14822-4_4",
language = "English",
isbn = "3642148212",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "30--39",
booktitle = "Methods and Tools of Parallel Programming Multicomputers - Second Russia-Taiwan Symposium, MTPP 2010, Revised Selected Papers",
note = "2nd Russia-Taiwan Symposium on Methods and Tools of Parallel Programming Multicomputers, MTPP 2010 ; Conference date: 16-05-2010 Through 19-05-2010",
}