Question

I have below questions with answer! what if we get different question:

Write a CFG without empty rules that generates the language:
L = strings from (a ∪ b)*c* where the number of a's
and b's together is equal to the number of c's.

Answer:
S → Asc | ε
A → a | b

==================================================

Write a CFG without empty rules that generates the language:
L = strings from (ab ∪ cb)*c* where the number of a's
and b's together is equal to the number of c's.

Answer 1

Always it is easy to construct a grammar if you imagine the basic strings [LEAST LENGTH STRINGS] produced by the grammar and then proceed.