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.
G1: w1 = 1010 w2 = 001
S -> S01 | A | AB
A-> 1A0 | S | ε
B -> 1C
C -> 0C | 0 | ε