## Discussion Forum

Que. | A CFG G is given with the following productions where S is the start symbol, A is a non-terminal and a and b are terminals.
S→aS∣A A→aAb∣bAa∣ϵ For the correct answer in Q75, how many steps are required to derive the string and how many parse trees are there? |

a. | 6 and 1 |

b. | 6 and 2 |

c. | 7 and 2 |

d. | 4 and 2 |

Answer:6 and 1 |