0 votes 0 votes I understand all these following separately : 1) DCFG is always unambiguous 2) Regular grammar is a subset of DCFG 3) Regular grammar can be ambiguous But can't understand how any DCFG is unambiguous if its subset can be ambiguous Compiler Design self-doubt theory-of-computation compiler-design + – o asked Jan 2, 2022 edited Jan 3, 2022 by o o 663 views answer comment Share Follow See all 9 Comments See all 9 9 Comments reply Show 6 previous comments palashbehra5 commented Jan 3, 2022 reply Follow Share o also every nfa doesn’t have an equivalent dpda right? I think you meant NPDA? If not, NFA’s can have equivalent DPDA, NPDAs cant. Also, DCFG is always unambiguous, that's the way it is defined. Regular Grammars can be ambiguous tho because their definition is different. 1 votes 1 votes o commented Jan 3, 2022 reply Follow Share ok understood clearly thank you both of you 0 votes 0 votes ganesh gaitonde commented Jan 8, 2022 reply Follow Share https://en.wikipedia.org/wiki/Deterministic_context-free_grammar 1 votes 1 votes Please log in or register to add a comment.