Java program that allows to know if a string can be generated by a context-free grammar, using the CYK algorithm.
-
Updated
Oct 25, 2021 - Java
Java program that allows to know if a string can be generated by a context-free grammar, using the CYK algorithm.
A simple implementation of CYK algorithm to check the validity of a string according to the given grammer
Implementation of algorithm to Converting CFGs to CNF (Chomsky Normal Form) and Cocke–Younger–Kasami (CYK) algorithm for CFGs
The Cocke-Younger-Kasami algorithm implementation proposed by Lange-Leiss that handles grammars on 2NF(Binary Normal Form) instead of CNF(Chomsky Normal Form).
A simple compiler for parsing java codes and get syntax errors with CYK algorithm for context free grammars (CFG)
Add a description, image, and links to the cyk topic page so that developers can more easily learn about it.
To associate your repository with the cyk topic, visit your repo's landing page and select "manage topics."