title: Is it possible to have a production with one or more terminal(s) in the LHS of a recursively enumerable language?
body: <p>As Recursively enumerable grammar is unrestricted, is it possible to have a production with one or more terminal(s) in the LHS (ie no non-terminals)?</p>