Let $G$ be a grammar with rules:

$\backslash$begin$\{$itemize$\}$

$\backslash$item $S $\backslash$to ASB $\backslash$mid $\backslash$lambda$

$\backslash$item $A $\backslash$to aAb $\backslash$mid $\backslash$lambda$

$\backslash$item $B $\backslash$to bBa $\backslash$mid ba$

$\backslash$end$\{$itemize$\}$

oindent a$)$ Give a leftmost derivation of $aabbba$$.$

$\backslash$solution

$\backslash$problembreak

oindent b$)$ Give a rightmost derivation of $abaabbbabbaa$$.$

$\backslash$solution

$\backslash$problembreak

oindent c$)$ Build the derivation trees for the derivations in parts $($a$)$ and $($b$).$

$\backslash$solution

$\backslash$problembreak

oindent d$)$ Use set notation to define $L$($G$)$$$.$