LetL be the language
L= {S: S is of the formA2n Bn, for somen < 0)
Thus, a string is inL if and only if it starts with a sequence of A’s and is followed by a sequence of half as many B’s. For example, AAAABB is inL, but ABBB, BAABAA, and the empty string are not.
a. Give a grammar for the languageL.
b. Write a recursive method that determines whether the stringstr is inL.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.