Apply the CYK algorithm to decide if the strings belong to the L$($G$)$ language. It first transforms the grammar to an equivalent Chomsky Normal Form.

G$1$: w$1=1010$ w$2=001$

S $->$ S$01|$ A $|$ AB

A $->1$A$0|$ S $|\backslash$epsi

B $->1$C

C $->0$C $|0|\backslash$epsi