MOCK TEST compiler design

Question

Consider the given below grammar
S→ cAd
A→ bA | aA | b
If a recursive descent parser is used for string “cbababd” then number of back trackin worst case is:

Comments

ans: 10

---

why answer is 10 please explain?

---

i have same doubt

---

recursive descent parsers will never backtrack the question is wrong but for brute force method u can get 10

---

please explain 10

---

By brute force we are getting 8 right ?

---

given ans is 10

---

i also wrote the same test series check the solution i think its right we can randomly apply all the productions at one stage so that it wont match (inorder to get the worst case

---

which test series is this?

Answer 1

 

So 10 is the answer in the worst case.