we know that
Regular grammar generates Regular Language ===> Accepted by Finite Automata.
CFG generates CFL ====> Accepted by PDA
but PDA = FA + 1 - Auxiliary Memory = FA+stack
therefore if you are not using the memory of PDA it simply looks as FA.
∴ PDA can recognize the language which is generates by either CFG or RG
1 question paper link