Grammar to DFA Construction

Question

For the given Grammar

S->aA|bB

A->bC|aS

B->aC|bS

C->aB|bA

 

Construct DFA I am getting confused in understanding how to take the final state.

Comments

can you generate any string by using this grammer???.there is no any terminal symbol.

---

a and b are terminal symbols but yes this is the grammar given,it is a test series question.I know generally this forum doesn't entertain test series questions,but I want to clear misconceptions.

---

The language generated by a grammar may be infinite. But string generated by a grammar should always be of finite length.

 

---

So is the question wrong cause it is supposed to check if grammar generates even number of a's or b's

---

Yes.

This is not the grammar generating even no. of a's and b's..it is not halting. :/

---

It is a test series question :)p  but I wanted to clarify for conceptual clarity.Super Thanks.

Answer 1

w:aaaabbbbaaaa

for any random string if the given grammar generate it,then we definitely can draw DFA,otherwise not.

and since the grammar doesnot have any terminating condition ,therefore,it is not possible.