Automata Grammar Language

Question

What is the relationship between a Language -to- Grammar and a Grammar -to -Language .Give an example for both.

A. One -to- Many

B. One -to- One

C. Many -to- One 

D. Many to- Many

Answer 1

B) One to one

L={∈,ab,a²b²,a³b³,.............aⁿbⁿ}

Grammar for it

S->aSb|∊

So, for ab we can generate like this S->aSb -> ab

So, each one has a one way derivation

Comments

I am not asking for one perticular grammar .i am asking it in general terms if any lang is given and a grammar is given whether  it is corresponding to it or not.

and out of 4 options answer should be 2 options one is for Language -to- Grammar and another one for Grammar -to -Language.

---

One to many

For a language grammar is not unique but each grammar generate unique language...

Answer 2

language to the grammer is straight forward -> ONE TO ONE 

but for grammer to language -> MANY TO ONE 

 bcz we can derive many grammers for a lanuage like (TYPE-3,TYPE-2,TYPE-1.........)