Consider the following grammar: S → ABSc | Abc BA → AB Bb → bb Ab → ab Aa → aa…
Consider the following grammar:
S → ABSc | Abc
BA → AB
Bb → bb
Ab → ab
Aa → aa
The language generated by the above grammar is the set of all strings made up of a, b, c such that
- A.
The number of a's, b's, and c's will be equal but the order of occurrence is not fixed
- B.
The number of a's is twice the number of b's and equal to that of c's
- C.
The number of a's is equal to the number of b's and b's always precede c's
- D.
The number of a's, b's, and c's are the same and the a's precede b's, which precede c's
Attempted by 76 students.
Sign up free to check your answer
Sign up freeLoading lesson…