Re: Preview in grammar

Ulrich Frank wrote:
> Hello NG,
>
> for my thesis I need a parser generator for generating a parser for a
> language similar to OQL (Object Query Language). I already found a lot
> of parser generators in the web or books but I need a special
> functionality which is not provided by every generated parser. Namely
> I need a preview which token comes next in an uncomplete input string.
> For example when you type "select abc" the preview would be "from". Or
> in "select abc from def where abc" the preview would be "<, <=, >, >=,
> equals".
>


LALR parsers can do what you want, but it involves an extra stack
which keeps track of the states already seen when a reduction takes
place (or something like that). I used to provide it with my older
product LALR 5.0.


The parser needs to simulate an error condition, then undo all
reductions, then do a trial parse for all terminal symbols in the
grammar, keeping track of which symbols enable a valid transition to a
next state. This symbol list is what you want.


Of course, canonical LR(1) is better because you have all the
information you need at the encounter of the simulated error in the
current state.


Paul Mann
http://parsetec.com

Return to the comp.compilers page.
Search the comp.compilers archives again.