Consider the following expression grammar. The semantic rules for expression calculation are stated next to each grammar production. E → number E.val = number. val | E '+' E E(1).val = E(2).val + E(3).val | E '×' E E(1).val = E(2).val × E(3).val Assume the conflicts in Part (a) of this question are resolved and an LALR(1) parser is generated for parsing arithmetic expressions as per the given grammar. Consider an expression 3 × 2 + 1. What precedence and associativity properties does the generated parser realize?(A) Equal precedence and left associativity; expression is evaluated to 7(B) Equal precedence and right associativity; expression is evaluated to 9(C) Precedence of ‘×’ is higher than that of ‘+’, and both operators are left associative; expression is evaluated to 7(D) Precedence of ‘+’ is higher than that of ‘×’, and both operators are left associative; expression is evaluated to 9

Consider the following expression grammar. The semantic rules for ex

1.	Consider the following expression grammar. The semantic rules for expression calculation are stated next to each grammar production. E → number E.val = number. val \| E '+' E E(1).val = E(2).val + E(3).val \| E '×' E E(1).val = E(2).val × E(3).val Assume the conflicts in Part (a) of this question are resolved and an LALR(1) parser is generated for parsing arithmetic expressions as per the given grammar. Consider an expression 3 × 2 + 1. What precedence and associativity properties does the generated parser realize?(A) Equal precedence and left associativity; expression is evaluated to 7(B) Equal precedence and right associativity; expression is evaluated to 9(C) Precedence of ‘×’ is higher than that of ‘+’, and both operators are left associative; expression is evaluated to 7(D) Precedence of ‘+’ is higher than that of ‘×’, and both operators are left associative; expression is evaluated to 9
Answer»

Discussion

No Comment Found

Related InterviewSolutions

Consider the following floating point formatMantissa is a pure fraction in sign-magnitude form. The normalized representation for the above format is specified as follows. The mantissa has an implicit 1 preceding the binary (radix) point. Assume that only 0’s are padded in while shifting a field. The normalized representation of the above number (0.239 × 213) is:(A) 0A 20(B) 11 34(C) 4D D0(D) 4A E8
A 5 stage pipelined CPU has the following sequence of stages:IF — Instruction fetch from instruction memory,RD — Instruction decode and register read,EX — Execute: ALU operation for data and address computation,MA — Data memory access - for write access, the register read at RD stage is used,WB — Register write back.Consider the following sequence of instructions:I1 : L R0, 1oc1; R0 <= M[1oc1]I2 : A R0, R0; R0 <= R0 + R0I3 : S R2, R0; R2 <= R2 - R0Let each stage take one clock cycle.What is the number of clock cycles taken to complete the above sequence of instructions starting from the fetch of I1 ?(A) 8(B) 10(C) 12(D) 15
Suppose T(n) = 2T (n/2) + n, T(0) = T(1) = 1Which one of the following is FALSE?(A) T(n) = O(n2)(B) T(n) = θ(n log n)(C) T(n) = Ω(n2)(D) T(n) = O(n log n)
Let s and t be two vertices in a undirected graph G + (V, E) having distinct positive edge weights. Let [X, Y] be a partition of V such that s &in; X and t &in; Y. Consider the edge e having the minimum weight amongst all those edges that have one vertex in X and one vertex in YThe edge e must definitely belong to:(A) the minimum weighted spanning tree of G(B) the weighted shortest path from s to t(C) each path from s to t(D) the weighted longest path from s to t
Suppose there are ⌈ log n ⌉ sorted lists of ⌊ n/log n ⌋ elements each. The time complexity of producing a sorted list of all these elements is :(Hint : Use a heap data structure)(A) O(n log log n)(B) θ(n log n)(C) Ω(n log n)(D) Ω(n3/2)
Consider the following circuit.Which one of the following is TRUE?(A) f is independent of X(B) f is independent of Y(C) f is independent of Z(D) None of X, Y, Z is redundant
The grammar A → AA | (A) | ε is not suitable for predictive-parsing because the grammar is(A) ambiguous(B) left-recursive(C) right-recursive(D) an operator-grammar
Consider the grammarE → E + n | E × n | n For a sentence n + n × n, the handles in the right-sentential form of the reduction are(A) n, E + n and E + n × n(B) n, E + n and E + E × n(C) n, n + n and n + n × n(D) n, E + n and E × n
Consider the grammarS → (S) | aLet the number of states in SLR(1), LR(1) and LALR(1) parsers for the grammar be n1, n2 and n3 respectively. The following relationship holds good(A) n1 < n2 < n3(B) n1 = n3 < n2(C) n1 = n2 = n3(D) n1 ≥ n3 ≥ n2
Consider the following C-program:void foo(int n, int sum){int k = 0, j = 0;if (n == 0) return;k = n % 10;j = n / 10;sum = sum + k;foo (j, sum);printf ("%d,", k);}int main (){int a = 2048, sum = 0;foo (a, sum);printf ("%d\n", sum);getchar();}What does the above program print?(A) 8, 4, 0, 2, 14(B) 8, 4, 0, 2, 0(C) 2, 0, 4, 8, 14(D) 2, 0, 4, 8, 0

Discussion

No Comment Found

Related InterviewSolutions

Reply to Comment