The parser is currently over complicated, there must be ways to simplify it

Goals:

• Remove Expression
• Remove DotChain
• Remove Type and Typed?
• Remove typed based tokens (Example: F32, F64)
• Use nullable rather than inner data classes (Example: Parameter)
• Use expectations to generate the AST in a simple way
• Compare current AST design to other languages https://astexplorer.net/ and Odin
• Move math functions out of AST ( minus(number: Number), pow(number: Number), etc )
• Automatically generate Parser from AST classes lazily?
• Make a new repo for common things that can used across support for other languages