Can Deterministic Context free Grammars be ambigous?


I know that DCFL are unambiguous languages and DCFL languages have one-to-one correspondence with LR grammars.

But I wanted to know can there be an instance that deterministic context free grammar is ambiguous?