390 views

1 Answer

7 votes
7 votes
Answer is  :3

S-->aB         S-->aaB      (if we use this production  B-->aB)    S-->aaEps  (if we use this production  B-->Eps)   (Backtrack)

S-->aB         S-->aEps     (if we use this production  B-->Eps)   (Backtrack)

S-->aAb        S-->abAbb   (if we use this production)   A-->bAb  (Backtrack)

S-->aAb        S-->aab       (if we use this production A-->a)   (Finally No Backtracking Here)

Related questions

0 votes
0 votes
0 answers
2
aashijn asked Apr 28, 2022
1,331 views
employee (person-name, street, city)works (person-name, company-name, salary)company (company-name, city)manages (person-name, manager-name) a. Find the names of all empl...
1 votes
1 votes
2 answers
3
mk_007 asked Oct 2, 2021
253 views
14.Show that the grammar S → aSb |SS| e is ambiguous, but that the language denoted by it is not.Can someone share the approach for second part.
0 votes
0 votes
1 answer
4
Pradeep A asked Jun 9, 2018
195 views
If the set has a finite # of elements, prove that if f maps S onto S1 then which of the following is false??(a) f is 1-1(b) f is onto(c) f is bijection(d) f is onto and n...