Do deterministic context free grammars always have corresponding deterministic push down automata?
I would agree with you, but local definitions may differ. 

One point might be the definition of $L(M)$. What is the acceptance type of the PDA? That might be "empty stack" or "final state". For deterministic PDA the two modes of acceptance are not equivalent. But also here wikipedia agrees that $L$ indicates final state, which is commonly used for DCFL.