Help Parse Trees Show Given Grammar Ambiguous Input String E1 E2 S1 Else S2 Also Give Unam Q37261474

With the help of parse trees show that the given grammar is ambiguous for the input string “if E1 then if E2 then S1 else S2” Also give the unambiguous grammar for “if- then-else” statements by using the disambiguating rule. Prove the unambiguity of the resulting grammar using the same input string stmt if expr then stmt if expr then stmt else stmt l other Show transcribed image text With the

OR

 

OR