4) Consider the grammar: expr := expr @ term | term term := A | B | C a) Why can this not be directly used in a recursive-descent parser? What would go wrong if it is? b) Suppose your friend suggested rewriting the production rule as: expr := term @ expr to avoid the problem you identified in (a). Is this a satisfactory way of converting the grammar for use in a recursive-descent parser? Explain your answer.