2 votes 2 votes Let M be a Non-deterministic Finite Machine. Let G be the Regular Grammar obtained from M. Which is True? (a) G will always be unambiguous (b) G will always be ambiguous (c) G may be ambiguous (d) None of the above Theory of Computation finite-automata regular-expression minimal-state-automata + – Mojo-Jojo asked Sep 28, 2015 Mojo-Jojo 1.6k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 2 votes 2 votes I think ans is C) Regular grammar can be Ambiguous . Pranay Datta 1 answered Sep 28, 2015 • edited Jul 21, 2017 by Arjun Pranay Datta 1 comment Share Follow See all 3 Comments See all 3 3 Comments reply Mojo-Jojo commented Sep 28, 2015 reply Follow Share How? Am ambiguous language can never be regular. 1 votes 1 votes Arjun commented Sep 28, 2015 reply Follow Share Yes, it should be "Regular grammar" may be ambiguous. Regular language set is subset of DCFL and no DCFL is inherently ambiguous. 2 votes 2 votes Kaluti commented Jul 21, 2017 reply Follow Share language can never be ambiguous grammar may be ambiguous or unambiguous here 2 votes 2 votes Please log in or register to add a comment.
