SSL Interpreter

Implemented the entirety of the lexer and about a half of the AST tree. You can see the AST tree of the code on the right in the screenshot. I also have planned what features I’ll have in SSL (except for the standard library, which will be a problem for later). The lexer is pretty robust and I don’t have to change it at all to add new operators. The AST tree unlike in my older programming languages doesn’t use polymorphism and is based on tagged unions and an arena. This should allow for references and for simpler and faster code in return for more boilerplate.