Curly-infix and readable Lisp
Posted Dec 5, 2012 8:26 UTC (Wed) by dakas
In reply to: Curly-infix and readable Lisp
Parent article: GNU Guile 2.0.7 released
The sweeten tool does this already. It employs heuristics to decide questions like these.
Meaning that the output is not predictable and can change from version to version.
They aren't perfect, but what's the worst that could happen? You get a string representation of a data structure that isn't as nice as it could have been, so what?
You need to be fluid in two languages instead of just one and transparently deal with either output.
The whole point of infix notation is to reduce the amount of thinking you need to invest. Now you need to be fluid in two representations and transparently translate back if sweeten decided to "infixify" a list that was not intended as an arithmetic expression, and vice versa.
At any rate, I am just making predictions. The only one in a position to dispel them is Father Time. I suspect I have had him visiting more often than you did, but at any rate I'm willing to take what he will eventually have to say in that matter.
to post comments)