Constructing a realtime deterministic pushdown automaton from a grammar☆

https://doi.org/10.1016/0304-3975(83)90138-XGet rights and content
Under an Elsevier user license
open archive

Abstract

A new direct construction from a grammar to a realtime deterministic pushdown automation is presented. The grammar is required to be in a special form, but the construction is more natural than previously known constructions. As a result the family of stack uniform strict deterministic languages can be characterized by a grammar family.

Cited by (0)

☆

A preliminary report on this research was presented at the 7th International Symposium on Mathematical Foundations of Computer Science, Zakopane, Poland, September 1978 [10]. Some results have also appeared in the second author's Ph.D. thesis [12].

Copyright © 1983 Published by Elsevier B.V.