please provide good explanation.

Consider the following grammar for variable and class declarations in Java:

  ->  |  

  ->    SEM 

  ->  CLASS ID LBRACE  RBRACE 

  ->  |   

  -> ID | ID ASSIGN  

 |  COMMA ID |  COMMA ID ASSIGN  

Indicate any problems in this grammar that prevent it from being parsed by a recursive-descent parser with one token lookahead. You can simply circle the offending parts of the grammar above.

Transform the rules for and so they can be parsed by a recursive-descent parser with one token lookahead (you dont need to transform the rules for ). I.e., remove any left-recursion and left-factor the grammar. Make as few changes to the grammar as possible, but do not use Extended BNF. The nonterminals and of the modified grammar should describe the same language as the original nonterminals.

3. (25 pts) Consider the following grammar for variable and class declarations in Java: - SEM -> RBRACE ->ID ID ASSIGN | COMMA ID ASSIGN Indicate any problems in this grammar that prevent it from being parsed by a recursive-descent parser with one token lookahead. You can simply circle the offending parts of the grammar above. Transform the rules for and so they can be parsed by a recursive-descent parser with one token lookahead (you don't need to transform the rules for ). Le., remove any left-recursion and left-factor the grammar. Make as few changes to the grammar as possible, but do not use Extended BNF. The nonterminals and of the modified grammar should describe the same language as the original nonterminals