350 rub
Journal Neurocomputers №5 for 2018 г.
Article in number:
Fast parsing in Java for building neurocomputer systems
Type of article: scientific article
UDC: 004.4'24
Keywords: compilation theory lexical analysis regular expressions recursive descent syntax tree of parsing Java neuronlike nondeterministic finite state machine neural networks.
Authors:

R.V. Veiko – Research Scientist, Research Centre for Medical Genetics (Moscow) 

E-mail: db-mail-dbase@yandex.ru 

Abstract:

The article is devoted to problem increasing the speed of lexical analysis when parsing the contents of text or binary files. An example of a generator of lexical analyzers based on regular expressions is given. The input data of grenerator are terminal symbols introduced in regualar expressions. The output data is generated undetermined final automate as the receiver of contents of parsed text or binary file. The program released in Oracle Java programming language. There are an example of rejection of standard parsing tools provides by Java (java.util.regex package), taking into account the specifics of assigned task.

Pages: 12-16
References
  1. Aho A.V., Seti R. Ul'man Dzh.D. Kompilyatory: Principy, tekhnologii i instrumenty. M.: Izdatel'skij dom «Vil'yams». 2003. C. 97–166. 768 s.
  2. Jakacki G. OpenC++ – A C++ Metacompiler and Introspection Library https://www.codeproject.com/Articles/13896/OpenC-A-C-Metacompilerand-Introspection-Library , Software Developer's Journal, 28 Aug 2013.
Date of receipt: 24 апреля 2018 г.