An embeddable symbolic mathematical expressions recursive interpreter with enhanced functionality

Аuthors

Anosov Y. V.^1*, Kurdumov N. N.^2**

1. Moscow State Regional Institute for the Humanities, Orekhovo-Zuevo, Moscow region,142611, Russia
2. Moscow Aviation Institute (National Research University), 4, Volokolamskoe shosse, Moscow, А-80, GSP-3, 125993, Russia

*e-mail: anosoff-yurij@yandex.ru
**e-mail: nick.n.kurdyumov@gmail.com

Abstract

The paper considers the problem of application software developing. One of its functions herewith consists in recognition and interpretation of various mathematical expressions, given in symbolic form. The paper also presents designed by the authors built-in interpreter of such mathematical expressions, based on look-up tables and complex recursive computations. The presented command interpreter has small size, supports a wide range of mathematical functions (including hyperbolic), parenthesis and functional notation of any nesting level. The multilevel system for symbolic mathematical expressions analysis realized in the interpreter allows tracking a great number of lexical, syntactic, semantic and mathematical errors (including run time errors).

The presented interpreter can be used for developing various mathematical application software by simply including the interpreter module into the project under development by directives of tools development environment «Microsoft Visual Studio» and appropriate registration of calls by C-language means [1-3].

⁠

Keywords:

interpreter, lexical analyzer, semantic analyzer, mathematical run time errors, intermediate form, application software, software module, recursion

References

1. Al’fred V. Akho A., Monika S. Lam, Ravi Seti, Dzheffri D. Ul’man. Kompilyatory: printsipy, tekhnologii i instrumentarii (Compilers: Principles, Techniques, and Tool), Moscow, Izdatel’skii dom «Vil’yams», 2015, 1184 p.

2. Karpov Yu.G. Teoriya i tekhnologiya programmirovaniya. Osnovy postroeniya translyatorov (Programming theory and technology. Translators development basics), St.Petersburg, BHV, 2005, 271 p.

3. Robin Khanter. Osnovnye kontseptsii kompilyatorov. (Basic comcepts of Compilers), Moscow, Izdatel’skii dom «Vil’yams», 2002, 256 p.

4. Anosov Yu.V., Danilin A.N., Kurdyumov N.N. Trudy MAI, 2015, no. 80: http://www.mai.ru/science/trudy/published.php?ID=56958

5. Danilin A.N., Kozlov K.S., Kuznetsova E.L., Tarasov S.S. Trudy MAI, 2013, no.64: http://www.mai.ru/science/trudy/published.php?ID=36556

6. Krupenin A.M., Martirosov M.I. Trudy MAI, 2013, no. 69: http://www.mai.ru/science/trudy/published.php?ID=43066

7. Lur’e S.A., Solyaev Yu.O., Nguen K., Medvedskii A.L., Rabinskii L.N. Trudy MAI, 2013, no. 71: http://www.mai.ru/science/trudy/published.php?ID=47084

8. Formalev V.F., Kuznetsova E.L., Selin I.A. Trudy MAI, 2014, no. 72: http://www.mai.ru/science/trudy/published.php?ID=47581

Download