8 search results - page 1 / 2 » Construction of Efficient Generalized LR Parsers |
WIA
1997
Springer
13 years 9 months ago
1997
Springer
We show how LR parsers for the analysis of arbitrary context-free grammars can be derived from classical Earley's parsing algorithm. The result is a Generalized LR parsing al...
ENTCS
2006
13 years 5 months ago
2006
The LR parser generators that are bundled with many functional programming language implementations produce code that is untyped, needlessly inefficient, or both. We show that, us...
CC
2002
Springer
13 years 5 months ago
2002
Springer
In this paper we present the fusion of generalized LR parsing and scannerless parsing. This combination supports syntax definitions in which all aspects (lexical and context-free) ...
PEPM
1993
ACM
13 years 9 months ago
1993
ACM
Applications of partial evaluation have so far mainly focused on generation of compilers from interpreters for programming languages. We partially evaluate a simple general LR(k) ...
ACL
2010
13 years 3 months ago
2010
Constructing an encoding of a concept lattice using short bit vectors allows for efficient computation of join operations on the lattice. Join is the central operation any unifica...