1- Given the production:

S-> aSAb | Ab

A-> bbb

implement a complete pseudocode for a recursive descent parser. Assume scanner()

returns the next token.

2-

Given the production:

S-> aSAc | Acb

A-> bbb| empty

implement a complete pseudocode for a recursive descent parser. Assume scanner()

function returns the next token and error() aborting processing with an error

message. Do not forget the main program. This grammar is LL(1) so no need to check

nor modify.