Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
We present the first dynamic programming (DP) algorithm for shift-reduce constituency parsing, which extends the DP idea of Huang… Expand
  • table 1
  • figure 4
  • figure 5
  • table 2
  • table 3
Is this relevant?
2001
2001
A new approach to parse context-free grammars is presented. It relies on discriminating-reverse, DR(k), parsers, with a Tomita… Expand
Is this relevant?
2001
2001
An anti-theft device for preventing unauthorized removal of liquid from large volume liquid storage tanks. The anti-theft device… Expand
Is this relevant?
1993
1993
In this paper we discuss a phenomenon present in some context-free grammars, called hidden left recursion. We show that ordinary… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1993
Highly Cited
1993
  • Klaas Sikkel
  • Texts in Theoretical Computer Science An EATCS…
  • 1993
  • Corpus ID: 4963573
level of parsing schemata. As an extensive example, we have presented various variants of Earley's algorithm, de Vreught and… Expand
  • figure 2.1
  • figure 2.2
  • figure 2.3
  • figure 2.4
  • figure 2.5
Is this relevant?
1991
1991
A purely functional implementation of LR-parsers is given, together with a simple correctness proof. It is presented as a… Expand
Is this relevant?
1990
1990
Abstract A shift-reduce parser for probabilistic context-free grammars is described, based on the LR algorithm. Each of the… Expand
Is this relevant?
1988
1988
A general device for handling nondeterminism in stack operations is described. The device, called a Graph-structured Stack, can… Expand
  • figure 3-1
Is this relevant?
Highly Cited
1987
Highly Cited
1987
An efficient parsing algorithm for augmented context-free grammars is introduced, and its application to on-line natural language… Expand
  • figure 2.1
  • figure 2.2
  • figure 2.3
  • figure 2.4
  • figure 3.2
Is this relevant?
Highly Cited
1985
Highly Cited
1985
This thesis introduces an efficient context-free parsing algorithm and emphasizes its practical value in natural language… Expand
  • figure 3
  • figure 5
  • figure 13
Is this relevant?