Re:I Wrote a Scheme in 2025
by Joker_vD on Thursday February 12, 2026 @06:10PM
(#46996596)
My apologies, it should've been (if you insist on indentation)
Would you care to elaborate about brackets helping with tracking the order of execution? I'm really curious about that part.
[ Parent
| on HN ]
TXR Lisp, with infix via ifx macro:
(ifx
(let ((a 0) (b 1) (c 0))
(tagbody
fb-start
(prinl a)
(b += a)
(a := b - a)
(c += 1)
(if (c < 100)
(go fb-start)))))Well, the P in PEMDAS stands for 'brackets'. The clearest example, even though it's rather uncommon:
a := x ** y ** z
(and that's hoping the language does the OOE for exponentiation arithmetically correctly) versus (setf a (expt x (expt y z)))
It's a bit like how Reverse Polish Notation is superior to the infix notation we torture ourselves with (x + y * z or (x + y) * z versus x y z * + or x y + z *).But that's just associativity, not the order of evaluation? E.g. in C# expressions are evaluated strictly left to right, so if it had operator **, the order of evaluation would've been:
tmp1 := x, tmp2 := y, tmp3 := z, tmp4 := tmp2 ** tmp3, yield tmp1 ** tmp4
And, eh, I am not really that convinced that a b * c d * x y * z t * p q * + + sqrt + +
is much less torturous than a * b + c * d + sqrt(x * y + z * t + p * q)