[antlr-interest] Auto- completion feature based on ANTLR

[Tom Moog]

Lookahead sets do not capture semantic predicate information used
to predict alternatives.  Perhaps you are thinking of something
like java reflection for grammars ?

Auto-complete features generally use minimal prefix matching to
select the token's interpretation.  Thus, given a choice between
MIN and MAX it will recognize MI as MIN.  This requires feedback
from the parser to the lexer or lazy evaluation of prediction
expressions.

Tom Moog


On Mon, 18 Aug 2003, Terence Parr wrote:

>
> On Monday, August 18, 2003, at 01:41 PM, Matt Benson wrote:
>
> > --- Terence Parr <parrt at cs.usfca.edu> wrote:
> >> Hi.  Auto-completion is not really convenient in the
> >> current generated
> >> output.  It's kind of like compiling C code w/o the
> >> symbol table
> >> information (-g option).  The current ANTLR 3
> >> analysis engine I'm
> >> working on makes this sort of thing trivial
> >
> > Which particular spec of version 3 will cover this?
> > Is there an updated spec-in-progress?
>
> Nope...i'm just working on the engine (throwaway prototype) at the
> moment, but this has led me to believe I can do all sorts of fancy
> tricks later if I simply serialize the grammar/lookahead info (like -g
> option) into the output parser so it's available.  The degenerate case
> might be that I don't generate the parser, just the grammar/lookahead
> info and then you can intepret it. :)
>
> Ter
> --
> Professor Comp. Sci., University of San Francisco
> Creator, ANTLR Parser Generator, http://www.antlr.org
> Co-founder, http://www.jguru.com
> Co-founder, http://www.knowspam.net enjoy email again!
> Co-founder, http://www.peerscope.com pure link sharing
>
>
>
>
>
>
> Your use of Yahoo! Groups is subject to http://docs.yahoo.com/info/terms/
>
>

 

Your use of Yahoo! Groups is subject to http://docs.yahoo.com/info/terms/