  This paper is a continuation of the study of topological properties of omega
context free languages (omega-CFL). We proved before that the class of
omega-CFL exhausts the hierarchy of Borel sets of finite rank, and that there
exist some omega-CFL which are analytic but non Borel sets. We prove here that
there exist some omega context free languages which are Borel sets of infinite
(but not finite) rank, giving additional answer to questions of Lescow and
Thomas [Logical Specifications of Infinite Computations, In:"A Decade of
Concurrency", Springer LNCS 803 (1994), 583-621].
