(a) Remove left-recursion from the following grammar: S → Sa| Sb | a | b(b)…

PYQ GATE 2001

(a) Remove left-recursion from the following grammar:

S → Sa| Sb | a | b

(b) Consider the following grammar:

S → aSbS| bSaS |ε

Construct all possible parse trees for the string abab. Is the grammar ambiguous?

Sign up free to check your answer

Sign up free

Explore the full course: Compiler Design

Loading lesson…