0 votes 0 votes For every regular grammar, we can always have an unambigious grammar? Theory of Computation theory-of-computation finite-automata regular-language inherently-ambiguous + – smsubham asked Oct 28, 2018 smsubham 445 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes yes always have unamibigous grammer proof is here https://cs.stackexchange.com/questions/16082/proof-that-there-is-unambigous-grammar-for-every-regular-language Gurdeep Saini answered Nov 14, 2018 Gurdeep Saini comment Share Follow See all 0 reply Please log in or register to add a comment.