Generating Context-Free-Grammar (TOC Basics)

Question

The question states:

Give a context-free grammar that generates the language A = {a^i b^j c^k | i=j or j=k where i,j,k >= 0} Is the grammar ambiguous? Why or why not? [Intro. to TOC Sipser 2.10]

The book doesn't have too many good examples on how to generate a context free grammar merely from a description of the language.

Should I try creating a pushdown-automata and then try to convert from there? Or is there some general guideline to this thing?

Answer 1

Just go here and try to guess if your example is similar (a sarcastic hint: it's the same thing), just try to argument why it is so otherwise it will be just useless..