Gregory's Server@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.
|
2 comments
 @mattly I also appreciate consistency, which is why I find postfix languages appealing. PostScript is actually pretty cool. I don't usually mind prefix with parens, but I do find the paren trees can make it harder to see the semantic forest. |
@joshsusser I’d still rather have consistency
max(n + 2, 0)
n.+(2).max(0)
n + 2 max 0
n plus 2 max 0
(max 0 (+ n 2))
(-> n (+ 2) (max 0))