Question: are all recursive language recursively enumerable?
Answer: A language is recursively enumerable if there exists a Turing machine that accepts every string of the language, and does not accept strings that are not in the language. ... Clearly, every recursive language is also recursively enumerable. It is not obvious whether every recursively enumerable language is also recursive.