Expression trees (intermediate representation)
Compiler implementation of the D programming language.
Make a pointer to a Symbol.
Make an elem out of a symbol.
Elems: Elems are the basic tree element. They can be either terminal elems (leaves), unary elems (left subtree exists) or binary elems (left and right subtrees exist).
See Source File backend/el.d
Walter Bright
Copyright (C) 1985-1998 by Symantec Copyright (C) 2000-2023 by The D Language Foundation, All Rights Reserved
Boost License 1.0
Expression trees (intermediate representation)
Compiler implementation of the D programming language.