We consider conditional context-free grammars that generate languages of finite index. Thereby, we solve an open problem stated in Dassow and Păun's monograph on regulated rewriting. Moreover, we show that conditional context-free languages with context-free conditions of finite index are more powerful than conditional context-free languages with regular conditions of finite index. Furthermore, we study the complexity of membership and non-emptiness for conditional and programmed languages respectively grammars (of finite index) with regular, linear, and context-free core rules and conditions.