NO.
CFLs are not closed under intersection. If you make an intersection of two CFLs, you may or may not get a CFL.
But the intersection of CFL with a regular language is always CFL. There are ways to do it.
So, CFL intersection CFL is undecidable while CFL intersection regular language is decidable.