The Cocke-Younger-Kasami algorithm implementation proposed by Lange-Leiss that handles grammars on 2NF(Binary Normal Form) instead of CNF(Chomsky Normal Form).
-
Updated
Oct 17, 2019 - Java
The Cocke-Younger-Kasami algorithm implementation proposed by Lange-Leiss that handles grammars on 2NF(Binary Normal Form) instead of CNF(Chomsky Normal Form).
Add a description, image, and links to the binary-normal-form topic page so that developers can more easily learn about it.
To associate your repository with the binary-normal-form topic, visit your repo's landing page and select "manage topics."