CYK Parser: Context-Free Grammar Parsing Table

This simulation introduces computational linguistics through one of its foundational algorithms: Cocke-Younger-Kasami (CYK) parsing. A small Chomsky-Normal-Form grammar tokenizes and parses toy English sentences by filling a triangular dynamic-programming table one cell at a time — each cell rendered as a 3D tower whose height and color report which grammatical categories (S, VP, NP, PP, and lexical parts of speech) can be derived over that word span. Step through the fill order manually or let it play automatically, then compare an unambiguous sentence against the classic "I saw the man with the telescope" attachment ambiguity, where the algorithm discovers two independent derivations of the same string.