I mean the real kicker here is, if you want to make infix notation with order of operations _readable_, you either have to:
- break up operations into multiple statements with only equivalent operators
- use parenthesis to group operations whether you need them or not

I vaguley remember one C-like language which forced these rules on you, but most don’t

@mattly I still like Smalltalk precedence. Every method is unary, binary, or keyword. Infix math operators are all binary and every one has the same precedence, so you use more parens but you're never confused.

@mattly this is one thing I have rued as I descended into Haskell. They even make it easy for users to add more infix operators and define their precedence.