Parse Tree of Predicate Formula

Leaves in a parse tree are the atomic formulas

Definition

For $F=\exists x(\forall y(S(x,y)\to \neg F(y))\wedge \exists uS(u,x))$