For any string $𝑤$, we can define a representable grammar $\lceil 𝑤\rceil$ which matches exactly the string $𝑤$ and nothing else. The parse trees for a representable grammar are proofs that the string is exactly equal to $𝑤$: