Consider the following SDT-S- ABS-x -A-x- B-y-A-yA- aAA-x -A1-x-A-y-A1-yA- bA-x -A-B-y-a-1B- cB-x -c-B-y-c-1Above SDT is-

You visited us 1 times! Enjoying our articles? Unlock Full Access!

Blood Donation and Blood Banks

Consider the ...

Question

Consider the following SDT.

$S \to A B {S . x = A . x; B . y = A . y}$
$A \to a A {A . x = A_{1} . x; A . y = A_{1} . y}$
$A \to b {A . x = A; B . y = a + 1}$
$B \to c {B . x = c; B . y = c + 1}$

Above SDT is______.

L-attributed grammar only

Right on! Give the BNAT exam to get a 100% scholarship for BYJUS courses

S-attributed grammar only

No worries! We‘ve got your back. Try BYJU‘S free classes today!

None of these

No worries! We‘ve got your back. Try BYJU‘S free classes today!

Both S-attributed & L-attributed grammar

No worries! We‘ve got your back. Try BYJU‘S free classes today!

Open in App

Solution

The correct option is A L-attributed grammar only
x is synthesized attribute
y is depending on left sibling or child
So, given SDT is L-attributed.
It is not S-attributed grammar.

Suggest Corrections

Similar questions

Q. Consider the following SDT.

S \to A B {S . x = A . x; B . y = A . y}

A \to a A {A . x = A_{1} . x; A . y = A_{1} . y}

A \to b {A . x = A; B . y = a + 1}

B \to c {B . x = c; B . y = c + 1}

Above SDT is______.

For the following equation form a differential equation representing the given family of curves by eliminating arbitrary constants a and b.

$y = a e^{3 x} + b e^{- 2 x} .$

Q. Arrangement of the following areas between the curves is descending order:

A : y^{2} = 4 x, x^{2} = 4 y

B . y = x, y = x^{3}

C . y^{2} = 8 x, y = 2 x

D . y = \sqrt{x}, y = x^{2}

\int_{0}^{a} \frac{x d x}{\sqrt{a^{2} + x^{2}}} =

Q. If

A^{1 / A} = B^{1 / B} = C^{1 / C}, A^{B C} + B^{A C} + C^{A B} = 729

Which of the following equals

A^{1 / A}

Join BYJU'S Learning Program

Consider the following SDT. S→AB{S.x=A.x;B.y=A.y} A→aA{A.x=A1.x;A.y=A1.y} A→b{A.x=A;B.y=a+1} B→c{B.x=c;B.y=c+1} Above SDT is______.

The correct option is A L-attributed grammar onlyx is synthesized attribute y is depending on left sibling or child So, given SDT is L-attributed. It is not S-attributed grammar.

Consider the following SDT.

$S \to A B {S . x = A . x; B . y = A . y}$
$A \to a A {A . x = A_{1} . x; A . y = A_{1} . y}$
$A \to b {A . x = A; B . y = a + 1}$
$B \to c {B . x = c; B . y = c + 1}$

Above SDT is______.

The correct option is A L-attributed grammar only
x is synthesized attribute
y is depending on left sibling or child
So, given SDT is L-attributed.
It is not S-attributed grammar.