# A function that maps a context-free grammar G to the context-free grammar G′ [closed]

So i'm really lost on this exercise:

Let f be the function that maps a context-free grammar G = (V,Σ,S,P) to the context-free grammar G′ = (V,Σ ∪{a},S,P′), where P′ = P ∪{S →SS}∪{X →a |X → ∈P}.

Give f(G1) for the context-free grammar G1 that consists of the rules: S →SB |AB A →a B →BB

Is G1 ∈ CFG-Empty? Is f(G1) ∈CFG-Finite?

Give f(G2) for the context-free grammar G2 that consists of the rules: S →EF E →E | ε F →E |b

s G2 ∈ CFG-Empty? Is f(G2) ∈ CFG-Finite?

if anybody can help me even only a little bit i would be so thankful.

New contributor
green_rice is a new contributor to this site. Take care in asking for clarification, commenting, and answering. Check out our Code of Conduct.
• Please formulate a specific question of your own regarding this problem and state it in the title. Nov 26 at 9:27
• Please credit the original source of all copied material: cs.stackexchange.com/help/referencing
– D.W.
Nov 26 at 23:12