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 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 simulate nondeterminism would be to duplicate the stack as needed. The duplication would be less efficient since vertices would not be shared.

PropertyValue
dbpedia-owl:thumbnail
dbpprop:abstract
  • 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 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 simulate nondeterminism would be to duplicate the stack as needed. The duplication would be less efficient since vertices would not be shared. For this example, 16 vertices would be needed instead of 9.
  • In informatica, un grafo-structured stack (stack strutturato a grafo) è un grafo diretto aciclico nel quale ogni cammino è uno stack. Viene usato nel parsing per simulare efficientemente il non determinismo per le grammatiche ambigue. Nel seguente diagramma sono rappresentati quattro stack: {7,3,1,0}, {7,4,1,0}, {7,5,2,0}, e {8,6,2,0}. Un altro modo di simulare il non determinismo sarebbe quello di duplicare lo stack per ogni ramo non deterministico. La duplicazione però è meno efficiente in quanto i vertici non vengono condivisi. Per questo esempio sarebbero necessario 16 vertici invece di 9.
dbpprop:hasPhotoCollection
rdf:type
rdfs:comment
  • 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 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 simulate nondeterminism would be to duplicate the stack as needed. The duplication would be less efficient since vertices would not be shared.
  • In informatica, un grafo-structured stack (stack strutturato a grafo) è un grafo diretto aciclico nel quale ogni cammino è uno stack. Viene usato nel parsing per simulare efficientemente il non determinismo per le grammatiche ambigue. Nel seguente diagramma sono rappresentati quattro stack: {7,3,1,0}, {7,4,1,0}, {7,5,2,0}, e {8,6,2,0}. Un altro modo di simulare il non determinismo sarebbe quello di duplicare lo stack per ogni ramo non deterministico.
rdfs:label
  • Graph-structured stack
  • Graph-structured stack
owl:sameAs
skos:subject
foaf:depiction
foaf:page
is owl:sameAs of