Production and evaluation of logarithmic expressions with symbolic approaches

This study aims to develop a software application that, via symbolic approaches, can produce, evaluate and document mathematical expressions based on logarithm functions. An LL(k) grammar is designed in EBNF-like notation for logarithmic expressions, and the source code of the expression parser is produced in the Java programming language as a result of definitions in JavaCC format. Using parser methods, on the one hand, the syntax analysis of logarithmic expression components is carried out, on the other hand, an abstract syntax tree with a hierarchical structure is created in accordance with the meaning of the relevant expression. As part of this pattern, the accept method is used to grant access to each tree node, and the visit method is used to evaluate the relevant node. Logarithmic expressions are generated in two different forms: constant (based on integers) and single-variable (based on the symbol x). The solutions to logarithm problems created according to a specific question pattern or template, along with the processing steps, can be both displayed on a terminal and transferred to a PDF document. The production of PDF files is carried out by textual transformations into the LaTex document formatting language via syntax trees of logarithmic expressions.