Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q1760114> ?p ?o }
Showing triples 1 to 21 of
21
with 100 triples per page.
- Q1760114 subject Q8217390.
- Q1760114 abstract "A GLR parser (GLR standing for "generalized LR", where L stands for "left-to-right" and R stands for "rightmost (derivation)") is an extension of an LR parser algorithm to handle nondeterministic and ambiguous grammars. The theoretical foundation was provided in a 1974 paper 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, 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, 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.".
- Q1760114 wikiPageWikiLink Q1071969.
- Q1760114 wikiPageWikiLink Q1076785.
- Q1760114 wikiPageWikiLink Q1195339.
- Q1760114 wikiPageWikiLink Q1204392.
- Q1760114 wikiPageWikiLink Q1277497.
- Q1760114 wikiPageWikiLink Q141495.
- Q1760114 wikiPageWikiLink Q1756442.
- Q1760114 wikiPageWikiLink Q1917459.
- Q1760114 wikiPageWikiLink Q2303083.
- Q1760114 wikiPageWikiLink Q325904.
- Q1760114 wikiPageWikiLink Q33742.
- Q1760114 wikiPageWikiLink Q4346847.
- Q1760114 wikiPageWikiLink Q4654216.
- Q1760114 wikiPageWikiLink Q5155950.
- Q1760114 wikiPageWikiLink Q5205644.
- Q1760114 wikiPageWikiLink Q8217390.
- Q1760114 wikiPageWikiLink Q954821.
- Q1760114 comment "A GLR parser (GLR standing for "generalized LR", where L stands for "left-to-right" and R stands for "rightmost (derivation)") is an extension of an LR parser algorithm to handle nondeterministic and ambiguous grammars. The theoretical foundation was provided in a 1974 paper by Bernard Lang (along with other general Context-Free parsers such as GLL).".
- Q1760114 label "GLR parser".