Techniques to create a PDA for a language that is the conjunction of two languages
The intersection of a CFL and a regular language is itself a CFL.  There is a standard construction for computing this intersection.  It's documented in automata theory textbooks; look in your favorite automata theory textbook, and you should find it there.