... buffer in a
conswained way are not equivalent to pushdown automata.
Shipman and Marcus [7] consider a model of Marcus& apos; parser in
which the active node s~ack and buffer are combined w give ...
current cyclic node:
What parts of the partial parse tree are accessible in Marcus& apos;
parser seems to be a moot point Marcus [4] states
"the parser can modify or directly examine exactly ... by Marcus& apos;
mechanism. We should also point out that our notion of a
context-free language being deterministic differs from the
deterministic behavour of the parser as described by Marcus. ...