2 votes 2 votes Give a derivation tree for $w = abbbaabbaba$ for the grammar $G$, with productions $S\rightarrow abB$ $A\rightarrow aaBb$ $B\rightarrow bbAa$ $A\rightarrow \lambda$. Use the derivation tree to find a leftmost derivation. Theory of Computation peter-linz peter-linz-edition4 theory-of-computation context-free-grammar + – Naveen Kumar 3 asked Apr 13, 2019 Naveen Kumar 3 178 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.