From: idbaxter@semdesigns.com
"Aaron Gray" wrote
> "Torben "Ęgidius" Mogensen" wrote in message
> > "Aaron Gray" writes:
> >
> > GLR parsers are able to parse ambiguous grammars, so this is trivially
> > true.
>
> The programmer has to program the points at which the GLR actually
> branches.
How so? All we write are simple context free grammar rules. These
rules may be collectively ambiguous. But other than that, we don't
write anything else. The GLR engine determines the branches by
looking at conflicts in the parsing tables. They are pretty easy to
detect.
--
Ira Baxter, CTO
www.semanticdesigns.com
--- SoupGate-Win32 v1.05
* Origin: you cannot sedate... all the things you hate (1:229/2)
|
