Space-efficient SLP-to-LZ77 conversion

Given a straight-line program with $g$ rules for a text $T [1..n]$, with high probability we can build the LZ77 parse of $T$ in $n\,\mathrm{polylog} (n)$ time and $O (g)$ space.