|Interactive Parsing email@example.com (Marielle Fois) (2000-07-27)|
|Interactive Parsing firstname.lastname@example.org (Yves Dufournaud) (1995-08-01)|
|Re: Interactive Parsing johnm@soda.CSUA.Berkeley.EDU (1995-08-08)|
|From:||Marielle Fois <email@example.com>|
|Date:||27 Jul 2000 21:35:22 -0400|
I am facing a problem and am seeking advice about it. It goes like
this. I am working with context dependent grammars, and what we want
to do is to calculate the list of possible completions (i.e. the list
of tokens) that the grammar accepts, while we type expressions of the
grammar. That is, in an interactive way, for each character you type,
the list of possible completions is calculated. I don't know if I
explain myself well enough. This was an easy problem to solve for
context free grammars, but adding attributes to the grammar and
handling the dependencies between the attributes is not being that
easy and it is getting a bit ugly. Also, this problem doesn't depend
on any particular grammar, as we have several.
I would very much appreciate if someone could give me any reference
to how others solved this problem.
Thanks in advice,
Return to the
Search the comp.compilers archives again.