Derivation tree --- дерево вывода.
Let be a CF-grammar and be a sentence form in .
All equivalent derivations of can be represented by its derivation tree that is an ordered rooted tree labeled by elements from , such that the following properties hold. The root of the tree has a label , labels of all leaves enumerated according to their ordering forms and for any internal node of the tree with a list of all sons enumerated according to their ordering, there is such a production of the grammar that either and the nodes have labels , respectively, or , , has a label and has the empty string as a label.
Other names are Parse tree, Syntax tree.