Teaching TN TRB CS Mock Test Theory of Computation Context Free Languages and Pushdown Automata Context Free Grammars
If every production is of the form α → β where |α| ≤ |β| or of the form α → λ, then the grammar is said to be of:
1
Type 1
2
Type 3
3
Type 0
4
Type 2