0 votes 0 votes Prove that the grammar generates all only the strings of $a's$ and $b's$ such that every prefix has at least as many $a's$ as $b's.$ $S\rightarrow aS|aSbS|\in$ 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 192 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.