We solved the fifth day of advent of code – in nu shell script!
It's a very friendly shell where all data is structured. It worked really nicely for an advent of code task.
We even managed to use recursion, although the default recursion limit doesn't seem like it's intended to be used. :3
OMG it was so good!
The program is not even *that* long!
We solved the fifth day of advent of code – in nu shell script!
It's a very friendly shell where all data is structured. It worked really nicely for an advent of code task.
We even managed to use recursion, although the default recursion limit doesn't seem like it's intended to be used. :3
The most romantic thing we did with @teamtype [1] is writing lisp :>
One opens the brackets and the other one closes them. Not that fitting for polyamorous folks though.
@hipsterelectron @piko @teamtype i had to think back to linguistics courses at uni: matching parentheses can be expressed as a context free grammar, but for "polyamorous parentheses" we might need different pairs intermixed, such that, for instance, <[{]>} would be valid, but <[{>} not because of the missing ]
i wonder how (if?) this could be expressed in a formal grammar and where in the chomsky hierarchy it would live.
