Compiler Design...

Consider the following grammar:

S → XYZ

Y.val  = X.val

Y.val = S.val

Y.val = Z.val

Above grammar is

Which of the following statement is false?

Consider the grammar with the following translation rules and X as the start symbol.

X -> X₁* Y      {X.value = X₁.value * Y.value}

X -> Y              {X.value = Y.value}

Y -> Y₁- Z       {Y.value = Y₁.value - Z.value}

Y -> Z              {Y.value = Z.value}

Z -> digit          {Z.value = digit.value}

Which of the following statement is/are true?

I. Every L-attributed definition is S-attributed

II. Every S-attributed definition is L-attributed

III. Both L-attributed and S-attributed can be used interchangeably

Consider the following grammar:
S → pAS | r
A → q

Find the number of reduction steps taken by a bottom-up parser while accepting the string "pqpqpqpqr"?

Le the two productions be P → CD and P → AB. Consider the following rules.

Rule 1: P.i = C.i + D.i and C.i = D.i - 1

Rule 2: A.i = P.i * 2 and  B.i = A.i + P.i

Each of the five non-terminals P, A, B, C, and D has two attributes: s is a synthesized attribute, and i is an inherited attribute. 

Consider the below-given Syntax Directed Translation Scheme

B → aBA          print(“^”);

B → a               print(“$”);

A → b              print(“#”);

What is the output printed by a bottom-up parser, for the input aaaabbb?