Disclaimer: I'm a total newbie in a given topic, so my apologies in advance if I formulated the question not clearly or ambiguously.
Let's consider the grammar G = (N, T, P, S) with character A ∈ T.
Is it possible to build such set of rules P that any string generated by G contains exactly one character A at any position? Can you give an example of that grammar? G should be able to generate multiple multicharacter strings from N.