I want to know question number 4.

I would be grateful if you could help me with the details. I am really confused about this assignment. And please don't copy other answers to here.

3. Circle one of the following characteristics of a programming language and explain why it is best specified using a context-free grammar (instead of a regular expression). (5) Identifier length Maximum level of nesting Operator precedence Type compatibility Type conversion 4. Consider the language which consists of all strings with i a's followed by any number of c's and then i b's, where i>0. For example, accb, acccccb, and aabb are all in this language. a. Give a CFG grammar for this language. (5) b. Prove whether your grammar is LL(1) by attempting to build its predictive parse table