Let L be any r.e. language. We know that there is an unrestricted grammar for L. Show that L can be generated by an unrestricted grammar in which the left side of every production has no terminal. Hint: provide an algorithm to convert an unrestricted grammar to the desired form.
