context free grammar

Question

Comments

To find rank grammar must be in CNF form:

Now Rank (V) = maximum path to derive a string.

here R(A) = A-> BC-> CCC->  aaa i.e. 3

R(B) = B-> CC -> aa i.e. 2

R(C) = C-> a i.e. 1

if cycle present then infinite rank will be there.

---

what is rank of A if  A-->BC  only in above rules?

how to draw variable dependency graph?

---

..............

---

How to take minimum length?

---

now check.

---

thank you sir

then is rank of S = 2?