Peter Linz Doubt Grammars

Question

Find grammar for the language on $\sum$={a}

L={w | |w|  mod 3>0}

is this correct?

S->aA

A->aB | $\varepsilon$

B->aS | $\varepsilon$

Comments

yes, correct

---

yes it is correct

It yields L = {a,aa, aaaa , aaaaa ,….} for W or | W | mod3 > 0 for alphabet = {a}