We propose to attack this problem using chart-parsing algorithms developed for mildly contextsensitive grammar formalisms.
for a grammar G extracted by our technique, the number f equals the maximal block-degree per node.