Consider the grammar rule. E -> E1 − E2 for arithmetic expressions. If E1 and E2 do not have any common sub expression, in order to get the shortest possible code.(a) E1 should be evaluated first(b) E2 should be evaluated first(c) Evaluation of E1 and E2 should necessarily be interleaved(d) Order of evaluation of E1 and E2 is of no consequenceI have been asked this question in an online interview.My question is from L-Attributed Definition topic in portion Syntax Directed Definition and Translations of Compiler

Consider the grammar rule. E -> E1 − E2 for arithmetic expressions.

1.	Consider the grammar rule. E -> E1 − E2 for arithmetic expressions. If E1 and E2 do not have any common sub expression, in order to get the shortest possible code.(a) E1 should be evaluated first(b) E2 should be evaluated first(c) Evaluation of E1 and E2 should necessarily be interleaved(d) Order of evaluation of E1 and E2 is of no consequenceI have been asked this question in an online interview.My question is from L-Attributed Definition topic in portion Syntax Directed Definition and Translations of Compiler
Answer» CORRECT option is (b) E2 should be evaluated first The explanation: E1 is to be KEPT in accumulator & accumulator is REQUIRED for OPERATIONS to EVALUATE E2.

Discussion

No Comment Found

Related InterviewSolutions

In which way can SAM be stored in an array?(a) char name[]=”SAM”(b) char name[6]={‘S’,’A’,’M’}(c) char name[6]={“S”,”A”,”M”}(d) char name [6]={‘S’,’A’,’M’,’\0’}The question was asked in quiz.This intriguing question comes from Array Reference in portion Syntax Directed Definition and Translations of Compiler
What will happen if in a C program you assign a value to an array element whose subscript exceeds the size of array?(a) The compiler would report an error(b) May stop working abruptly if data gets overwritten(c) None of the mentioned(d) The element will be set to 0I have been asked this question during an interview.The doubt is from Array Reference topic in division Syntax Directed Definition and Translations of Compiler
Which of the following correctly accesses the seventh element stored in tan?(a) tan[6](b) tan[7](c) tan(7)(d) tanThis question was addressed to me in final exam.I want to ask this question from Array Reference in chapter Syntax Directed Definition and Translations of Compiler
Coercion _____________(a) Takes place over an assignment operator(b) Operator has operands of various types(c) None of the mentioned(d) Takes place over an assignment operator & Operator has operands of various typesI had been asked this question in my homework.My question is taken from Implementation of Increment and Decrement topic in portion Syntax Directed Definition and Translations of Compiler
What is an example of intermediate language?(a) SNOBOL(b) PASCAL(c) COBOL(d) UNCOLI got this question in exam.I need to ask this question from SDT Schemes to Specify Translation of various Programming Language Construct topic in chapter Syntax Directed Definition and Translations of Compiler
Output file of the Lex is _________ is the input file is Sam.(a) sam(b) sam.yy.c(c) sam.lex(d) sam.objThe question was posed to me during an online interview.This key question is from Three-Address Statements topic in chapter Syntax Directed Definition and Translations of Compiler
Pick the machine independent phase of the compiler.(a) Syntax analysis(b) Code generation(c) Lexical analysis(d) All of the mentionedThis question was addressed to me in an internship interview.Question is taken from Three-Address Statements in portion Syntax Directed Definition and Translations of Compiler
A system program that combines the separately compiled modules of a program into a form suitable for execution is?(a) Assembler(b) Linking loader(c) Cross compiler(d) Load and GoThe question was asked in an online quiz.My question is based upon Three-Address Statements in section Syntax Directed Definition and Translations of Compiler
An LALR(1) parser for a grammar can have shift-reduce (S-R) conflicts if and only if ___________(a) The SLR(1) parser for G has S-R conflicts(b) The LR(1) parser for G has S-R conflicts(c) The LR(0) parser for G has S-R conflicts(d) The LALR(1) parser for G has reduce-reduce conflictsThe question was posed to me in homework.My query is from Intermediate Code-Generation topic in chapter Syntax Directed Definition and Translations of Compiler
Which of the following describes a handle (as applicable to LR-parsing) appropriately?(a) It is the position in a sentential form where the next shift or reduce operation will occur(b) It is a non-terminal whose production will be used for reduction in the next step(c) It is a production that may be used for reduction in a future step along with a position in the sentential form where the next shift or reduce operation will occur.(d) It is the production p that will be used for reduction in the next step along with a position in the sentential form where the right hand side of the production may be foundI had been asked this question during an interview for a job.My query is from Intermediate Code-Generation topic in division Syntax Directed Definition and Translations of Compiler

Discussion

No Comment Found

Related InterviewSolutions

Reply to Comment