Aptitude | GATE CS 1998 | Question 61

Consider the grammar

S →  Aa | b
A → Ac | Sd | ε

Construct an equivalent grammar with no left recursion and with minimum number of production rules.


Answer:

Explanation:

Quiz of this Question
Please comment below if you find anything wrong in the above post



My Personal Notes arrow_drop_up