The Lisp tokenizer works and it is 83 bytes
:)
You don't need lookahead to deal with lisp, you just need super fuckin lazy parsing.
So like, we don't deal with a number until we find a non-number character, then we execute both the number handling code and the non-number handling code.
This will break at places where you have like, numbers and symbols right next to each other but like... don't do that.
We're not going to have error handling or any nice conveniences because this is literally running in 512 bytes, what do you actually *need*, it should be able to cons two lists together fine. your fault if things crap out because you happened to not type a space
(ha ha only serious)
@alexandria *looks up at you with awe*
@powerofzero Oh, it took a few weeks and the original version is written in C, but like it's assembler -- I basically translated it over because C means I can toy with and debug stuff to get the program right, and then I have a baseline to compare against lol
