Abstract
A mathematical apparatus for describing the context-free grammars of artificial languages is presented: the syntax of the language to describe them is defined, as well as logical and generative semantics, and examples are provided to show how the suggested apparatus can be used.
Similar content being viewed by others
References
Marcotty, M., Ledgard, H. F., Bochmann, G. V., A Sampler of Formal Definitions. Computing Surveys, vol. 8(2), 1976, pp. 191–276.
Aho, A. and Ullman, J., Theory of Parsing, Translation, and Compiling, New York: Prentice-Hall, 1972.
Mel’chuk, I.A., Opyt teorii lingvisticheskikh modelei “Smysl Tekst”: Semantika. Sintaksis (Experience of Theory of Linguistic Models “Sense ↔ Text”: Semantics. Syntax), Moscow: Nauka, 1974.
Nikiforova, N.Yu. and Chernyakhovskaya, M.Yu., Bases of observations in computer bank of medicine knowledge, Materialy sed’moi mezhdunarodnoi nauchno-tekhnicheskoi konferentsii “Iskusstvennyi intellekt. Intellektual’nye i mnogoprotsessornye sistemy”, (Proc. 7th Int. Sci.-Techn. Conf. “Artificial Intellect. Intellectual Multiprocession Systems”), Katsiveli, 2006; Taganrog: TRTU, 2006, vol. 1, pp. 76–80.
Author information
Authors and Affiliations
Corresponding author
Additional information
Original Russian Text © V.V. Gribova, A.S. Kleschev, D.A. Krylov, 2013, published in Nauchno-Tekhnicheskaya Informatsiya, Seriya 2, 2013, No. 4, pp. 9–17.
About this article
Cite this article
Gribova, V.V., Kleschev, A.S. & Krylov, D.A. The context-free grammars of artificial languages. Autom. Doc. Math. Linguist. 47, 59–67 (2013). https://doi.org/10.3103/S0005105513020052
Received:
Published:
Issue Date:
DOI: https://doi.org/10.3103/S0005105513020052