DCFG grammar

Question

Can a DCFG grammar be Ambiguous? If so please provide an example.

Comments

@Hemant Parihar

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

I agree with all accept 1

DCFG can be ambiguous. (I THINK IT IS FALSE)

---

@VS, Yes you are correct. DCFG are always unambiguous.

From wiki,

In formal grammar theory, the deterministic context-free grammars (DCFGs) are a proper subset of the context-free grammars. They are the subset of context-free grammars that can be derived from deterministic pushdown automata, and they generate the deterministic context-free languages. DCFGs are always unambiguous, and are an important subclass of unambiguous CFGs.

---

and every DCFL there is al least one unambiguous DCFG

and every DCFL has ambiguous grammar https://gateoverflow.in/135969/dcfls

Answer 1

Yes Grammars  can be ambiguous but language can't be.

For Example you can see the Gate 2003 -cs Ques 90

Answer 2

Yes, it can. Have a look at this balanced parenthesis CFG: 

S-->(S)/SS/null.

We have more than one parse trees here, you can also draw a DPDA for this grammar. So you have a CFG that is in fact, ambiguous.