Explain types of grammar in system programming
Answers
Answered by
0
Most famous classification of grammars and languages introduced by Noam Chomsky is divided into four classes: Recursively enumerable grammars –recognizable by a Turing machine. Context-sensitive grammars –recognizable by the linear bounded automaton. Context-free grammars - recognizable by the pushdown automaton.
.
.
.
#SahilRC
.
.
.
#SahilRC
Similar questions
Social Sciences,
8 months ago
Math,
8 months ago