Recursive definition of a language given the regular expression
Just replace Kleene stars with $\epsilon$ to find the basis and position, then extend to both direction. 

$B=\{\epsilon\}$

$\mathcal{F}=\{X\to0X|10X|X1\}$

$L_1 = \langle B \rangle_{\mathcal{F}}$