Consider the grammar defined by the following production rules- with two operators - and -S- T-PT- U-T-UP- Q-P-QQ- IdU- IdWhich one of the following is TRUE-

S→ T*P T→ U|T*U P→ Q+P|Q Q→ Id U→ Id ...

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

Byju's Answer

Standard XII

Mathematics

Binary Operation

Consider the ...

Question

Consider the grammar defined by the following production rules, with two operators * and +
$S \to T * P$
$T \to U | T * U$
$P \to Q + P | Q$
$Q \to I d$
$U \to I d$
Which one of the following is TRUE?

+ is left associative, while * is right associative

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

+ is right associative, while * is left associative

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

Both + and * are right associative

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

Both + and * are left associative

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

Open in App

Solution

The correct option is B + is right associative, while * is left associative
$S \to T * P$
$T \to U | T * U$
$P \to Q + P | Q$
$Q \to I d$
$U \to I d$

Suggest Corrections

Similar questions

Q. Which of the following grammar rules violate the requirements of an operator grammar?
P, Q, R are non terminals and r, s, t are terminals.

(i)

P \to Q R

(ii)

P \to Q s R

(iii)

P \to ε

(iv)

P \to Q t R r

Q. Consider the following grammer:
E

\to

E(T)|T
T

\to

T * F/id
F

\to

(id)

Which of the following can be the correct handle in bottom up parsing for the above grammar?

f

and

h

are relations from

A \to B

where

A = {a, b, c, d}

;

B = {s, t, u}

defined as follows:

f (a) = t, f (b) = s, f (c) = s, f (d) = u

;

h (a) = s, h (b) = t, h (c) = s, h (a) = u, h (d) = u

Which one of the following statement is true?

Q. Consider the CFG with {S, A, B} as the non-terminal alphabet, {a, b} as the terminal alphabet, S as the start symbol and the following set of production rules

$S \to b A$	$S \to a B$
$A \to a$	$B \to b$
$A \to a S$	$B \to b S$
$A \to b A A$	$B \to a B B$

Which of the following string is generated by the grammar?

Q. The binary operator

\neq

is defined by the following truth table.

p	q	$p \neq q$
0	0	0
0	1	1
1	0	1
1	1	0

Which one of the following is true about the binary operator

\neq

Join BYJU'S Learning Program

Consider the grammar defined by the following production rules, with two operators * and + S→T∗P T→U|T∗U P→Q+P|Q Q→Id U→Id Which one of the following is TRUE?

The correct option is B + is right associative, while * is left associativeS→T∗P T→U|T∗U P→Q+P|Q Q→Id U→Id

Consider the grammar defined by the following production rules, with two operators * and +
$S \to T * P$
$T \to U | T * U$
$P \to Q + P | Q$
$Q \to I d$
$U \to I d$
Which one of the following is TRUE?

The correct option is B + is right associative, while * is left associative
$S \to T * P$
$T \to U | T * U$
$P \to Q + P | Q$
$Q \to I d$
$U \to I d$