However, an efficient chart parser for PCFG can combine only two adjacent constituents in each step.
if the original tree used the rule A → B C D, the parser needs to first combine B with C, say into the substring [i, k], and then the result with D (or vice versa).