Abstract
The effect of some restrictions onW-grammars (the fonnalization of the syntax ofalgol 68) are explored. Two incomparable families examined at length areW rb (languages generated by normal regular-basedW-grammars) andW s (languages generated by simpleW-grammars). Both properly contain the context-free languages and are properly contained in the family of quasi-realtime languages. In addition,W rb is closed under nested iterated substitution (but is not anAFL) and is properly contained in the family of index languages.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
A. V. Aho, “Indexed grammars—an extension of contexl-free grammars,”JACM 15:647–671 (1968).
A. V. Aho, “Nested stack automata,”JACM 16:383–406 (1969).
A. V. Aho and J. Ullman,The Theory of Parsing, Translation and Compiling, Volume I:Parsing (Prentice-Hall, 1972).
John Luther Baker, “Some formal properties of the syntax of ALGOL 68,” Doctoral Dissertation, University of Washington (1970).
Y. Bar-Hillel, M. Perles, and E. Shamir, “On formal properties of simple-phrase structure grammars,”Z. Phonetik, Sprachwiss., Kommunikationsforsch. 14:143–172 (1961).
R. V. Book, “Grammars with time functions,” Doctoral Dissertation, Harvard University (1969).
R. V. Book, “Time-bounded grammars and their languages,”JCSS 5:397–429 (1971).
R. V. Book and S. A. Greibach, “Quasi-realtime languages,”Mathematical Systems Theory 4:77–111 (1970).
G. de Chastellier and A. Colmerauer, “ ff-grammar,” inProc. ACM National Conference (1969), pp. 511–518.
J. C. Cleaveland and R. C. Uzgalis, “What every programmer should know about grammar,” Modeling and Measurement Note No. 12, Computer Science Department, University of California, Los Angeles (1973).
M. J. Fischer, “Grammars with macrolike productions,” Doctoral Dissertation, Harvard University (1968).
M. J. Fischer, “Grammars with macrolike productions,” inProc. IEEE Ninth Annual Symposium on Switching and Automata Theory (Schenectady, New York, October 1968), pp. 131–142.
S. Ginsburg, S. A. Greibach, and M. A. Harrison, “One-way stack automata,”JACM 4:389–418 (1967).
S. Ginsburg and H. G. Rice, “Two families of languages related to ALGOL,”JACM 9:350–371 (1962).
J. Hopcroft and J. D. Ullman,Formal Languages and Their Relation to Automata (Addison-Wesley, 1969).
L. Y. Liu and P. Weiner, “An infinite hierarchy of intersections of context-free languages,”Mathematical Systems Theory 7:185–192 (1973).
A. W. Mazurkiewicz, “A note on enumerable grammars,”Information and Control 14:555–558 (1969).
A. R. Meyer, P. C. Fischer, and A. L. Rosenberg, “Turing machines with several read-write heads,”Proc. IEEE Eighth Annual Symposium on Switching and Automata Theory (1967), pp. 148–154.
P. Nauer (ed.), “Revised report on the algorithmic language ALGOL 60,”Cnrnm. ACM 6:1–17 (1963).
A. Nerode, “Linear automaton transformations,”Proc. Amer. Math. Soc. 9:541–544 (1958).
G. Rozenberg and P. Doucet, “OnO-L languages.”lnformation and Control 19:302–318(1971).
M. Sintzou, “Existence of van Wijngaarden's syntax for every recursively enumerable set,”Ann. Soc. Sci. de Bruxelles 2:115–118 (1967).
R. E. Stearns and P. M. Lewis, “Property grammars and table machines,”Information and Control 14:524–549 (1969).
A. van Wijngaarden (ed.), “Report on the algorithmic language ALGOL 68,”Numerische Mathematik 14:79–218 (1969).
Peter Wegner, “The Vienna definition language,”Computing Surveys 4:5–63 (1972).
Author information
Authors and Affiliations
Additional information
The research represented in this paper was supported in part by the National Science Foundation under Grant GJ-803.
Rights and permissions
About this article
Cite this article
Greibach, S.A. Some restrictions onW-grammars. International Journal of Computer and Information Sciences 3, 289–327 (1974). https://doi.org/10.1007/BF00978977
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF00978977