Derivation tree is a graphical representation for the derivation of the given production rules of the context free grammar (CFG).
It is a way to show how the derivation can be done to obtain some string from a given set of production rules. It is also called as the Parse tree.
The Parse tree follows the precedence of operators.
The deepest subtree is traversed first. So, the operator in the parent node has less precedence over the operator in the subtree.
The properties of the derivation tree are given below −
The production rules for the derivation tree are as follows −
E=E+E E=E*E E=a|b|c
Here, let the input be a*b+c
The step 1 is given below
The step 2 is given below
The step 3 is given below
The step 4 is given below
The step 5 is given below