Time Left - 15:00 mins
GATE CS 2022: Compiler Design-2 (App update required to attempt this test)
Attempt now to get your rank among 271 students!
Question 1
Which one of the following is a top-down parser?
Question 2
Which of the following sufficient to convert an arbitrary CFG to an LL(1) grammar?
Question 3
S → Xx
X → xX | d
The above grammar is
X → xX | d
The above grammar is
Question 4
Considering the following grammar
S → iEtS |iEtSeS|a
E → b
Then after left factoring we get _________
S → iEtS |iEtSeS|a
E → b
Then after left factoring we get _________
Question 5
Consider following grammar :
S → S + A | A
A → D – A | D
D → D * B | B
B → num
The number of internal nodes for the parse tree for 5 * 4 + 10 * 6 – 7 – 8 _________
Question 6
Consider the following 3-address code.
t1 = a + b
t2 = c + d
t3 = t1 * t2
t4 = t2 + t2
t5 = t4 + t3
There are 5 temporary variables in above code. What is the minimum number of temporary variables can be used in the equivalent optimized 3-address code of above code?
- 271 attempts
- 2 upvotes
- 1 comment
Jun 3GATE & PSU CS