Related articles |
---|
Command completion rsunkad@fore.com (Ravindra Sunkad) (2000-04-30) |
Re: Command completion james_deen@bmc.com (James Deen) (2000-05-08) |
From: | James Deen <james_deen@bmc.com> |
Newsgroups: | comp.compilers |
Date: | 8 May 2000 00:44:01 -0400 |
Organization: | Posted via Supernews, http://www.supernews.com |
References: | 00-04-223 |
Keywords: | parse |
Hi
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.
J. Deen
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
comp.compilers page.
Search the
comp.compilers archives again.