Visualization of Syntax and Semantics for Simple Functional Language of Natural Numbers and Boolean Values

Building an abstract syntax tree is an integral part of compilers. We analyze a few of the popular techniques providing such analysis in the web environment. Based on the analysis of these solutions, we deal with the implementation of our parser solution, which also provides a graphical representation of abstract syntax trees as well as proof trees. This solution is then used in our application designed to interpret the expressions of the simple teaching functional language of natural numbers and boolean values. In addition, the application supports the evaluation (semantics) of expressions (step by step), and also their individual properties: the depth of the syntax tree, syntax tree nodes count, and the constants used in the expression.