CFG for language l

Question

please solve this question.thanks

Consider the language L expressed by (a+b)*a defined over Σ = {a, b}. Draw FA and construct the CFG corresponding to the language L.

Answer 1

A context free grammar corresponding to the language $L$ is: $$S \to aS|bS|a$$

Answer 2

i am new here this is why i don't know how to post or where to write.sorry i bother you but i just want to match my answer because i was not sure about my answer.

thank you for answer.

Answer 3

Question:Consider the language L expressed by (a+b)*a defined over Σ = {a, b}. Draw FA and construct the CFG corresponding to the language L.

Solution: (a+b)*a