so this repo is like an experiment so I can get how much hard or easy it actually is to parse expressions in python before integrating this concept into the language.

That was [gnebehay’s] thought when his university studies were too high level, so he decided to write an arithmetic expression parser in Python. It came out in about 100 lines of code.

This algorithm does not use a decision tree. It is a kind of Recursive Ascent Parser (https://en.wikipedia.org/wiki/Recursive_ascent_parser). In fact, it is LR parser ...

Abstract: Just in Time (JIT) compiler has been used in many modern programming languages such as python and Java, it has also been implemented in various web browsers to improve the performances of ...