Construct an NPDA that will accept the language generated by thegrammar G= ({S,A}, {a,b}, S, P),
with productions S → AA | a, A→ SA | b.
1. Describe how you approached this solution
2. JFlap NPDA with at least 10 test cases.
Expert Answer
An answer will be send to you shortly. . . . .