parsing Tree:

consider Grammar $G=(v,{\displaystyle \underset{?}{\overset{T}{}}}{R}^p,E^s)$

$(a_1+,*,(,)\}$

$R=(P)=EE+T|T|$

$TT+F|F|$

$(E)|a|$

Construct parsing Tree for

$(a+a)**a$