Construct the SLR Parsing table for the following grammar. Also, Parse the input string a * b + a.

Description − Consider the Grammar

E → E + T|T

T → TF|F

F → F*|a|b.

Solution

Step1 − Construct the augmented grammar and number the productions.

(0) E′ → E

(1) E → E + T

(2) E → T

(3) T → TF

(4) T → F

(5) F → F ∗

(6) F → a

(7) F → b.

Step2 − Find closure & goto Functions to construct LR (0) items.

Box represents the New states, and the circle represents the Repeating State.

Computation of FOLLOW

We can find out

FOLLOW(E) = {+, $}

FOLLOW(T) = {+, a, b, $}

FOLLOW(F) = {+,*, a, b, $}

Parsing for Input String a * b + a −