const Node(* comp)(const Node &a, const Node &b)
Class Node = (type x (int + double + Sym + void*))
BinOp(const char *name, const char *namevec, const char *namescal, comp f, pred ln, pred rn, int priority)
A Node is a tagged unions of int, double, symbol and void* used in the implementation of CTrees...
BinOp * gBinOpLateqTable[]
bool(* pred)(const Node &a)
bool isRightNeutral(const Node &a)
const char * name(Symbol *sym)
Returns the name of a symbol.
Node compute(const Node &a, const Node &b)
bool isLeftNeutral(const Node &a)