57 search results - page 3 / 12 » Generalized Lr Parsing Algorithm for Boolean Grammars |
CC
2004
Springer
13 years 11 months ago
2004
Springer
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...
EMNLP
2007
13 years 7 months ago
2007
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...
SAC
2008
ACM
13 years 5 months ago
2008
ACM
There has been a recent effort in the literature to reconsider grammar-dependent software development from an engineering point of view. As part of that effort, we examine a defic...
COLING
1990
13 years 7 months ago
1990
POPL
2004
ACM
14 years 6 months ago
2004
ACM
For decades we have been using Chomsky's generative system of grammars, particularly context-free grammars (CFGs) and regular expressions (REs), to express the syntax of prog...