Consider the following grammar:
S → pAS | r
A → q
Which of the following is/are true about the number of reduction steps taken by a bottom-up parser for the strings in option?
1
number of reductions for string "pqpqpqr" is 7.
2
number of reductions for string "pqpqpqpqr" is 9.
3
number of reductions for string "pqpqpqpqr" is 8.
4
number of reductions for string "pqpqpqr" is 8.