Example of non-regular context free language L such that prefix(L) is regular
Consider the language of words with the same number of a's and b's. It is non-regular but the set of prefixes is the set of all words which clearly is regular.