Abstract
Extended context-free grammars are context-free grammars in which the right-hand sides of productions are allowed to be any regular language rather than being restricted to only finite languages. We present a novel view on top-down predictive parser construction for extended context-free grammars that is based on the rewriting of partial syntax trees. This work is motivated by our development of ECFG, a Java toolkit for the manipulation of extended context-free grammars, and by our continuing investigation of XML. © Springer-Verlag Berlin Heidelberg 2003.
Cite
CITATION STYLE
Brüggemann-Klein, A., & Wood, D. (2003). On predictive parsing and extended context-free grammars. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2598, 69–87. https://doi.org/10.1007/3-540-36477-3_6
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
