CYK Algorithm

Question

S $\rightarrow$aB            S$\rightarrow$bA

B $\rightarrow$ b             A $\rightarrow$ a

B $\rightarrow$ bS          A $\rightarrow$ aS

B $\rightarrow$ aBB        S $\rightarrow$ bAA

Using CYK Algorithm prove that each of which can be derived/not derived 

1. aabbbb   
2. aabbab  

Comments

See here productions are of form B->aBB .  What to do in this situvation ?

---

B ->aBB

can be wtriten

B ->XY

X->a

Y - >BB

---

CYK algorithm only works if the grammar is in CNF form,if not convert it into CNF then apply CYK algorithm 

Refer this : https://gateoverflow.in/45981/cyk-algo