Stack automata and compiling-Reference-Cited by-同舟云学术

Stack automata and compiling

Published:1967-01 Issue:1 Volume:14 Page:172-201
ISSN:0004-5411
Container-title:Journal of the ACM
language:en
Short-container-title:J. ACM

Author:

Ginsburg Seymour¹,Greibach Sheila A.²,Harrison Michael A.³

Affiliation:

1. System Development Corporation, Santa Monica, California

2. Harvard University, Cambridge, Massachusetts

3. University of California, Berkeley, California

Abstract

Compilation consists of two parts, recognition and translation. A mathematical model is presented which embodies salient features of many modern compiling techniques. The model, called the stack automaton, has the desirable feature of being deterministic in nature. This deterministic device is generalized to a nondeterministic device (nondeterministic stack automaton) and particular instances of this more general device are noted. Sets accepted by nondeterministic stack automata are recursive. Each set accepted by a deterministic linear bounded automaton is accepted by some nonerasing stack automaton. Each context-sensitive language is accepted by some (deterministic) stack automaton.

Publisher

Association for Computing Machinery (ACM)

Subject

Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software

Link

https://dl.acm.org/doi/pdf/10.1145/321371.321385

Reference19 articles.

1. Regular canonical systems;Uc HI, J.R;Arch. Math. Logik Grundlagenforschung,1964

Cited by 100 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. On the complexity of decision problems for some classes of machines and applications;Information and Computation;2023-10

2. Deterministic Real-Time Tree-Walking-Storage Automata;Electronic Proceedings in Theoretical Computer Science;2023-09-15

3. Visit-Bounded Stack Automata;Theory of Computing Systems;2023-07-23

4. Between SC and LOGDCFL: families of languages accepted by logarithmic-space deterministic auxiliary depth-k storage automata;International Journal of Computer Mathematics: Computer Systems Theory;2023-01-02

5. Tree-Walking-Storage Automata;Developments in Language Theory;2023