how to prove that every finite language is context-free? I am trying to prove that every finite language is context-free, is there any type of way that I could do it effectively?
It's not hard to show that every finite language is regular. If you know that every regular language is also context-free, you're done.