Past exam of the mathematics course of the University of Cambridge / 2023 / ii / Paper 1 / 4I / b

The length isIndeed, the parse tree has $n$ terminal-production nodes and, as a full binary tree with $n$ leaves, $n-1$ binary-production nodes. This is the Chomsky-normal-form derivation length.