Suppose we adopt the following disambiguating rule used in most languages: match each else with the closest previous unmatched then.

Using this disambiguating rule, write an unambiguous grammar that is equivalent to grammar G₂.

Consider the following BNF grammar G2 used in the next two questions: if expr then 1 other : := true | false where other is a terminal that stands for any other kinds of statements, and is the stari To inal