The structured-text parser doesn't know how to handle operator precedence. At the moment, al binary operators will be parsed using infix = { expression_inner ~ (binary_operator ~ expression_inner)+ }.
I'm pretty sure this would be solved by using PrecClimber, but haven't tried it yet. As well as the usual arithmetic precedence rules, we'll need to take things like the dot operator and call syntax into account.
The
structured-text
parser doesn't know how to handle operator precedence. At the moment, al binary operators will be parsed usinginfix = { expression_inner ~ (binary_operator ~ expression_inner)+ }
.I'm pretty sure this would be solved by using
PrecClimber
, but haven't tried it yet. As well as the usual arithmetic precedence rules, we'll need to take things like the dot operator and call syntax into account.