Questions from class:

Determine which of the following are well$-$formed formulae $($wff$)$ and prove using bottom$-$up or top$-$down parsing. Identify the immediate predecessors and

complexity of each wff$.$

$(p^{{?}^{?}})$

$(((notTT){)}^{{?}^{?}}{p}_1)$

$(((pq{)}^{{?}^{?}}r)-=((notq)vvr))$