A complementary Gray code for binary n-tuples is one that, when all the tuples are complemented, is identical to itself; this is equiv-alent to the complement of the first half of the code being identical to the second half. We generalize the notion of complementary to <7-ary n-tuples, fixed size combinations of an n-set and permutations and, in each case, construct complementary Gray codes. We relax, as weakly as possible, the notions of complementary to cases where necessary conditions for existence are violated and construct Gray codes within the weakened definitions: these include binary n-tuples when n is odd and Lee metric <?-ary n-tuples when n is odd and q is even. Finally a lemma used in the construction for permutations offers the first known cyclic Gray code for the permutations of a particular family of multisets.