I NEED A CODE ASAP ! PLEASE DONT TAKE USER INPUT FOR THE PRODUCTION RULES AND PLEASE IMPORT CFG FROM NLTK IN PYTHON AND MAKE SURE THE CODE CAN BE RUN ON SPYDER AND PLEASE STICK TO THE PSEUDO CODE PROVIDED !!! PLEASE DONT GIVE ME ANSWERS THAT ARE ALREADY AVAILABLE ON THE INTERNET THEY DONT FIT THE CRITERIA !!

write a code for CYK (Cocke Younger Kasami) algorithm using the following pseudocode:

let the input be a string I consisting of n characters: a1 ... an. let the grammar contain r nonterminal symbols R1 ... Rr, with start symbol R1. let P[n,n,r] be an array of booleans. Initialize all elements of P to false. for each s = 1 to n for each unit production Rv -> as set P[1,s,v] = true for each l = 2 to n -- Length of span for each s = 1 to n-l+1 -- Start of span for each p = 1 to l-1 -- Partition of span for each production Ra -> RbRcif P[p,s,b] and P[l-p,s+p,c] then set P[l,s,a] = true if P[n,1,1] is true then I is member of language else I is not member of language

GRAMMAR TO BE USED :

S->E(empty string)|AB|XB

T->AB|XB

X->AT

A->a

B->b

strings to check:

aaabb

aaabbb