0 votes 0 votes This question concerns the grammar $S\rightarrow A1B$ $A\rightarrow 0A|\in$ $B\rightarrow 0B|1B\in$ Is your grammar is unambiguous$?$ If not,redesign it to be unambiguous. Theory of Computation ullman theory-of-computation context-free-grammar context-free-language + – admin asked Apr 6, 2019 admin 281 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.