No, an unrestricted grammar cannot have a rule with only terminals on the left-hand side. In formal grammar, a production rule is written in the form of:
α → β
where α and β are strings of symbols, and α contains at least one nonterminal symbol. By definition, an unrestricted grammar (also known as a Type 0 grammar) has no constraints on the form of its production rules except for this basic requirement.
Terminal symbols are the basic symbols in a language, from which the language's strings are constructed. In contrast, nonterminal symbols are used to define the structure of the language and are replaced by other symbols (both terminal and nonterminal) during the derivation process.
If a rule has only terminals on the left-hand side, it would violate the fundamental requirement for at least one nonterminal symbol in α. Such a rule would not make sense in the context of formal grammars, as there would be no way to replace the terminal symbols on the left-hand side and derive strings from them.
- Chomsky, N. (1956). Three models for the description of language. IRE Transactions on information theory, 2(3), 113-124.
- Hopcroft, J. E., Motwani, R., & Ullman, J. D. (2006). Introduction to automata theory, languages, and computation (3rd ed.). Pearson/Addison-Wesley.