[REBOL] parse and abstract syntax trees
From: andreas:bolka:gmx at: 12-May-2003 0:05
Has anybody ever tried to obtain the abstract syntax tree (AST) of a
successful 'parse?
Ideally, I would like to obtain an AST by not having to manually
modify the original rules. However, I'd be happy to augment the rules
programmatically or split the grammar into rules and lexical symbols.
Actually, I've done a some stuff myself but I think I am stuck at the
moment. Anybody out there who already experimented along similar
lines?
--
Best regards,
Andreas mailto:[andreas--bolka--gmx--net]
