Consider the following grammar for Pascal variable declarations:. -> VAR -> SEM | -> COLON ID -> COMMA ID | IDIndicate any problems in this grammar that prevent it from being parsed by a recursive-descent parser with one token lookahead. Transform this grammar into a form that can be parsed with a recursive-descent parser with one token lookahead. Make as few changes to the grammar as possible. Do not use Extended BNF.