| |

. | . |

. | .

A|B|C|D

1|2|3|4

Show the syntax tree for the left most derivation of the statement: A. A. B. B.

Notice that the grammar we consider is ambiguous. The string in item (c) has more than one syntax trees. Show another syntax tree of the left-most derivation for the above statement.

Write a similar grammar that is not ambiguous. This will require you to add a restriction on the current grammar to eliminate the ambiguous statements.