Sciweavers

28 search results - page 1 / 6
» Faster Generalized LR Parsing
Sort
View
71
Voted
CC
1999
Springer
154views System Software» more  CC 1999»
15 years 2 months ago
Faster Generalized LR Parsing
Tomita devised a method of generalized LR GLR parsing to parse ambiguous grammars e ciently. A GLR parser uses linear-time LR parsing techniques as long as possible, falling back...
John Aycock, R. Nigel Horspool
MTPP
2010
14 years 8 months ago
A Fast General Parser for Automatic Code Generation
Abstract. The code generator in a compiler attempts to match a subject tree against a collection of tree-shaped patterns for generating instructions. Tree-pattern matching may be c...
Wuu Yang
83
Voted
EMNLP
2007
14 years 11 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
WIA
1997
Springer
15 years 1 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...
107
Voted
IJFCS
2006
132views more  IJFCS 2006»
14 years 10 months ago
Generalized Lr Parsing Algorithm for Boolean Grammars
The generalized LR parsing algorithm for context-free grammars is extended for the case of Boolean grammars, which are a generalization of the context-free grammars with logical c...
Alexander Okhotin