Parsing

1) When implementing a "recursive descent parser", explain the approach to program the rule "N -> t" - Where N is a non terminal, and t is a terminal.

1 b) Using the given grammar. Explain the process for the implementation of a top down parser or LL parser.

S -> S a | b B | a A

A -> b

B -> end