Talk:GLR parser

From Wikipedia, the free encyclopedia

GLR is pretty hard to sum-up. In the end, the "scanner" form should be described first, then the parse-forest can be described.

Presumably a little disambiguation is needed - GLR appears to be used both to refer to "infinite lookahead LR" (as in the grammar classification) but also to a specific algorithm for parsing such grammars. Perhaps the main GLR article can consider the grammar classification, and a subsection could consider algorithms?

no, infinite (actually unbounded) lookahead would be something different... GLR is an algorithm, not a grammar classification. "Context Free" is the grammar classification that corresponds to the GLR algorithm. Megacz 16:13, 14 August 2007 (UTC)