What is an example of a decidable language? I know that if a language is regular or context free, the language is decidable. However, if a language is decidable does that imply that it is also regular or context free?
No.

As an example of a language that is decidable but does not have a context-free grammar is the language over the decimal digits that only contains the prime numbers.