Syntactical analysis of monomials in context-free languages taking into account the productions application order | Applied Discrete Mathematics. Supplement. 2019. № 12. DOI: 10.17223/2226308X/12/54

Syntactical analysis of monomials in context-free languages taking into account the productions application order

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.

Download file

Counter downloads: 126

Keywords

синтаксический анализ мономов, контекстно-свободные языки, мономиальные метки, syntactical analysis of monomials, context-free languages, monomial labels

Authors

Name	Organization	E-mail
Kishkan V. V.	M.F. Reshetnyov Siberian State University of Science and Technology named after academician	kishkan@mail.ru
Safonov K. V.	M.F. Reshetnyov Siberian State University of Science and Technology named after academician	safonovkv@rambler.ru

Всего: 2

References

Глушков В. М., Цейтлин Г. Е., Ющенко Е. Л. Алгебра. Языки. Программирование. Киев: Наукова думка, 1973.

Salomaa A. and Soitolla M. Automata-Theoretic Aspects of Formal Power Series. N.Y.: Springer Verlag, 1978.

Egorushkin O. I., Kolbasina I. V., and Safonov K. V. On solvability of systems of symbolic polynomial equations // Журн. СФУ. Сер. Матем. и физ. 2016. Т. 9. Вып. 2. С. 166-172.

Егорушкин О. И., Колбасина И. В., Сафонов К. В. Аналог теоремы о неявном отображении для формальных грамматик // Прикладная дискретная математика. Приложение. 2017. №10. С. 149-151.