Please solve these problem in Ocaml language and I will give you like

5 Right Recursion A grammar is right-recursive if a nonterminal A has a production A + B such that B** A. A special case is immediate right recusion, where there is a production A+ A. For example, the following grammar is right recursive because of the immediate right recursion in nonterminal A. S + A CCA BA a B + C | 6 C+ c d (a) Explain briefly why d E FOLLOW(B). (b) Suppose that, using the above grammar, S ** $1$2... Sn and $1,..., Sn are all terminals (that is, $1$2... Sn is a sentence of S). What are the possible terminals that sn could be (that is, what could be the last terminal in a sentence derived from S)? We know that left recursion causes problems in top-down parsing. Since bottom-up (LR) parsing is basically the reverse of top-down parsing, you might think that would mean we can't use right-recursive grammars in bottom-up parsing. In fact, this actually isn't a problem. Explain why in a short-ish paragraph