1.Previous
3.Next

trees, or ASTs, is the smallest -indexed family of disjoint sets closed under the following conditions:

# Variables are ASTs: if , then .
# Operators combine ASTs: If is an operator of arity , and for all , then .

See also

References

Further reading

* (overview of AST implementation in various language families)
*
*
*
* Robert Harper (2016). (Second Edition).

1.Previous
3.Next