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....

We need to Computer the FIRST(A), FIRST(B), FIRST(C), FOLLOW(A), FOLLOW(B), FOLLOW(C)

Any help is deeply appreciated!!

FIRST and FOLLOW Sets Question 1 [20 points] Consider the following context-free grammar [6/201 Compute FIRST(A), FIRST(B), FIRST(C) 19/201 Compute FOLLOW(A), FOLLOW(B), FOLLOW(C)