We have no idea if/when the variables in the second version go out of scope.
This is a huge problem in languages that aren't lisp.
We have no idea if/when the variables in the second version go out of scope.
This is a huge problem in languages that aren't lisp.
If it weren't it would just be a def/setf/defvar/defparameter.
In the example given, assuming let has the same properties, we have no idea when the second 'let' statement ends, you would need something to signify the end of the block... there isn't anything in the given example. It could be implicit whitespace or something, but that isn't clear.
If it were truly algol it would probably have an 'endlet' symbol at the end of the let, for example. If it were C it would require curly brackets, python out-dentation, ocaml something else(!?).
Anyway, I suspect you're a troll,
good day.
The crystal clear point of ohyes's observation is that the token count is unequal, in a sense: the Lisp expression is defining variables and delimiting the scope, and includes tokens which establish scoping, whereas the Algol-like snippet is only defining variables, letting an unspecified surrounding program delimit their scope. That program is going to require some syntax in order to delimit that scope; that syntax is not shown and so its tokens are not counted.
I get that you think having to wrap your entire program in an extra set of delimiters is super special, but it's really fucking not.