Recall the $\text{CFG}$ $G_{4}$ that we gave in $\text{Example 2.4}.$ For convenience,let’s rename it’s variable with single letters as follows,
$E\rightarrow E+T|T$
$T\rightarrow T\times F|F$
$F\rightarrow (E)|a$
Give parse trees and derivations for each string.
- $a$
- $a+a$
- $a+a+a$
- $((a))$