In this paper, we show that one benefit of FUG, the ability to state global conslralnts on choice separately from syntactic rules, is difficultin generation systems based on augmented context free grammars (., Def'mite Clause Cn'anmm~). They require that such constraints be expressed locally as part of syntactic rules and therefore,duplicated in the grammar. Finally, we discuss a reimplementation of l U g that achieves the similar levels of efficiency as Rubinoff's adaptation of M U M B L E , a detcrministc language generator. .
