Sciweavers

334 search results - page 2 / 67
» A New Parallel Algorithm for Generalized LR Parsing
Sort
View
WIA
1997
Springer
13 years 8 months ago
Construction of Efficient Generalized LR Parsers
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...
Miguel A. Alonso, David Cabrero, Manuel Vilares Fe...
EMNLP
2007
13 years 6 months ago
Dependency Parsing and Domain Adaptation with LR Models and Parser Ensembles
We present a data-driven variant of the LR algorithm for dependency parsing, and extend it with a best-first search for probabilistic generalized LR dependency parsing. Parser act...
Kenji Sagae, Jun-ichi Tsujii
PEPM
1995
ACM
13 years 8 months ago
The Essence of LR Parsing
Partial evaluation can turn a general parser into a parser generator. The generated parsers surpass those produced by traditional parser generators in speed and compactness. We us...
Michael Sperber, Peter Thiemann
CC
2004
Springer
160views System Software» more  CC 2004»
13 years 10 months ago
Elkhound: A Fast, Practical GLR Parser Generator
The Generalized LR (GLR) parsing algorithm is attractive for use in parsing programming languages because it is asymptotically efficient for typical grammars, and can parse with an...
Scott McPeak, George C. Necula
ENTCS
2006
114views more  ENTCS 2006»
13 years 4 months ago
Towards Efficient, Typed LR Parsers
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...
François Pottier, Yann Régis-Gianas