Graph-structured stack
id:
graph-structured-stack-253-5171187
title:
Graph-structured stack
text:
In computer science, a graph-structured stack (GSS) is a directed acyclic graph where each directed path represents a stack.
The graph-structured stack is an essential part of Tomita's algorithm, where it replaces the usual stack of a pushdown automaton. This allows the algorithm to encode the nondeterministic choices in parsing an ambiguous grammar, sometimes with greater efficiency. In the following diagram, there are four stacks: {7,3,1,0}, {7,4,1,0}, {7,5,2,0}, and {8,6,2,0}. Another way to
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Graph-structured_stack
date created:
date modified:
2022-03-11T07:46:57Z
main entity:
{"identifier":"Q3775803","url":"https://www.wikidata.org/entity/Q3775803"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/7/77/Graph-structured_stack_-_Borneq.png","width":563,"height":275}
fields total:
13
integrity:
14