Geodesic
Syntax analysis of programs by the method of integral representations
Prikladnaya Diskretnaya Matematika. Supplement, no. 11 (2018), pp. 128-130.

Voir la notice de l'article provenant de la source Math-Net.Ru

A new method for syntactical analysis of the monomials of a context-free language, as a model of programming languages, based on the integral representation of the syntactical polynomial of a program is proposed in the paper. It is shown that the integral of a fixed multiplicity over a cycle allows finding the syntactical polynomial of monomials (programs) with unlimited number of symbols that gives a new approach to the problem of syntactical analysis.
Keywords: formal power series, commutative image, syntactical analysis, integral representation. 
@article{PDMA_2018_11_a38,
     author = {O. I. Egorushkin and I. V. Kolbasina and K. V. Safonov},
     title = {Syntax analysis of programs by the method of integral representations},
     journal = {Prikladnaya Diskretnaya Matematika. Supplement},
     pages = {128--130},
     publisher = {mathdoc},
     number = {11},
     year = {2018},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/PDMA_2018_11_a38/}
}
TY  - JOUR
AU  - O. I. Egorushkin
AU  - I. V. Kolbasina
AU  - K. V. Safonov
TI  - Syntax analysis of programs by the method of integral representations
JO  - Prikladnaya Diskretnaya Matematika. Supplement
PY  - 2018
SP  - 128
EP  - 130
IS  - 11
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/PDMA_2018_11_a38/
LA  - ru
ID  - PDMA_2018_11_a38
ER  - 
%0 Journal Article
%A O. I. Egorushkin
%A I. V. Kolbasina
%A K. V. Safonov
%T Syntax analysis of programs by the method of integral representations
%J Prikladnaya Diskretnaya Matematika. Supplement
%D 2018
%P 128-130
%N 11
%I mathdoc
%U http://geodesic.mathdoc.fr/item/PDMA_2018_11_a38/
%G ru
%F PDMA_2018_11_a38
O. I. Egorushkin; I. V. Kolbasina; K. V. Safonov. Syntax analysis of programs by the method of integral representations. Prikladnaya Diskretnaya Matematika. Supplement, no. 11 (2018), pp. 128-130. http://geodesic.mathdoc.fr/item/PDMA_2018_11_a38/

[1] Glushkov V. M., Tseitlin G. E., Yuschenko E. L., Algebra. Yazyki. Programmirovanie, Naukova dumka, Kiev, 1973 | MR

[2] Salomaa A., Soitolla M., Automata-Theoretic Aspects of Formal Power Series, Springer Verlag, N.Y., 1978 | MR | Zbl

[3] Safonov K. V., Egorushkin O. I., “O sintaksicheskom analize i probleme V. M. Glushkova raspoznavaniya kontekstno-svobodnykh yazykov Khomskogo”, Vestnik Tomskogo gosudarstvennogo universiteta. Prilozhenie, 2006, no. 17, 63–67

[4] Semënov A. L., “Algoritmicheskie problemy dlya stepennykh ryadov i kontekstno-svobodnykh grammatik”, Doklady AN SSSR, 212 (1973), 50–52 | Zbl

[5] Safonov K. V., “On power series of algebraic and rational functions in $C^n$”, J. Math. Analysis Appl., 243 (2000), 261–277 | DOI | MR | Zbl

[6] Safonov K. V., “Ob usloviyakh algebraichnosti i ratsionalnosti summy stepennogo ryada”, Matem. zametki, 41:3 (1987), 325–332 | MR | Zbl

[7] Egorushkin O. I., Kolbasina I. V., Safonov K. V., “O sovmestnosti sistem simvolnykh polinomialnykh uravnenii i ikh prilozhenii”, Prikladnaya diskretnaya matematika. Prilozhenie, 2016, no. 9, 119–121

[8] Egorushkin O. I., Kolbasina I. V., Safonov K. V., “On solvability of systems of symbolic polynomial equations”, Zhurn. SFU. Ser. Matem. i fiz., 9:2 (2016), 166–172 | MR