Chapter 4, Problem 14RQ

Explanation of Solution

Recursive-descent parsing subprogram is written for a rule with a single RHS:

A recursive descent parser contains a set of recursive subprograms which produces a parse tree. Syntax of nested structures in a language (certain control structures, parenthesis) are described with the help of recursive grammar rules.

• Each subprogram is written for each corresponding to a non- terminal in the grammar.
• The subprogram corresponding to a particular non terminal scans the input string and builds a parse tree with root as that non terminal and leaves matching the input string.
• Each subprogram should act as a parser for the set of strings which are generated by its corresponding non terminal...