Question
What is meant by context-sensitive grammar in Theory of Automata and Formal Languages?
Correct Answer: D
a grammar whose productions do not decrease string length, except limited start-symbol epsilon cases
The correct answer is a grammar whose productions do not decrease string length, except limited start-symbol epsilon cases.
The correct answer is a grammar whose productions do not decrease string length, except limited start-symbol epsilon cases.
Leave a Reply