New Lexer

1. The lexer generates a syntax tree during the input parsing.
2. Basic math operators +-*/ were introduced. It enables you to use math in your expressions:

1 + 2
2 * (1 + -199)

New memory model

• Remove memory hard limits
• Array of arrays support
• The equals delegator supports arrays

First version

The first release contains the basic toolchain:

• compilation the expression language into bytecode
• bytecode executing by the virtual machine