Consider the grammar given below:

S → Aa

A → BD

B → b | ε

D → d | ε

Let a, b, d, and $ be indexed as follows:
Compute the FOLLOW set of the non-terminal B and write the index values for the symbols in the FOLLOW set in the descending order. (For example, if the FOLLOW set is {a, b, d, $}, then the answer should be 3210)

Which one of the following kinds of derivation is used by LR parsers?

Consider the augmented grammar given below :

S' → S
S → 〈L〉 | id
L → L,S | S

Let I₀ = CLOSURE ({[S' → ●S]}). The number of items in the set GOTO (I₀ , 〈 ) is: _____.

Which of the following protocol pairs can be used to send and retrieve e-mails (in that order)?