Computer Sciences > GATE 2026 SET-2 > Compiler Design
Consider the canonical πΏπ
(0) parsing of the grammar below using terminals
{π,π,π} and non-terminals {π΄,π΅,πΆ,π} with π as the start symbol.
Sβπ΄πΆπ΅
Aβππ΄ | π
CβππΆ | π
Bβππ΅ | π
Which one of the following options gives the number of shift-reduce conflicts that will occur in the πΏπ (0) ACTION table?
Sβπ΄πΆπ΅
Aβππ΄ | π
CβππΆ | π
Bβππ΅ | π
Which one of the following options gives the number of shift-reduce conflicts that will occur in the πΏπ (0) ACTION table?
Correct : d
Similar Questions
Match the following according to input(from the left column) to the compiler phase(in the right column) that process it:
(P)Syntax Tree
(i)...
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 abo...
Consider the following grammar:
stmt -> if expr then else expr; stmt | Ξ΅
expr -> term relop term | term
term -> id | number
id -> a | b | c
number -> [...
Total Unique Visitors
Loading......