Question 26
In the CYK (Cocke-Younger-Kasami) Parsing Algorithm, what data structure is constructed to parse an input string of length n?
CYK constructs an n $\times n upper-triangular table P$ where entry P[i, j] stores non-terminals deriving substring w[i...j].