Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 234,994,511 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
7 relations
Ambiguous grammar
Computer science
Directed acyclic graph
GLR parser
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Linear-time Constituency Parsing with RNNs and Dynamic Programming
Juneki Hong
,
Liang Huang
Annual Meeting of the Association for…
2018
Corpus ID: 29159988
Recently, span-based constituency parsing has achieved competitive accuracies with extremely simple models by using bidirectional…
Expand
2011
2011
Frontier Pruning for Shift-Reduce CCG Parsing
Stephen Merity
,
J. Curran
Australasian Language Technology Association…
2011
Corpus ID: 7669884
We apply the graph-structured stack ( GSS ) to shift-reduce parsing in a Combinatory Cate-gorial Grammar ( CCG ) parser. This…
Expand
2006
2006
A New Approach to the Construction of Generalized LR Parsing Algorithms
Miguel A. Alonso
,
D. Cabrero
,
M. Vilares
2006
Corpus ID: 8933933
LR parsing strategies can analyze LR grammars, which are deterministic. If we consider LR parsing tables in which each entry can…
Expand
2003
2003
GLR Parser with Conditional Action Model using Surface Phrasal Types for Korean
Y. Kwak
,
So-young Park
,
Hae-Chang Rim
International Workshop/Conference on Parsing…
2003
Corpus ID: 14701636
In this paper, we propose a new probabilistic GLR parsing method that can solve the problems of conventional methods. Our…
Expand
2001
2001
Generalized \varepsilon-Skip Discriminating-Reverse Parsing on Graph-Structured Stack
José Fortes Gálvez
,
J. Farré
2001
Corpus ID: 46611064
We introduce "DR automata, which determine next shift-reduce parsing actions from (typically very short) stack-su(cid:14)x…
Expand
2000
2000
Generalized LR parsing for extensions of context-free grammars
Miguel A. Alonso
,
D. Cabrero
,
M. Vilares
2000
Corpus ID: 18586763
We present a Generalized LR parsing algorithm for extensions of context-free grammars. It diiers from previous approaches in the…
Expand
1997
1997
Construction of E cient Generalized LR Parsers
Miguel A. Alonso
,
D. Cabrero
,
Manuel
,
VilaresDepartamento
,
de Computaci
1997
Corpus ID: 839823
We show how LR parsers for the analysis of arbitrary context-free grammars can be derived from classical Earley's parsing…
Expand
Review
1992
Review
1992
Book Reviews: Generalized LR Parsing
Giorgio Satta
International Conference on Computational Logic
1992
Corpus ID: 14450188
Tomita's algorithm, also called the Generalized LR (GLR) parser, is a method for natural language parsing that extends standard…
Expand