Parse Trees
A parse tree is any tree in which
- The root is labeled with S
- Each leaf is labeled with a token a or e
- Each interior node is labeled by a nonterminal
- If an interior node is labeled A and has children labeled X1,.. Xn, then A ::= X1...Xn is a production.