0 votes 0 votes Consider the grammar $S\rightarrow aS|aSbS|\in$ This grammar is ambiguous. Show in particular that the string $aab$ has two$:$ Parse trees Leftmost derivations Rightmost derivations Theory of Computation ullman theory-of-computation context-free-grammar context-free-language + – admin asked Apr 6, 2019 • edited Apr 6, 2019 by Lakshman Bhaiya admin 148 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.