This article has multiple issues. Please help improve it or discuss these issues on the talk page. (Learn how and when to remove these template messages)
This article includes a list of general references, but it lacks sufficient corresponding inline citations. Please help to improve this article by introducing more precise citations.(May 2011) (Learn how and when to remove this message)
The article's lead section may need to be rewritten. Please help improve the lead and read the lead layout guide.(February 2015) (Learn how and when to remove this message)
(Learn how and when to remove this message)
A GLR parser (generalized left-to-right rightmost derivation parser) is an extension of an LR parser algorithm to handle non-deterministic and ambiguous grammars.[1] The theoretical foundation was provided in a 1974 paper[2] by Bernard Lang (along with other general context-free parsers such as GLL). It describes a systematic way to produce such algorithms, and provides uniform results regarding correctness proofs, complexity with respect to grammar classes, and optimization techniques. The first actual implementation of GLR was described in a 1984 paper by Masaru Tomita, it has also been referred to as a "parallel parser". Tomita presented five stages in his original work,[3] though in practice it is the second stage that is recognized as the GLR parser.
Though the algorithm has evolved since its original forms, the principles have remained intact. As shown by an earlier publication,[4] Lang was primarily interested in more easily used and more flexible parsers for extensible programming languages. Tomita's goal was to parse natural language text thoroughly and efficiently. Standard LR parsers cannot accommodate the nondeterministic and ambiguous nature of natural language, and the GLR algorithm can.
^Masaru Tomita (6 December 2012). Generalized LR Parsing. Springer Science & Business Media. ISBN 978-1-4615-4034-2.
^Cite error: The named reference Lang74 was invoked but never defined (see the help page).
^Cite error: The named reference Tomita was invoked but never defined (see the help page).
^Cite error: The named reference Lang71 was invoked but never defined (see the help page).
A GLRparser (generalized left-to-right rightmost derivation parser) is an extension of an LR parser algorithm to handle non-deterministic and ambiguous...
sub-label of the Japanese clothing brand United Arrows GLRA2, a protein GLRparser Glycine receptor Greater London Radio, now BBC Radio London Grupo Latino...
types of parser generators, such as Simple LR parser, LR parser, GLRparser, LL parser and GLL parser generators. What differentiates one from another...
some inputs, the depth of the parse tree can be proportional to the input size, so both an LR parser and a packrat parser will appear to have the same...
parsers: SLR parsers, LALR parsers, canonical LR(1) parsers, minimal LR(1) parsers, and generalized LR parsers (GLRparsers). LR parsers can be generated...
processing into a lexer followed by a parser is more modular; scannerless parsing is primarily used when a clear lexer–parser distinction is unneeded or unwanted...
to a constant-size grammar. GLRparser Earley parser Packrat parser Inside–outside algorithm Grune, Dick (2008). Parsing techniques : a practical guide...
and Nicaud (2011). GLRparser, a type of parser for ambiguous and nondeterministic grammars Chart parser, another type of parser for ambiguous grammars...
operate using the SGLR (Scannerless GLRparser). An SDF parser outputs parse trees or, in the case of ambiguities, parse forests. Features of SDF: Supports...
The Scannerless Boolean Parser is an open-source scannerless GLRparser generator for boolean grammars. It was implemented in the Java programming language...
for parsing context-free grammars in Chomsky normal form Earley parser: another O(n3) algorithm for parsing any context-free grammar GLRparser: an algorithm...
generating parsers, type checkers, compilers, interpreters, as well as IDE plugins for Eclipse and IntelliJ. It uses SDF and a scannerless GLRparser for syntax...
as the founder of the E-Cell simulation system and/or the inventor of GLRparser algorithm. He served a professor of Keio University, Director of the Institute...
programmer as the original text modulo any applied transformations. DMS uses GLRparsing technology with semantic predicates. This enables it to handle all context-free...
machine-readable and it can be easily rendered in navigation devices by parsing the XML structure. It is further backwards compatible in a way that new...
Global Information
