Affiliation:
1. IBM Thomas J. Watson Research Center, P.O. Box 218, Yorktown Heights, New York
Abstract
The transition diagram systems first introduced by Conway are formalized in terms of a restricted deterministic pushdown acceptor (DPDA) called a nested DPDA. It is then established that the class of nested DPDA's is capable of accepting all deterministic context-free languages. The proof of this involves demonstrating that left recursion can be eliminated from deterministic (or LR(
k
)) grammars without destroying the deterministic property. Using various structural properties of nested DPDA's, one can then establish equivalence results for certain classes of deterministic languages.
Publisher
Association for Computing Machinery (ACM)
Subject
Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software
Reference8 articles.
1. Design of a separable transition-diagram compiler
2. A New Normal-Form Theorem for Context-Free Phrase Structure Grammars
3. GRIFFIT~S M. AnMyse determiaiste et Compilateurs. Ph.D. dies. U. of Grenoble (Oct. 1969). GRIFFIT~S M. AnMyse determiaiste et Compilateurs. Ph.D. dies. U. of Grenoble (Oct. 1969).
4. On the translation of languages from left to right
Cited by
26 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献