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.
2013
2013
Abstract parsing is an important step of the processing of dynamically constructed statements or string-embedded languages (such… 
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
We present here Global Index Grammars (GIGs) and the characterizing 2 Stack automaton model (LR-2PDA). We present the techniques… 
2003
2003
In this paper, we propose a new probabilistic GLR parsing method that can solve the problems of conventional methods. Our… 
2001
2001
A new approach to parse context-free grammars is presented. It relies on discriminating-reverse, DR(k), parsers, with a Tomita… 
2001
2001
We introduce "DR automata, which determine next shift-reduce parsing actions from (typically very short) stack-su(cid:14)x… 
2001
2001
There are two different approaches in the LR parsing. The first one is the deterministic approach that performs the only one… 
1997
1997
We show how LR parsers for the analysis of arbitrary context-free grammars can be derived from classical Earley's parsing… 
Review
1992
Review
1992
Tomita's algorithm, also called the Generalized LR (GLR) parser, is a method for natural language parsing that extends standard… 
1988
1988
Lexicon-driven formalisms (e.g. Categorial Grammar; HPSG and GB Grammar), which do not have explicit phrase structure rules, are…