Formal translations and the containment problem for Szilard languages
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.
- 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).Google Scholar
- KANDZIA,P. und LANGMAACK,H. (1973), Informatik: Programmierung, Teubner Studienbücher Informatik, Bd. 18, Stuttgart (1973)Google Scholar
- 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 KarlsruheGoogle Scholar
- MAURER,H.A. und SIX,H.W. (1974), Datenstrukturen und Programmierverfahren, Teubner Studienbücher Informatik, Bd. 25, Stuttgart (1974)Google Scholar