I already posted this question but somehow the answers are always wrong, I will try to explain a litle bit better

the word is golo ( l is a lowercase L)

as Z K and N are positive integers:

the minimum word acepted is:

1 g - 4 o - 2 l - 1 o = goooollo

the letter l only acepts pair numbers

the first "o" must be 3 times the last "o" + 1

Test Cases:

goooollo PASS

ggoooollllo PASS

ggooooooolllloo PASS

ggggoooooooooolllooo FAIL

ggggooooooooollllooo FAIL

ggggoooooooooolllloo FAIL

gggooooooolllllloo PASS

Write a context free grammar that recognizes all sequences in the given form (gzo3k+12nOk) where z,k, and n are positive integers