0 votes 0 votes For the following grammar and each of the strings gives pase trees. $S\rightarrow A1B$ $A\rightarrow 0A|\in$ $B\rightarrow B|1B|\in$ $00101$ $1001$ $00011$ Theory of Computation ullman theory-of-computation context-free-grammar + – admin asked Apr 6, 2019 admin 106 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.