On translating the expression given below into quadruple representation, how many operations are required? (i*j)+(e+f)*(a*b+c)
Pick an option to check yourself, or open the answer below.
Show answer & explanation
Correct answer: B. 6
Explanation
t1 = i*j, t2 = e+f, t3 = a*b, t4 = t3+c, t5 = t2*t4, t6 = t1+t5: six quadruples.
More Theory of Computation and Compilers questions
- Replacing the expression by 8.56 is known as
- Shift-reduce parser consists of (a) input buffer (b) stack (c) parse table
- How many states are there in a minimum state automata equivalent to regular expression given below? a * b(a + b) Regular expression is
- Match List I with List II, where L1 is regular, L2 context-free, L3 recursive and L4 recursively enumerable. List I: (a) complement(L3) ∪ L…
- How can the decision algorithm be constructed L for deciding whether context-free language is finite? CFGG (a) By constructing redundant in…
- Consider the following grammar : S → XY X → Y aY ∣ a and Y → bbX Which of the following statements is/are true about the above grammar? (a)…