Chapter 2.3, Problem 35CYU

Explanation of Solution

Complete construction of FIRST and FOLLOW sets algorithm:

FIRST set algorithm:

• Any terminal symbol X, the FIRST() grammar will be derived as follows. x referred as production of X.

  FIRST(X) ={x}.

• Any non-terminal symbol X, follows the FIRST() grammar by using the production rules X→ x₁,x₂…x_n. This can be return as follows.

  FIRST(X)=FIRST(x₁)∪ FIRST(x₂)∪…∪FIRST(x_n).

• The FIRST() set can also uses R.H.S form to compute for both terminal and non-terminal set.

  FIRST(X₁ ) in FIRST(X₁, X₂,…X_n).

• In this situation, the X₁ is derive from all the elements in X₁, X₂,…X_n.

FOLLOW set algorithm:

• FOLLOW() set is used when the current non-terminal can derive.
  • S is the start symbol, so one can use FOLLOW(S) to start the FOLLOW() grammar.
  • “⊥” is symbol used to represent the end of input...