A PDA to recognize the Intersection of two regular languages?
If the intersection is empty then you have to show that some PDA accepts the empty language. That doesn't sound too difficult.

More generally, every NFA is secretly a PDA (showing that every regular language is context-free), and so if you can construct an NFA for your language then you can easily convert it to a PDA.