For the sake of presentational convenience, the above describes a construction working on the complete grammar.
our implementation applies the construction separately for each nonterminal in a set Ni such that recursive(Ni) = self, which leads to a separate subautomaton of the compact representation (Section 3).