FullĀ BEDMAS supportĀ has been implemented in the new compiler for theĀ āiā programming language.
This is a pretty basic feature of a programing language, however, due to the way I created the first two compilers, BEDMAS support was rather hit and miss. Recursion is not a strong skill of mine.
For those not familiar withĀ BEDMAS (aka. operator Precedence). It is the standard way of evaluating a mathematical expression. The acronym stands forĀ āBrackets, Exponents, Division, Multiplication, Addition and Subtractionā. This acronym is a common way for people to remember the order that they evaluate mathematicalĀ statements such as ā2*3+5ā which is equal to ā11ā and not ā16ā.
On another new rather āsurprisingā note, the newĀ āiā compiler runs faster than the āGoā language it is compiling to.
I wrote a Hello World program that loops a million times (To be fair, this is not a greatĀ benchmark).
TheĀ āiā code is ~100ms faster than an idiomatic version in Go.
Keep in mind that the āiā code has been translated into Go in order to run --- so this is a rather surprising result!
This can mean only good things for the future ofĀ āiā.