C program to classify the type of grammar using CHOMSKY CLASSIFICATION.
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.
- Regular grammars –recognizable by the finite state automaton.