Geodesic
Syntactical analysis of monomials in context-free languages taking into account the productions application order
Prikladnaya Diskretnaya Matematika. Supplement, no. 12 (2019), pp. 194-196 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

The problem of syntactical analysis under consideration is the development of a deadlock algorithm to determine whether it is possible to obtain a monomial from the initial symbol using the productions of a given context-free language, to find out which productions and how many times are used to derive this monomial and also to establish, if possible, the order of using these productions. We propose a method of monomial labels which allows to establish the order of productions application.
Keywords: syntactical analysis of monomials, context-free languages
Mots-clés : monomial labels. 
@article{PDMA_2019_12_a53,
     author = {V. V. Kishkan and K. V. Safonov},
     title = {Syntactical analysis of monomials in context-free languages taking into account the productions application order},
     journal = {Prikladnaya Diskretnaya Matematika. Supplement},
     pages = {194--196},
     year = {2019},
     number = {12},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/PDMA_2019_12_a53/}
}
TY  - JOUR
AU  - V. V. Kishkan
AU  - K. V. Safonov
TI  - Syntactical analysis of monomials in context-free languages taking into account the productions application order
JO  - Prikladnaya Diskretnaya Matematika. Supplement
PY  - 2019
SP  - 194
EP  - 196
IS  - 12
UR  - http://geodesic.mathdoc.fr/item/PDMA_2019_12_a53/
LA  - ru
ID  - PDMA_2019_12_a53
ER  - 
%0 Journal Article
%A V. V. Kishkan
%A K. V. Safonov
%T Syntactical analysis of monomials in context-free languages taking into account the productions application order
%J Prikladnaya Diskretnaya Matematika. Supplement
%D 2019
%P 194-196
%N 12
%U http://geodesic.mathdoc.fr/item/PDMA_2019_12_a53/
%G ru
%F PDMA_2019_12_a53
V. V. Kishkan; K. V. Safonov. Syntactical analysis of monomials in context-free languages taking into account the productions application order. Prikladnaya Diskretnaya Matematika. Supplement, no. 12 (2019), pp. 194-196. http://geodesic.mathdoc.fr/item/PDMA_2019_12_a53/

[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] 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

[4] Egorushkin O. I., Kolbasina I. V., Safonov K. V., “Analog teoremy o neyavnom otobrazhenii dlya formalnykh grammatik”, Prikladnaya diskretnaya matematika. Prilozhenie, 2017, no. 10, 149–151