It seems that GLR parsing has become popular. It seems to me, naively and ignorantly, that one effect of GLR parsing is to admit progressively more ambiguous languages. Here is my question: are GLR grammars ultimately unambiguous?
I have no problem with languages that require large finite lookahead, and I have no problem with resolving reduce/reduce and shift/reduce conflicts by hand-specified disambiguation (as some GLR grammars are doing). My concern, which comes from my ignorance, is that GLR grammars seem to make unresolvable grammar ambiguities progressively harder to discover at grammar compile time. At the end of the day, what I want to be confident about is that every valid input program has a unique valid parse. Does GLR ensure this? shap _______________________________________________ bitc-dev mailing list [email protected] http://www.coyotos.org/mailman/listinfo/bitc-dev
