Results 51 to 60 of about 636 (187)
A General LR(k) Parser Building Algorithm
, 1973 The problem is to find an efficient algorithm that, given the productions of a context-free grammar G, will discover whether G is LR(k) for given k and if it is build an efficient parser for G . The algorithm is given in Section 8.
Sager, Thomas Joshua
core
Object-oriented LR(1) parser generation
, 2006 The LR parser has been around for a long time, and its workings, especially with respect to table compaction and use of the lookahead sets, have puzzled students who are new to the area of study.
Luckett, Christopher
core
, 1995 Partial evaluation can turn a generalparser into a parser generator. The generated parsers surpass those produced by traditional parser generators in speed and compactness.
Michael Sperber, Peter Thiemann
core +1 more source
, 2004 Common LR parser generators lack abstraction facilities for defining recurring patterns of productions. Although there are generators capable of supporting regular expressions on the right hand side of productions, no generator supports user defined ...
Neubauer, Matthias, Thiemann, Peter
core +1 more source
Optimizing directly executable LR parsers [PDF]
, 1991 Traditionally, LR parsers are implemented as table interpreters. A parser generator creates tables whose entries are interpreted by the parser driver. Recent research shows that much faster LR parsers can be obtained by converting the table entries into directly executed code.
openaire +1 more source
Combining dependency parsing with PP attachment
, 2007 Prepositional phrase (PP) attachment is one of the major sources for errors in traditional statistical parsers. The reason for that lies in the type of information necessary for resolving structural ambiguities.
Klett, Eva +2 more
core
Generalised LR Parsing Algorithms [PDF]
, 2006 This thesis concerns the parsing of context-free grammars. A parser is a tool, defined for a specific grammar, that constructs a syntactic representation of an input string and determines if the string is grammatically correct or not.
Economopoulos, Giorgos Robert +1 more
core
The Generalized LR Parser/Compiler V8-4: A Software Package for Practical NL Projects
, 1990 This paperldescribes a software package designed for practical projects which involve natural language parsing.]he Generalized LR Parser/Compiler V8-4 is based on Tomita's Generalized LR Parsing ...
Masaru Tomita
core
A Parser Generator Based on Earley\u27s Algorithm
, 1991 Most parser generators are programs that take a context-free grammar specification for a language and generate a parser for that language. Usually, the parsers generated by these parser generators are based on some variations of LL(k) or LR(k) parsing ...
Hakim, Jawaid
core +1 more source
, 1982 학위논문(석사) - 한국과학기술원 : 전산학과, 1982.2, [ [iii], 44, [10] p. ]In this thesis, an error repairing scheme for LR(1)-based parsers, whose repair action is based on insertion, is studied. This error repairing scheme consists of two parts.
Lee, Myung-Joon, 이명준
core