Chapter 2.3, Problem 33CYU

Explanation of Solution

The way in which top-down parser predict the production $\text{A}\to \text{α}$:

• One can include some string of symbols, then they can extend the domain of FIRST in the accurate manner.

$\text{A}\to \text{α}$

• The above production is said to be $\text{FIRST(α)}$
• Here, the steps explains the prediction of some set of production as follows.

  $\begin{array}{l}\text{prgm\_stmt}\to \text{stmt\_list}\text{\$\$}\\ \text{stmt\_list}\to \text{stmt}\text{stmt\_list|}\in \\ \text{stmt\_list}\to \in \\ \text{prgm\_stmt}\to \text{\$\$}\end{array}$

• The grammar explains that in a list of statements it evaluates each and every statement till the list become empty