# (partly) Space-efficient tabulation for 3-dim nonterminals

The solution for the subword triple $(i..j,k..l,m..n)$ is stored at $M[adr(i,j),adr(k,l),adr(m,n)]$ where $M$ is a three-dimensional matrix of size $(|w|+1)\cdot(|w|+2) / 2$ in all dimensions, and $adr(i,j) = i + (j\cdot(j+1)) \div 2$. Similar to the two-dimensional case space loss is caused by overlapping subwords.

**Hint**: Rotate and zoom with your left mouse button and scroll wheel!

Delay:
(try 0!)

(note: doesn't affect a running animation)
Word length: