Your language consists of all words over $\{a,b\}$ which contain $a$. This is a regular language, and so it has a regular grammar, which is not so difficult to construct for this language. Regular grammars are unambiguous, so this would be an unambiguous grammar for the same language.
Yuval Filmus
- 279.1k
- 27
- 316
- 512