Consider the following grammar with start symbol S:
S -> SS
S -> (S)
S -> Σ
Show that this grammar is ambiguous by generating two differentparse trees for the sentence ()(). Give an equivalent unambiguousgrammar.
Expert Answer
An answer will be send to you shortly. . . . .