Is there a universal pushdown automaton? That is$,$ is there a single pushdown automaton, say M$,$ such that given a string sGw$,$ where sG is a string that describes a context

free grammar and w is an input string, M accepts sGw if and only if G generates w$?$

Explain your answer.