|Object-oriented AST firstname.lastname@example.org (Thomas Weiss) (2006-04-08)|
|Re: Object-oriented AST email@example.com (Florian Liekweg) (2006-04-09)|
|Re: Object-oriented AST cfc@shell01.TheWorld.com (Chris F Clark) (2006-04-12)|
|Re: Object-oriented AST firstname.lastname@example.org (Thomas Weiss) (2006-04-16)|
|From:||Thomas Weiss <email@example.com>|
|Date:||16 Apr 2006 09:57:52 -0400|
|References:||06-04-055 06-04-062 06-04-081|
|Posted-Date:||16 Apr 2006 09:57:52 EDT|
Thank very much for your answers. Be sure these help me a lot.
In fact, I'm trying to design an AST for an ASN.1 compiler, and rules
descending from multiple parents appear often in the ASN.1 grammar.
I will try to post here the results of my work, as soon as I reach
something consistent and interesting.
"Chris F Clark" <cfc@shell01.TheWorld.com> a écrit dans le message de news:
> Thomas Weiss wrote:
>> I am looking for an
>> efficient way to design abstract syntax trees in object-oriented
> ... [example showing inheirtance matching parsing stratgy snipped]
> This method was been followed [with some success I presume] in the
> Cocktail toolkit by Josef Gro\:lsh. ...
Return to the
Search the comp.compilers archives again.