Question

Identify type of grammer:-

S-> a | $\epsilon$

1. TYPE 0

2. TYPE 1

3. TYPE 2

4. TYPE 3

Comments

All.

---

 Rishabh Gupta

 in the case of type 1 grammar (CSL)....

let x->y ^....   x,y-> (v+t)⁺

and

length(x)<=length(y) ...???

not type 1...

---

this constraint is relaxed for starting symbol untill and unless that starting symbol not used elsewhere in the grammar on the right hand side.

---

All are correct, but here if you have to choose strongest answer, then answer would be Type - 3 grammer.

Answer 1

type 3 or regular grammar