Skip to search formSkip to main contentSkip to account menu

Graph-structured stack

Known as: GSS 
In computer science, a graph-structured stack is a directed acyclic graph where each directed path represents a stack.The graph-structured stack is… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2006
2006
LR parsing strategies can analyze LR grammars, which are deterministic. If we consider LR parsing tables in which each entry can… 
2003
2003
In this paper, we propose a new probabilistic GLR parsing method that can solve the problems of conventional methods. Our… 
2001
2001
We introduce "DR automata, which determine next shift-reduce parsing actions from (typically very short) stack-su(cid:14)x… 
2000
2000
We present a Generalized LR parsing algorithm for extensions of context-free grammars. It diiers from previous approaches in the… 
1997
1997
We show how LR parsers for the analysis of arbitrary context-free grammars can be derived from classical Earley's parsing…