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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1985-2015
012319852015

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Generalized LL (GLL) parsing is an extension of recursivedescent (RD) parsing that supports all context-free grammars in cubic… (More)
  • figure 1
  • figure 2
  • table 1
  • figure 3
Is this relevant?
2013
2013
Abstract parsing is an important step of the processing of dynamically constructed statements or string-embedded languages (such… (More)
  • figure 1
  • figure 4
  • figure 6
  • figure 7
  • table 1
Is this relevant?
2011
2011
We apply the graph-structured stack (GSS) to shift-reduce parsing in a Combinatory Categorial Grammar (CCG) parser. This allows… (More)
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • table 2
Is this relevant?
1997
1997
We show how LR parsers for the analysis of arbitrary contextfree grammars can be derived from classical Earley’s parsing… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1993
1993
  • Klaas Sikkel
  • Texts in Theoretical Computer Science An EATCS…
  • 1993
level of parsing schemata. As an extensive example, we have presented various variants of Earley's algorithm, de Vreught and… (More)
  • figure 2.1
  • figure 2.2
  • figure 2.3
  • figure 2.4
  • figure 2.5
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… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 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… (More)
Is this relevant?
1988
1988
A general device for handling nondeterminism in stack operations is described. The device, called a Graph-structured Stack, can… (More)
  • 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… (More)
  • 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 paper introduces an efficient context-free parsing algorithm and emphasizes its practical value in natural language… (More)
  • figure 3
  • figure 5
  • figure 13
Is this relevant?