Can every language of context-free grammar be expressed in set builder notation?

415 Views Asked by At

Is it true that every CFG can be written as CFL just by using set builder notation and basic algebraic terms?

For example CFG named $G$:

$$S \rightarrow a\,S\,b\,\,|\,\,\epsilon$$

Can be written as following CFL:

$$L(G)=\{\, a^nb^n\,\,|\,\,n \ge 0\}$$

Does it hold generally?