In C#, implement the Shift-Reduce Parser for the following grammar, and please provide comments.

Use the Shift-Reduce table that is provided below.

Shift-Reduce table

The main should display the token sequence, the full sequence of shift reduce steps, and the stack's different states as shown below.

Output:

Enter your expression: num1 + num2 * 3

-----------------------------------

Calling Lexer:

-----------------------------------

num1: id

+: +

num2: id

* : *

3: id

----------------------------------

Parsing Steps

----------------------------------

S5

R6

R4

R2

S6

S5

R6

R4

.

.

.

ACCEPT

--------------------------------

Stack

----------------------------------

0

0id5

0F3

0T2

0E1

0E1+6

0E1+6id5

.

.

.

0E1

ETTF (E id EETTFF Action Goto State id S5 S4 accept S5 8 2 3 R6 R6 9 3 10 S11 1 0 ETTF (E id EETTFF Action Goto State id S5 S4 accept S5 8 2 3 R6 R6 9 3 10 S11 1 0