Destructors are attached to VarDeclarations. Hence, if expression returns a temp that needs a destructor, make sure and create a VarDeclaration for that temp.
Take address of expression.
Calling function f. Check the @nogc-ness, i.e. if we're in a @nogc function we can only call other @nogc functions. Returns true if error occurs.
Check that the postblit is callable if t is an array of structs. Returns true if error happens.
Calling function f. Check the purity, i.e. if we're in a pure function we can only call other pure functions. Returns true if error occurs.
Accessing variable v. Check for purity and safety violations. Returns true if error occurs.
Check whether the expression allows RMW operations, error with rmw operator diagnostic if not. ex is the RHS expression, or NULL if ++/-- is used (for diagnostics) Returns true if error occurs.
Calling function f. Check the safety, i.e. if we're in a @safe function we can only call @safe or @trusted functions. Returns true if error occurs.
Check that the expression has a valid type. If not, generates an error "... has no type".
Check that the expression has a valid value. If not, generates an error "... has no value".
Does *not* do a deep copy.
If this is a reference, dereference it.
Does this expression statically evaluate to a boolean 'result' (true or false)?
Return !=0 if expression is an lvalue.
Resolve __FILE__, __LINE__, __MODULE__, __FUNCTION__, __PRETTY_FUNCTION__, __FILE_FULL_PATH__ to loc.
If expression can be tested for true or false, returns the modified expression. Otherwise returns ErrorExp.
Give error if we're not an lvalue. If we can, convert expression to be an lvalue.
Combine e1 and e2 by CommaExp if both are not NULL.
Deinitializes the global state of the compiler.
If 'e' is a tree of commas, returns the rightmost expression by stripping off it from the tree. The remained part of the tree is returned via e0. Otherwise 'e' is directly returned and e0 is set to NULL.
Visits this AST node using the given visitor.
http://dlang.org/spec/expression.html#expression