Question 1 (a) For each of the following grammars, precisely describe the langua

Question

Question 1

(a) For each of the following grammars, precisely describe the language generated by the grammar. The set of terminals T is {a, b} unless another set is specified.

1.

S A | B

A aaaA |

B Bbb | b

2.

S RbR

R aRb | bRa | RR | bR |

3.

             S aSbSaS | aSaSbS | bSaSaS |

4.

Set of terminals here is T = {a, b, c}                                                             

S a S b | C

C cc C |

(b) Using the grammar in Part 2 above, give a derivation for the string abbabb. Give your derivation in three different forms: a derivation tree, a left-most derivation and a right-most derivation

Explanation / Answer

3)

Related Questions

Navigate

• Browse (All)
• Browse Q
• Subjects

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.