  We study the concept of a code (or shift) space for a generalized iterated
function system (GIFS in short). We prove that relations between GIFSs and
their code spaces are analogous to the case of classical IFSs. As an
application, we consider the problem of connectedness of attractors of GIFSs.
Many of our results are strengthenings of the ones proved recently by Mihail,
Miculescu and Secelean, but some are completely new.
