|Command completion firstname.lastname@example.org (Ravindra Sunkad) (2000-04-30)|
|Re: Command completion email@example.com (James Deen) (2000-05-08)|
|From:||James Deen <firstname.lastname@example.org>|
|Date:||8 May 2000 00:44:01 -0400|
|Organization:||Posted via Supernews, http://www.supernews.com|
I also have a need for something of a similar nature. Its fairly easy
to look at the current state and check for all the current tokens that
could be shifted, but then I don't know a *good* way to proceed. The
problem is that you have to save the current state and run the machine
on default reductions and check for tokens that become valid at a
later state. I wasn't willing to go this far-
Love to hear any more authoritative replies.
Ravindra Sunkad wrote:
> I am trying to provide command line completion for a (interpreter)
> language whose parser is LEX/YACC based. Does anyone have any ideas
> what would be the best way to do this?
Return to the
Search the comp.compilers archives again.