The static or axiomatic view of grammar delimits valid linguistic structures by means of general well-formedness principles. In Duchier and Thater (1999), it is shown that Constraint Programming can be used to provide a transparent encoding of parsing with a static, description based grammar. In this paper, we show that modulo some minor changes, the same program can also be used for generation. Furthermore, we argue that the resulting algorithm constitutes an interesting alternative to the existing top-down, bottom-up and head-driven approaches usually pursued in tactical generation.