If G = ({S}, {a}, {S -> SS), S),
then language generated by G is
| A. | L (G) = φ |
| B. | L(G) = an |
| C. | L (G) = a* |
| D. | L (G) = anban |
Answer : A Explanation : |
|
|
Option: A Explanation : Explanation will come here. Explanation will come here. Explanation will come here. Explanation will come here. Explanation will come here. |
