BSU bulletin
Mathematics, Informatics
LoginРУСENG

BSU bulletin. Mathematics, Informatics

Bibliographic description:
Fedorchenko L. N.
CONSTRUCTION OF THE YARD LANGUAGE RECOGNIZER USING SYNTAX GRAPH-SCHEME // BSU bulletin. Mathematics, Informatics. - 2018. №1. . - С. 66-82.
Title:
CONSTRUCTION OF THE YARD LANGUAGE RECOGNIZER USING SYNTAX GRAPH-SCHEME
Financing:
Codes:
DOI: 10.18101/2304-5728-2018-1-66-82UDK: 681.51
Annotation:
The article presents the scheme for automatic construction of language rec- ognizers of LL (1) class using the syntactic graph-schemes. As an example we have considered YARD formal language, modeling the behavior of multilay- ered artificial neural networks based on the principles of a machine with a dy- namic architecture, and therefore having a number of specific language con- structs.
Keywords:
syntactic graph-scheme; context-free array grammar; formal language recognizer.
List of references:
Luk'yanova L. M., Fedorchenko L. N. Sredstva formalizatsii tselei i problem slozhnykh sistem proizvodstvennoi sfery [Means of Formal Сharacterization of Objectives and Problems of Complex Production Systems]. Vestnik Buryatskogo gosudarstvennogo universiteta — Bulletin of Buryat State University. 2012. No. 9. Pp. 42–48.

Vorob'ev V. I., Evnevich E. L., Levonevskii D. K., Fatkieva R. R., Fe- dorchenko L. N. Issledovanie i vybor kriptograficheskikh standartov na osnove intellektual'nogo analiza dokumentov [Investigation and Selection of Crypto- graphic Standards Based on Intellectual Analysis of Documents]. Trudy SPIIRAN — SPIIRAS Proceedings. 2016. V. 48. Pp. 69–87.

Lesk M. E., Schmidt E. Lex – A Lexical Analyzer Generator. Available at: http://dinosaur.compilertools.net/lex/ (accessed 25.02.2018).

Win Flex-Bison. Available at: http://sourceforge.net/projects/winflexbison/ (accessed 25.02.2018).

GNU Bison. Available at: http://www.gnu.org/software/bison/ (accessed 25.02.2018).

Parr T. ANTLR (ANother Tool for Language Recognition). Available at: http://www.antlr.org/ (accessed 25.02.2018).

Fedorchenko L. Regularization of Context-Free Grammars. Saar- brucken: LAP LAMBERT Academic Publishing, 2011. 188 p.

Fedorchenko L., Baranov S. Equivalent Transformations and Regulari- zation in Context–Free Grammars. Cybernetics and Information Technologies (CIT). V. 14, No. 4, Pp. 11–28. 2015.

Aho A., Sethi R., Ullman J. Compilers: Principles, Techniques and Tools. Addison-Wesley, 1986. 796 p.

Martynenko B. K. Regular Languages and CF Grammars. Computer Tools in Education. 2012. No. 1. Pp. 14–20 (In Russian).

Fedorchenko L. N. Algoritmy postroeniya sostoyanii analizatora dlya KSR-yazyka [Algorithms for Constructing the Analyzer States for Context- Free Array Language]. Vestnik Buryatskogo gosudarstvennogo universiteta. Matematika, informatika — Bulletin of Buryat State University. Mathematics, Computer Science. 2016. No. 4. Pp. 23–33.

Fedorchenko L. N. Generatsiya testov v sisteme SynGT [Generation of Tests in SynGT System]. Vestnik Buryatskogo gosudarstvennogo universiteta. Matematika, informatika — Bulletin of Buryat State University. Mathematics, Computer Science. 2017. No. 2. Pp. 33–39.