Matches in DBpedia 2014 for { <http://dbpedia.org/resource/GLR_parser> ?p ?o. }
Showing items 1 to 32 of
32
with 100 items per page.
- GLR_parser 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.".
- GLR_parser wikiPageID "3372191".
- GLR_parser wikiPageRevisionID "600426934".
- GLR_parser hasPhotoCollection GLR_parser.
- GLR_parser subject Category:Parsing_algorithms.
- GLR_parser type Abstraction100002137.
- GLR_parser type Act100030358.
- GLR_parser type Activity100407535.
- GLR_parser type Algorithm105847438.
- GLR_parser type Event100029378.
- GLR_parser type ParsingAlgorithms.
- GLR_parser type Procedure101023820.
- GLR_parser type PsychologicalFeature100023100.
- GLR_parser type Rule105846932.
- GLR_parser type YagoPermanentlyLocatedEntity.
- GLR_parser 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).".
- GLR_parser label "Analisador sintático GLR".
- GLR_parser label "GLR parser".
- GLR_parser label "GLR-парсер".
- GLR_parser label "GLR法".
- GLR_parser label "Parser GLR".
- GLR_parser label "Tomita-Parser".
- GLR_parser sameAs Tomita-Parser.
- GLR_parser sameAs GLR法.
- GLR_parser sameAs Parser_GLR.
- GLR_parser sameAs Analisador_sintático_GLR.
- GLR_parser sameAs m.0985nv.
- GLR_parser sameAs Q1760114.
- GLR_parser sameAs Q1760114.
- GLR_parser sameAs GLR_parser.
- GLR_parser wasDerivedFrom GLR_parser?oldid=600426934.
- GLR_parser isPrimaryTopicOf GLR_parser.