Consider the grammar

S A | B

A a A b | c

B b B | b

Write a recursive descent parser for this grammar. You can assume that the function parse_B() is already written for you. You only need to write parse_S() and parse_A().

I encourage you to try to write a complete parser in C++ and to execute it on a number of inputs to get a better understanding of recursive descent parsers, but that is not required and for the homework solution I only need the two functions parse_S() and parse_A().