Related InterviewSolutions

• Which of the following is TRUE?(a) Both P and Q are true(b) P is true and Q is false(c) P is false and Q is true(d) Both P and Q are falseThe question was asked during an internship interview.I'd like to ask this question from Top-Down Parsing in portion Topdown Parsing of Compiler
• In a bottom-up evaluation of a syntax directed definition its inherited attributes can do which of the following?(a) Always evaluated(b) Can beevaluatedif the definition is L attributed(c) Can beevaluatedif the definition has synthesized attributes(d) Never be evaluatedI got this question in semester exam.My enquiry is from Top-Down Parsing topic in chapter Topdown Parsing of Compiler
• The process of assigning load addresses to the various parts of the program and adjusting the code and data in the program to reflect the assigned addresses is called?(a) Assembly(b) Parsing(c) Relocation(d) Symbol resoluteThe question was asked by my school principal while I was bunking the class.Origin of the question is Top-Down Parsing in chapter Topdown Parsing of Compiler
• Which of the following derivations does a top-down parser use while parsing an input string?(a) Leftmost derivation(b) Leftmost derivationin reverse(c) Rightmost derivation(d) Rightmost derivation in reverseI had been asked this question during an interview.This question is from Top-Down Parsing topic in portion Topdown Parsing of Compiler
• Which of the following describes a handle (as applicable to LR-parsing) appropriately?(a) Position wherenext reduce orshiftoperation will occur(b) The next step has use of Non-terminal for reduction(c) Used for reduction in a coming-upstep along with a position in the sentential form where the next shift or reduce operation will occur(d) Used in the next step for reduction along with a position in the sentential form where the right hand side of the production may be foundThe question was asked in exam.Query is from Top-Down Parsing in chapter Topdown Parsing of Compiler
• Which of the following suffices to convert an arbitrary CFG to an LL(1) grammar?(a) Removing left Recursive alone(b) Factoring the grammar alone(c) Along with removing left recursion we also perform the factoring of the grammar(d) None of the mentionedI have been asked this question in examination.Query is from Top-Down Parsing topic in chapter Topdown Parsing of Compiler
• Which of the following statements is false?(a) Unambiguous grammar has both kind of derivations(b) An LL(1) parser is a top-down parser(c) LALR is more powerful than SLR(d) Ambiguous grammar can’t be LR(k)This question was posed to me by my college director while I was bunking the class.The above asked question is from Predictive Top-Down Parsing topic in section Topdown Parsing of Compiler
• Which of the following statements is false?(a) Left as well as right most derivations can be in Unambiguous grammar(b) An LL (1) parser is a top-down parser(c) LALR is more powerful than SLR(d) Ambiguous grammar can’t be LR (k)I had been asked this question in exam.The question is from Top-Down Parsing in section Topdown Parsing of Compiler
• In the context of abstract-syntax-tree and control-flow-graph. Which one of the following is true?(a) In both AST and CFG if node N2 be the successor of node N1(b) For any input program, neither AST nor CFG will contain a cycle(c) The max number of successors of a node in an AST and a CFG depends on the input program(d) None of the mentionedI got this question in exam.This question is from Predictive Top-Down Parsing topic in chapter Topdown Parsing of Compiler
• Compute E.value for the root of the parse tree for the expression:2 # 3 & 5 # 6 &4.(a) 200(b) 180(c) 160(d) 40The question was posed to me at a job interview.This question is from Top-Down Parsing topic in section Topdown Parsing of Compiler