Consider the following grammar.

S $$ \to $$ aSB| d
B $$ \to $$ b

The number of reduction steps taken by a bottom-up parser while accepting the string aaadbbb is _______.

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?

Match the following:

GROUP - 1	GROUP - 2
(P) Lexical analysis	(i) Leftmost derivation
(Q) Top down parsing	(ii) Type checking
(R) Semantic analysis	(iii) Regular expressions
(S) Runtime environments	(iv) Activation records