## Discussion Forum

Que. | Let G = ({S}, {a, b} R, S) be a context free grammar where the rule set R is S → a S b | SS | ε . Which of the following statements is true? |

a. | G is not ambiguous |

b. | There exist x, y, ∈ L (G) such that xy ∉ L(G) |

c. | There is a deterministic pushdown automaton that accepts L(G) |

d. | We can find a deterministic finite state automaton that accepts L(G) |

Answer:There is a deterministic pushdown automaton that accepts L(G) |