Please show me how it works in detail.

Description: Implement the CKY Algorithm as a recognizer to determine if a string is in a language in the language\platform of your choice.

Program Requirements:

Input a grammar G in CNF. You can use any method to input the grammar. Your program will be tested with grammars of size: 5 10 variables, 10 - 20 productions, 2 - 6 terminals.

Input a string w.

Output : True if w L(G), otherwise false.

* Extend your program to a parser that also constructs a parse tree for w.