Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 227,350,550 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.
2013
2013
GLR-based abstract parsing
S. Grigorev
,
I. Kirilenko
2013
Corpus ID: 12473328
Abstract parsing is an important step of the processing of dynamically constructed statements or string-embedded languages (such…
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
LR Parsing for Global Index Languages (GILs)
J. Castaño
International Conference on Implementation and…
2003
Corpus ID: 27989305
We present here Global Index Grammars (GIGs) and the characterizing 2 Stack automaton model (LR-2PDA). We present the techniques…
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
Practical Nondeterministic DR(k) Parsing on Graph-Structured Stack
José Fortes Gálvez
,
J. Farré
,
Miguel Ángel Pérez Aguiar
Conference on Intelligent Text Processing and…
2001
Corpus ID: 10887310
A new approach to parse context-free grammars is presented. It relies on discriminating-reverse, DR(k), parsers, with a Tomita…
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
2001
2001
GLR Parser with Conditional Action Model(CAM)
Y. Kwak
,
Young-Sook Hwang
,
Hoo-Jung Chung
,
So-young Park
,
Sang-Zoo Lee
,
Hae-Chang Rim
Natural Language Processing Pacific Rim Symposium
2001
Corpus ID: 19034900
There are two different approaches in the LR parsing. The first one is the deterministic approach that performs the only one…
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
1988
1988
Combining lexicon-driven parsing and phrase-structure-based parsing
Musuru Tomlta
International Conference on Computational…
1988
Corpus ID: 62219895
Lexicon-driven formalisms (e.g. Categorial Grammar; HPSG and GB Grammar), which do not have explicit phrase structure rules, are…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE