3 votes 3 votes Please explain with examples, 1)is every regular grammar is unambiguous? 2) An unambiguous grammar will always generate DCFL? Theory of Computation theory-of-computation + – AnilGoudar asked Jul 18, 2017 recategorized Jul 18, 2017 by srestha AnilGoudar 368 views answer comment Share Follow See all 2 Comments See all 2 2 Comments reply Kapil commented Jul 18, 2017 reply Follow Share For 1). Take $s\rightarrow a$ which is regular grammar and generating regular language. Now, Is this grammar ambiguous or unambiguous . Like this, you can try for 2nd . 0 votes 0 votes AnilGoudar commented Jul 18, 2017 reply Follow Share 1) S -> S / a , This is regular language with RE = a* , this is ambiguous language , correct? Hence Every regular grammar is unambiguous is FALSE. 2) WWr , for this if we can write unambiguous grammar, since we can only parse using NPDA,hence 2 statement is also FALSE. Please correct me if i am wrong. 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes i) $S \rightarrow wS$ $S \rightarrow w/\epsilon$ The language is regular but ambiguous. ii) Certain but not definite. Karan Saini answered Jul 19, 2017 Karan Saini comment Share Follow See all 0 reply Please log in or register to add a comment.