Some restrictions on W-grammars

Authors:
Sheila A. Greibach
Affiliations:
-
Venue:
STOC '74 Proceedings of the sixth annual ACM symposium on Theory of computing
Year:
1974

Citing 11
Cited 0

Two Families of Languages Related to ALGOL

Journal of the ACM (JACM)
One-way stack automata

Journal of the ACM (JACM)
Indexed Grammars—An Extension of Context-Free Grammars

Journal of the ACM (JACM)
Nested Stack Automata

Journal of the ACM (JACM)
The Vienna Definition Language

ACM Computing Surveys (CSUR)
Revised report on the algorithm language ALGOL 60

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

The Theory of Parsing, Translation, and Compiling
W-grammar

ACM '69 Proceedings of the 1969 24th national conference
Some formal properties of the syntax of algol 68

Some formal properties of the syntax of algol 68
Formal languages and their relation to automata

Formal languages and their relation to automata
Report on the algorithmic language ALGOL 68

Report on the algorithmic language ALGOL 68

Quantified Score

Hi-index	0.00

Visualization

Abstract

The effect of some restrictions on W-grammars (the formalization of the syntax of ALGOL 68) are explored. Two incomparable families examined at length are WRB (languages generated by normal regular-based W-grammars) and WS (languages generated by simple W-grammars). Both properly contain the context-free languages and are properly contained in the family of quasirealtime languages. In addition, WRB is closed under nested iterated substitution (but is not an AFL) and is properly contained in the family of indexed languages.