Give a grammar for a language on Σ={a,b,c} that accepts all strings containing exactly one a
$$S\rightarrow aA, bS,cS$$

$$A\rightarrow bA, cA, \epsilon$$

Note that you need at least two non-terminals for this language, since you need to differentiate two states, namely whether an $a$ has already been added/found or not.