|[Q] Encapsulated parsers email@example.com (1998-11-24)|
|Re: [Q] Encapsulated parsers firstname.lastname@example.org (1998-11-30)|
|Re: [Q] Encapsulated parsers email@example.com (Chris F Clark) (1998-11-30)|
|Re: [Q] Encapsulated parsers firstname.lastname@example.org (1998-11-30)|
|Re: [Q] Encapsulated parsers email@example.com (1998-12-01)|
|From:||firstname.lastname@example.org (Bob Collins)|
|Date:||1 Dec 1998 02:42:59 -0500|
|Organization:||Computer Science @ William & Mary|
email@example.com (Bob Collins) wrote:
> > Does anyone know of any research on what I call
> > encapsulated parsers, ...
> Do you actually want to parse the data in different ways--meaning
> different grammars--or just want different actions to take place
> within the parse?
Right now I use different grammars to parse similar structures in very
different ways, and the grammars are highly ambiguous, requiring
runtime disambiguation. If I could figure out how to use a signle
grammar, I would. But your ANTLR 2 approach looks quite promising.
Thank you, I will investigate it further. (For those interested, this
work is related to using parsers as the engines for classical expert
systems, a concept that unites two children, parsers and expert
systems, of Post Production Systems.)
Bob Collins <mailto:firstname.lastname@example.org> <http://ratbert.cs.wm.edu>
Return to the
Search the comp.compilers archives again.