Abstract
Two-level grammars as introduced by the author in [2] have been used to define most of the syntax of ALGOL 68 [3]. Although SINTZOFF showed in [1] that every recursively enumerable set is generated by some such grammar, its use to the description of the full syntax of ALGOL 68 had to wait until recently [4]. The even more ambitious project of using such a grammar to give an integrated definition of both syntax and semantics of ALGOL 68 has been undertaken by the author but is still far from completion. Experience in these and other applications, e.g., to prove program correctness [5], have shown that although these grammars have the same generative power as Turing machines, they are much more manageable. An obvious question is the reason of this manageability. Certainly, a judicious choice of metanotions is of considerable value and in the big tasks, like the description of full-scale languages, a large number of metanotions are used. On the other hand, one might ask whether the ability to generate every recursively enumerable set requires so many metanotions.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Literature
M. SINTZOFF, Existence of a Van Wijngaarden syntax for every recursively enumerable set, Extr. Ann. Soc. Sci. Bruxelles, T 81, II, pp 115–118, 1967.
A. VAN WIJNGAARDEN, Orthogonal design and description of a formal language, MR 76, Math. Centrum, Amsterdam, 1965.
A. VAN WIJNGAARDEN (editor), Report on the Algorithmic Language ALGOL 68, Num. Math., Vol. 14, pp 79–218, 1969.
A. VAN WIJNGAARDEN at tail-9,Revised Report on the Algorithmic Language ALGOL 68, Acta Informatica, to appear.
A. VAN WIJNGAARDEN, Program correctness and grammars, [in Dutch], Syllabus Coll. Progr. Correctness, 13, pp 1–10, Math. Centrum, Amsterdam, 1974.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1974 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Van Wijngaarden, A. (1974). The Generative Power of Two-Level Grammars. In: Loeckx, J. (eds) Automata, Languages and Programming. ICALP 1974. Lecture Notes in Computer Science, vol 14. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-21545-6_1
Download citation
DOI: https://doi.org/10.1007/978-3-662-21545-6_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-06841-9
Online ISBN: 978-3-662-21545-6
eBook Packages: Springer Book Archive