5. Example: intro to parsing & grammars

1 * 2 + 3
id * id + id
F * F + F
T * F + F
T + F

Here's T + F as a parse tree:

   T    + F
 / | \    |
T  *  F   id
|     |
F    id
|
id

      E
    / |  \
   E  +   T
   |      |
   T      F
 / | \    |
T  *  F   id
|     |
F    id
|
id

Has the structure we expected, follows the order of operations.