Unary rules of the form N i → N j can form cycles, leading to infinite unary chains with infinite mass.
it is standard in the parsing literature to transform grammars into a restricted class of CFGs so as to permit efficient parsing.