I posted this question earlier also and expert gave me answer of another question which was existing. Please check it properly and answer carefully

0. Given the following grammar, G: S A | S # S | A @ A A C | C A C a | b | c For each production below, state whether it is: In the language G decides - if so, prove it with a derviation and parse tree - if not, explain why If it is ambiguous in G - if so, prove it is with another valid parse tree in G

Productions:

I. a # b # c

II. a @ b # c

III. a @ b @ c

1. Rewrite grammar G so that:

- no string in it is ambiguous

- # has higher precedence than @

- # and @ are both left-associative (i.e. a # b # c should mean (a # b) # c )