The equivalence of reducing transition languages and deterministic languages

Authors:
Mario Schkolnick
Affiliations:
Carnegie-Mellon Univ., Pittsburgh, PA
Venue:
Communications of the ACM
Year:
1974

Citing 7
Cited 0

Weak and Mixed Strategy Precedence Parsing

Journal of the ACM (JACM)
EULER: a generalization of ALGOL and it formal definition: Part 1

Communications of the ACM
A syntax controlled generator of formal language processors

Communications of the ACM
The Theory of Parsing, Translation, and Compiling

The Theory of Parsing, Translation, and Compiling
A result on the relationship between simple precedence languages and reducing transition languages

STOC '70 Proceedings of the second annual ACM symposium on Theory of computing
Some properties of precedence languages

STOC '69 Proceedings of the first annual ACM symposium on Theory of computing
The Mathematical Theory of Context-Free Languages

The Mathematical Theory of Context-Free Languages

Quantified Score

Hi-index	48.22

Visualization

Abstract

The class of reducing transition languages introduced by Eickel, Paul, Bauer, and Samelson was shown by Morris to be a proper superclass of the simple precedence languages. In this paper this result is extended, showing that, in fact, the first class is equivalent to the class of deterministic context free languages.