A simple implementation of CYK algorithm to check the validity of a string according to the given grammer
Note: For using this algorithm, the grammer must be in CNF (Chomsky Normal Form).
How did i understand it ? Try this pdf
If not, feel free to provide better resources.