I was trying to get an arbitrary linear language to its GNF, and I converted it into one where all the productions were of the form $A\to Ba, A\to aB, A\to a$.
In this question, the accepted answer shows a way of converting some productions of a linear grammar to the GNF. The issue would be, what about the transitions of the form $A\to Ba$? That would be the only issue for both my procedure and the one in the answer, and I don't see any general way of getting those transitions into GNF ones.
If I discard the chance I'm not seeing something evident, I guess it's not that easy to give an explicit GNF for linear languages, and it looks like it might change a lot depending on the structure of the particular language. What should I do next?