S c Ac S BA A a A E B b BE Consider the following grammar with FIRST and FOLLOW sets. FIRST(S) = {,c} FIRST(A) {, a} FIRST(B) = {e, b} {$} FOLLOW(S) FOLLOW (A) = {$,c} FOLLOW(B) = {$, a} = Write the parse_S() function of a predictive recursive descent parser for the grammar. Print out the production rule after successfully parsing the rule (as in the homework). You can assume that the functions get Token (), unget Token (), and syntax_error() are available. You only need to write the parse function for S and you can assume that the parse functions for the other non-terminals are available.