Show that the grammar is ambiguous by finding a string that has two different syntax trees. Now make two different unambiguous grammars for the same language: a) One where prefix minus binds stronger...

Show that the grammar

is ambiguous by finding a string that has two different syntax trees.

Now make two different unambiguous grammars for the same language:

a) One where prefix minus binds stronger than infix minus.

b) One where infix minus binds stronger than prefix minus.

Show the syntax trees using the new grammars for the string you used to prove the

original grammar ambiguous.