Compiler Construction. Recursive Descent Parsing! I having a hard time with this question. Please help! The class is based on "The Dragon Book" which can be downloaded in pdf for free by just typing the title of the book. This is chapter 4 stuff, LL(1) parsing etc.... Any help is deeply appreciated!!

Recursive Descent Parsing Question 2 [16 points) Consider the following context free grammar A BCD B up C down C C open | close Dend Assume the following variables and functions already exist: token is a variable that contains the look-ahead symbol as a string. EOF is a predefined string variable that matches end-of-file. accept) is a function that accepts the next token on the input and updates token to be the next lookahead . error) is a function to signal that something went wrong and parsing has stopped. Write a recursive descent parser for this language using "Java-like" syntax (you can use "to compare strings)