GATE Computer Science (CS) 2022 Shift 1 Solved Paper

Consider the following grammar along with translation rules.
S → S₁ # T         {S_1.val*T_.val}
S → T                 {S_.val = T_.val}
T → T₁%R          {T_.val = T_1.val ÷ R_.val}
T → R                 {T_.val = R_.val}
R → id                 {R_.val = id_.val}
Here # and % are operators and id is a token that represents an integer and id_•val  represents the corresponding integer value. The set of non-terminals is {S, T, R, P} and a subscripted non-terminal indicates an instance of the non-terminal.
Using this translation scheme, the computed value of S_•val  for root of the parse tree for the expression 20#10%5#8%2%2 is _____________.