A GLR parser, or generalized left-to-right rightmost derivation parser, is an extension of the LR parser algorithm that can handle non-deterministic and ambiguous grammars. Its theoretical foundation was given in a 1974 paper by Bernard Lang, and the first actual implementation was described in a 1984 paper by Masaru Tomita, whose goal was to parse natural language text thoroughly and efficiently, something standard LR and LL parsers cannot accommodate because they cannot handle the nondeterministic and ambiguous nature of natural language.
Facts
Time Complexity
Time Complexity (category) Time Complexity (category) Connections
Credited To
Source GLR parser (Wikipedia)
In Field
Source GLR parser (Wikipedia)
Invented By
Source GLR parser (Wikipedia)
Sources
1. GLR parser (Wikipedia)
Wikipedia article body, read for Browse By backfill (w-bbfill-computing6-0927)
GLR parser (Wikipedia)
Credited To: Masaru Tomita, Lead section
described in a 1984 paper by Masaru Tomita
Invented By: Masaru Tomita, Lead section
described in a 1984 paper by Masaru Tomita
In Field: Algorithms and Complexity Theory, Lead sentence
GLR parser (generalized left-to-right rightmost derivation parser) is an extension of an LR parser algorithm to handle non-deterministic and ambiguous grammars.
In Group: Parsing Algorithms, Lead section
is an extension of an LR parser algorithm
View the SourceReader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.