In the case of context-free grammars, this is usually circumvented by casting the rules in binary form prior to epsilon rule elimination.
this is not possible in our case, since SCFGs do not allow normal forms with a constant bound on the length of the right-hand side of each component.