Compiler Design — GATE Previous Year Questions

The number of tokens in the following C statement is:

printf("i = %d, &i = %x", i, &i);

Consider the grammar

S → ( S ) | a

Let the number of states in the SLR(1), LR(1) and LALR(1) parsers for the grammar be \(n_1\), \(n_2\) and \(n_3\) respectively. Which one of the following relationships holds good?

Which one of the following is FALSE?

Match the following:

Consider the following code segment:

x = u - t;
y = x * v;
x = y + w;
y = t - z;
y = x * y;

The minimum number of total variables required to convert the above code segment to static single assignment form is ______.

The attributes of three arithmetic operators in some programming language are given below.

The value of the expression 2 − 5 + 1 − 7 * 3 in this language is ______.

Consider the following grammar:

P → x Q R S
Q → y z | z
R → w | ε
S → y

What is FOLLOW(Q)?

Consider the following intermediate program in three address code:

p = a - b
q = p * c
p = u * v
q = p + q

Which one of the following corresponds to a static single assignment form of the above code?

Consider the grammar given below:

S → a S B | d
B → b

The number of reduction steps taken by a bottom-up parser while accepting the string aaadbbb is ______.

Consider the following statements.

S1: Every SLR(1) grammar is unambiguous but there are certain unambiguous grammars that are not SLR(1).

S2: For any context-free grammar, there is a parser that takes at most \(O(n^3)\) time to parse a string of length \(n\).

Which one of the following options is correct?