Compiler Problem

Question

Comments

A grammar is both left and right recursive means $A \rightarrow AbA$ (or)

$S \rightarrow SaA$
$A \rightarrow bA|a$

???

---

First one for sure.I guess you can see its ambiguous

I think second one too both left and right recursive.

---

Well, then Option (1) is false.

$S \rightarrow SaA$
$A \rightarrow bA$

Above grammar is both Left and right recursive, but not ambiguous.

---

How...first make both S and A terminate.