TY - JOUR
T1 - On predictive parsing and extended context-free grammars
AU - Brüggemann-Klein, Anne
AU - Wood, Derick
PY - 2003
Y1 - 2003
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=35248822790&partnerID=8YFLogxK
U2 - 10.1007/3-540-44977-9_24
DO - 10.1007/3-540-44977-9_24
M3 - Article
AN - SCOPUS:35248822790
SN - 0302-9743
VL - 2608
SP - 239
EP - 247
JO - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
JF - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ER -