Show that grammar G₁ is ambiguous using parse trees: G₁: S → if S then S else…

PYQ GATE 1990Modified — slightly modified from the official paper; see the solution

Show that grammar G₁ is ambiguous using parse trees: G₁: S → if S then S else S S → if S then S S → a (where a is a terminal).

Sign up free to check your answer

Sign up free

Explore the full course: Compiler Design

Loading lesson…