(Answered) Self doubt about ambiguous grammar

Question

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

Comments

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.

---

ok understood clearly thank you both of you

---

https://en.wikipedia.org/wiki/Deterministic_context-free_grammar