Abstract
A necessary and sufficient set of conditions is obtained that relates any two context-free grammarsG 1 andG 2 with the property that wheneverG 2 left—or right—coversG 1, the syntax-directed translations (SDT’s) with underlying grammarG 1 is a subset of those with underlying grammarG 2. Also the case thatG 2 left—or right—coversG 1 but the SDT’s with underlying grammarG 1 is not a subset of the SDT’s with underlying grammarG 2 is considered; in this case an algorithm is described to obtain the syntax-directed translation schema (SDTS) with underlying grammarG 2 to the given SDTS with underlying grammarG 1, if it exists.
Similar content being viewed by others
References
Aho A V and Ullman J D (1972) Theory ofParsing, Translation and Compiling, Vol I: Parsing, Prentice-Hall, Englewood Cliffs, N.J.
Chartres B A and Florentin J J (1968)J. ACM 15 pp 447–464
Ginsburg S and Harrison M A (1967)J. Computer and System Sciences pp 1–23
Gray J N and Harrison M A (1972)J. ACM 19 pp 675–698
Lewis II P M and Stearns R E (1968)J. ACM 15 pp 465–588
Wirth N and Weber H (1966)Comm. ACM 11 pp 13–23
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Shyamasundar, R.K. On the covering of syntax-directed translations for context-free grammars. Proc. Indian Acad. Sci. (Math. Sci.) 88, 1–19 (1979). https://doi.org/10.1007/BF02898330
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02898330