1)
Create a grammar that defines the language {a^nb^n}, where “a^n”and “b^n” are “a to the n” and “b to the n”, respectively.
2) Consider the following grammar:
<S> -> a<S>c<B>|<A>|b
<A> -> c<A>|c
<B> -> d|<A>
Which of the following strings are in the language generated bythis grammar?
a. abcd
b. acccbd
c. acccbcc
d. acd
e. accc
Expert Answer
An answer will be send to you shortly. . . . .