Rust closures are rust-call calling convention only. This is a problem, since we want to lift them to our IR, and we don't know what registers are "li

id like for this to just take an ABI parameter but rust deprececated default generic arguments for functions :/

this should be a lazy_static

We can now use our new combinator to define the rest of the `Expr`s. Starting with function application, we can see how the parser mirrors our data d

Now we take all these simple parsers and connect them. We can now parse half of our language!

Our boolean values are also constant, so we can do it the same way

Continuing the trend of starting from the simplest piece and building up, we start by creating a parser for the built-in operator functions.

We then add the Expr layer on top

Because `Expr::If` and `Expr::IfElse` are so similar (we easily could have defined `Expr::If` to have an `Option` for the else block), we parse both i

The next easiest thing to parse are keywords. We introduce some error handling combinators: `context` for human readable errors and `cut` to prevent b

Next up is number parsing. We're keeping it simple here by accepting any number (> 1) of digits but ending the program if it doesn't fit into an i32.

A quoted S-expression is list data structure. This example doesn't have the symbol atom, but by adding variables and changing the definition of quote

Sub with borrow