On the formulation of normal pushdown acceptors

• Authors: Y. R. Wang
• Venue: ACM '68 Proceedings of the 1968 23rd ACM national conference
• Year: 1968

In the course of studying context-free languages, work has been done toward the construction of push-down acceptors.1 The motivation of constructing a pushdown acceptor for a specified context-free language is twofold; to decide whether a given string belongs to this language and to facilitate the syntactic analysis of this language. A pushdown store acceptor is, in a general sense, a finite automaton with exactly one pushdown store of potentially infinite depth. There can be many ways to formalize pushdown acceptors.2 The main concern is then to find an efficient pushdown acceptor model. A pushdown acceptor model is considered to be efficient in the following two aspects; it should be simple and clear in its structure and operation, it should be an effective tool for syntactic analysis of its corresponding context-free language.