Computer Sciences > GATE 2023 > Compiler Design
Consider the syntax directed translation given by the following grammar and semantic rules. Here N, I, F and B are non-terminals. N is the starting non-terminal, and #, 0 and 1 are lexical tokens corresponding to input letters "#", "0" and "1", respectively. X.val denotes the synthesized attribute (a numeric value) associated with a non-terminal X. I1 and F1 denote occurrences of I and F on the right hand side of a production, respectively. For the tokens 0 and 1, 0.val = 0 and 1.val = 1.
The value computed by the translation scheme for the input string 10#011 is _______. (Rounded off to three decimal places)
Correct : 2.875
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......