Jump to content

Graph-structured stack

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Charles Matthews (talk | contribs) at 17:55, 22 May 2004 (change link). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
File:Graphstructuredstack jaredwf.png

In computer science, a graph-structured stack is a directed acyclic graph where each directed path is a stack. They are used in parsing to efficiently simulate nondeterminism for ambiguous grammars.

In the diagram, there are four stacks: {7,3,1,0}, {7,4,1,0}, {7,5,2,0}, and {8,6,2,0}.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Graph-structured_stack&oldid=3690569"