Jump to content

Talk:Graph-structured stack

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia

Ambiguous introduction

[edit]

The example seems to imply that a GSS is a DAG where all maximally-long chains are the same length, and each maximally-long chain represents a stack. This is far less general than "a DAG where the any chain represent stack". — Preceding unsigned comment added by 98.169.86.44 (talk) 07:01, 10 April 2012 (UTC)[reply]

root node

[edit]

Root node is needed for distinguish between empty stack ([]) case - pointer to root and "no stack information" - null pointer. "No stack information" is for SLL parsing in Adaptive LL(*) Parsing: The Power of Dynamic Analysis.Borneq (talk) 22:04, 12 March 2017 (UTC)[reply]