Better QExpressions

[ghost]

In version v0.6.0, we are doing a full rewrite, and with that will come better QExpressions. We should have a way to store the code in qexpressions that will make them fast and efficient to parse when being evaluated in the code. These are the few ways I have come up with to implement qexpressions in this new version:

• Store the ast-tree that we get from the mpc library in the dval.
• Store the elements of the qexpression, including expressions and identifiers, in the dval. This will require us to additionally have the expression and identifier dval types.
  • We could store the expressions in the qexpressions as more qexpressions that also get evaluated when the root qexpression is evaluated. This will allow us to remove the expression dval type. However, this will remove the possibility of having an actual qexpression inside another that does not get evaluated.

[ghost]

It would also slightly improve the performance of evaluating qexpressions if we looked through the qexpression and evaluated any expressions that use constant identifiers and values. This will make sure that these types of expressions are not evaluated when the qexpression is evaluated but rather when the qexpression is declared.

For example, in this qexpression: {print (+ 3 3)}, we could automatically evaluate the expression (+ 3 3) because it doesn't use any non-constant identifiers (the + identifier is constant).