Do question 5

4. [25 points] Write a method of a recursive descent parser for ONE of the following BNF productions. You may write the method in Java, C++ or pseudo code. Assume there is a global list or array of Token objects called tokens and an integer curtok that is an index into tokens for the next token. 1. cmte [name] [name memberlist] 2. memberlist + member member memberlist 3. member name cmte where gerbil is the root non-terminal symbol. "[", "1" and "name" are terminal symbols. What is the number of the one BNF production you are implementing? 5. [10 points] Give TWO strings of four or more symbols that are in the language above in question 4. Use robin, crow, wren and eagle for names as needed. 4. [25 points] Write a method of a recursive descent parser for ONE of the following BNF productions. You may write the method in Java, C++ or pseudo code. Assume there is a global list or array of Token objects called tokens and an integer curtok that is an index into tokens for the next token. 1. cmte [name] [name memberlist] 2. memberlist + member member memberlist 3. member name cmte where gerbil is the root non-terminal symbol. "[", "1" and "name" are terminal symbols. What is the number of the one BNF production you are implementing? 5. [10 points] Give TWO strings of four or more symbols that are in the language above in question 4. Use robin, crow, wren and eagle for names as needed