parse and abstract syntax trees
[1/3] 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]
[2/3] from: maarten:koopmans:surfnet:nl at: 12-May-2003 11:34
No, but keep me posted ;-)
--Maarten
Andreas Bolka wrote:
[3/3] from: robert:muench:robertmuench at: 12-May-2003 22:00
> -----Original Message-----
> From: [rebol-bounce--rebol--com] [mailto:[rebol-bounce--rebol--com]]
<<quoted lines omitted: 4>>
> Has anybody ever tried to obtain the abstract syntax tree
> (AST) of a successful 'parse?
Hi, I'm not sure if parse builds an AST at all. To me the whole parse
thing always looks more like a finite-state-machine. Maybe Ladislav can
enlight us here ;-)) Robert
Notes
- Quoted lines have been omitted from some messages.
View the message alone to see the lines that have been omitted