This is a preview of subscription content, log in via an institution to check access.
Literature Cited
J. Feldman and D. Gries, “Translator writing systems,” Comm. ACM, 11, No. 12, 77–113 (1968).
S. Ginsberg, The Mathematical Theory of Context-Free Languages, McGraw-Hill, New York (1966).
I. V. Vel'bitskii and E. L. Yushchenko, “Metalanguage oriented toward syntactic analysis and inspection,” Kibernetika, No. 2 (1970).
I. V. Vel'bitskii, “Metalanguage of R-grammars,” Kibernetika, No. 3 (1973).
V. V. Grushetskii, “Syntactic structures,” in: Systems and Theoretical Programming [in Russian], Novosibirsk (1972).
V. I. Konstantinov and R. M. Nuriev, “Metalanguage for translating context-free languages,” in: Computing Systems [in Russian], No. 57, Novosibirsk (1973).
M. E. Conway, “Design of a separable transition-diagram compiler,” Comm. ACM, 6, No. 7 (1963).
D. B. Lomet, “Formalization of the transition-diagram system,” J. ACM, 20, No. 2 (1973).
S. A. Greibach, “A new normal-form theorem for context-free phrase structure grammars,” J. ACM, 12 (1965).
A. L. Fuksman, “On certain grammars for the description of context-free languages,” in: Proceedings of the First All-Union Conference on Programming [in Russian], Kiev (1968).
V. I. Konstantinov, “Translator for homogeneous computer systems,” in: Computing Systems [in Russian], No. 51, Novosibirsk (1972).
V. I. Konstantinov, “Classes of TR-grammars,” in: Computing Systems [in Russian], No. 57, Novosibirsk (1973).
Additional information
Translated from Kibernetika, No. 6, pp. 84–89, November–December, 1974.
Rights and permissions
About this article
Cite this article
Konstantinov, V.I. Metalanguage of TR-grammars. Cybern Syst Anal 10, 1009–1014 (1974). https://doi.org/10.1007/BF01069445
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01069445