(Solved): Let G=({S}, {()}, P, S) be a CFG, where P contains the following rules: S-> SS|(S)S|e
1. List thr ...
Let G=({S}, {()}, P, S) be a CFG, where P contains the following rules: S-> SS|(S)S|e
1. List three different strings in L(G)
2. What is the language L(G)?