GATE 2011 CS (CS1) – Question 37

Compiler Design · Parsing and Syntax Analysis · 2 marks · Multiple choice

Binary operator ↓ has lower precedence than ↑. Operator ↑ is right-associative and ↓ left-associative. Which displayed parse tree represents 7↓3↑4↑3↓2?

Diagram for GATE 2011 CS (CS1) question 37

Tree A
Tree B
Tree C
Tree D

Practise this question in The GATE Grind →

Show answer and explanation

Correct answer: (B) Tree B

Explanation

First group the higher-precedence right-associative portion as 3↑(4↑3). Then left-associate the lower-precedence operators: (7↓(3↑(4↑3)))↓2. Its root is ↓ with right leaf two; the left child is ↓ joining seven to that nested ↑ tree. This is B.

More Parsing and Syntax Analysis questions

GATE 2010 CS (CS1) Q48 – For the grammar S→aSa bSb c, which classification holds?
GATE 2015 CS (CS3) Q15 – Among SLR, canonical LR and LALR, select the method easiest to implement followed by the…
GATE 2015 CS (CS3) Q65 – Grammar G has S→F H, F→p c, H→d c. S1: LL(1) can parse every string using grammar G. S2:…
GATE 2021 CS (CS2) Q61 – The augmented grammar is S′→S; S→S#cS SS S@ <S> a b c, with #,@,<,>,a,b,c terminals. Let…
GATE 2026 CS (CS1) Q28 – Which of the following statements is/are true?
GATE 2026 CS (CS2) Q41 – Consider canonical LR(0) parsing of the grammar below using terminals \a,b,c\ and…

All Parsing and Syntax Analysis questions →