Abstract
One of the methods used for defining translations is the socalled syntax-directed translation scheme which can be interpreted as a pair of rather similar grammars with the productions working in parallel. Because of the similarity of the grammars each of the two grammars "fits" the other in the sense that for each derivation process in one grammar leading to a terminal word the corresponding derivation process in the other grammar also leads to a terminal word. For many practical applications it suffices to consider the case that one of the grammars fits the other, but not necessarily conversely. Investigating this idea, translations are obtained which are more powerful than the syntax-directed. It is shown that one can determine whether a given grammar fits another given grammar. As a by-product, it is established that the containment problem for Szilard languages is decidable.
Chapter PDF
Similar content being viewed by others
References
AHO,A.V. and ULLMAN,J.D. (1972) The theory of parsing, translation and compiling, Vol. I: Parsing, Prentice-Hall, Series in automatic computation, Englewood Cliffs, N.J. (1972).
AHO, A.V. and ULLMAN, J.D. (1969), Syntax-directed translations and the pushdown assembler, Journal of Computer and System Sciences 3 (1969), 37–56.
AHO, A.V. and ULLMAN, J.D. (1969), Properties of syntax-directed translations, Journal of Computer and System Sciences 3 (1969), 319–334.
KANDZIA,P. und LANGMAACK,H. (1973), Informatik: Programmierung, Teubner Studienbücher Informatik, Bd. 18, Stuttgart (1973)
KRIEGEL,H.P. and MAURER,H.A. (1974), Formal translations and the containment problem for Szilard languages, Report No. 23 of the Institut für Angewandte Informatik und Formale Beschreibungsverfahren, Universität Karlsruhe
LEWIS, P.M. and STEARNS, R.E. (1968), Syntax-directed translations, Journal of the ACM 15 (1968), 271–281.
MAURER,H.A. und SIX,H.W. (1974), Datenstrukturen und Programmierverfahren, Teubner Studienbücher Informatik, Bd. 25, Stuttgart (1974)
PENTTONEN, M. (1974), On Derivation Languages Corresponding to Context-Free Grammars, Acta Informatica 3 (1974), 285–291.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1975 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kriegel, H.P., Maurer, H.A. (1975). Formal translations and the containment problem for Szilard languages. In: Brakhage, H. (eds) Automata Theory and Formal Languages. Lecture Notes in Computer Science, vol 33. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-07407-4_25
Download citation
DOI: https://doi.org/10.1007/3-540-07407-4_25
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-07407-6
Online ISBN: 978-3-540-37923-2
eBook Packages: Springer Book Archive