1.grammar G which is context-free has the productions
S → aAB
A → Bba
B → bB
B → c
Compute the string w = ‘acbabc’ with left most derivation, right most derivation and draw Top Down parse tree.
2.Compute the First and Follow sets