CYK Parsing Algorithm

Project Description

This project was implemented within a university lecture in the summer term of 2020. The idea is simple; Given a user-specified context-free grammar and a word, the grammar is first transformed into the Chomsky normalform . Thereafter, the Cocke-Younger-Kasami(CYK) algorithm is used to check whether the specified word can be generated with the grammer. The table that is generated in the process can be saved in either markdown, or LaTeX.