Sciweavers

2 search results - page 1 / 1
» On Parsing and Condensing Substrings of LR Languages in Line...
Sort
View
WIA
1998
Springer
13 years 9 months ago
On Parsing and Condensing Substrings of LR Languages in Linear Time
Abstract. LR parsers have long been known as being an efficient algorithm for recognizing deterministic context
Heiko Goeman
LACL
2005
Springer
13 years 11 months ago
Strict Deterministic Aspects of Minimalist Grammars
The Minimalist Grammars (MGs) proposed by Stabler(1997) have tree-shaped derivations (Harkema, 2001b; Michaelis, 2001a). As in categorial grammars, each lexical item is an associat...
John T. Hale, Edward P. Stabler