An Active Context-Free Game is a game with two players (Romeo and Juliet) on strings over a finite alphabet. In each move, Juliet selects a position of the current word and Romeo rewrites the corresponding letter according to a rule of a context-free grammar. Juliet wins if a string of the regular target language is reached. The complexity of deciding the existence of winning strategies for Juliet is investigated, depending on properties of the grammar, of the target language, and on restrictions on the strategy.