1081 search results - page 2 / 217 » Working with the LR Degrees |
69
Voted
WIA
1997
Springer
15 years 3 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...
CASCON
2006
15 years 1 months ago
2006
Parsing context-dependent computer languages requires an ability to maintain and query data structures while parsing for the purpose of influencing the parse. Parsing ambiguous co...
ALGOSENSORS
2009
Springer
15 years 6 months ago
2009
Springer
Sensor networks, with their ad hoc deployments, node mobility, and wireless communication, pose serious challenges for developing provably correct and efficient applications. A po...
121
click to vote
ACL
1990
15 years 25 days ago
1990
We define a set of deterministic bottom-up left to right parsers which analyze a subset of Tree Adjoining Languages. The LR parsing strategy for Context Free Grammars is extended ...
LR
2011
14 years 2 months ago
2011
Abstract We present methods and tools for modeling autonomously controlled production networks and investigation of their stability properties. Production networks are described as...