Find the language generated by a grammar G=({S},{a,b},{S->aSb, S->ab},S)
b) Given G=({S,A},{a,b},P,S) where P={S->AaS|S|SS,A->SbA|ba} S-Start symbol. Find the left most and right most derivation of the string w=aabbaaa. Also construct the derivation tree for the string w. c) Define a PDA. Give an Example for a language accepted byPDA by empty stack.
Find the language generated by a grammar G=({S},{a,b},{S->aSb, S->ab},S)
b) Given G=({S,A},{a,b},P,S) where P={S->AaS|S|SS,A->SbA|ba} S-Start symbol. Find the left most and right most derivation of the string w=aabbaaa. Also construct the derivation tree for the string w. c) Define a PDA. Give an Example for a language accepted byPDA by empty stack.
G denotes the context-free grammar defined by the
following rules. ` S->ASB/ab/SS A->aA/A ,B->bB/A
(i)Give a left most derivation of aaabb in G. Draw the associated parse tree.
(ii)Give a right most derivation of aaabb in G. Draw the associated
parse tree.
(iii) Show that G is ambiguous. Explain with steps.
(iv) Construct an unambiguous grammar equivalent to G. Explain.