What language generated by the following context-free grammar1) S------> SaS | bi already know the answer to question one but to prove it would is be something like this:  S -----> SaaS  -----> baab    which can also be express as the language b(ab)* or (ba)*bAnother question is what does | b mean does it mean substitute into S afterwards? 2) S ----> AAA----> aA | Aa | bSo for this question how can i start this? Would it be like S----> AA ----> aAaA ----> aAaAaA -----> abababa ? SO the language would be (ab)*?
Finding the language generated for CFG
formal languages;context free