Consider the grammar given below E? E+E | E*E | E-E | E/E | E^E | (E) | id Assume that + and ^ have the same but least precedence, * and / have the next higher precedence but the same precedence and finally ^ has the highest precedence. Assume + and ^ associate to the left like * and / and that ^ associates to the right. Choose the correct for the ordered pairs (^,^), (-,-), (+,+), (*,*) in the operator precedence table constructed for the grammar.(a) All (c) , =(d) > >I have been asked this question in homework.I would like to ask this question from Context Free Grammar topic in portion Contextfree Grammar and Syntax Analysis of Compiler

Consider the grammar given below E? E+E | E*E | E-E | E/E | E^E

1.	Consider the grammar given below E? E+E \| EE \| E-E \| E/E \| E^E \| (E) \| id Assume that + and ^ have the same but least precedence, and / have the next higher precedence but the same precedence and finally ^ has the highest precedence. Assume + and ^ associate to the left like * and / and that ^ associates to the right. Choose the correct for the ordered pairs (^,^), (-,-), (+,+), (,) in the operator precedence table constructed for the grammar.(a) All (c) < >, =(d) < > > >I have been asked this question in homework.I would like to ask this question from Context Free Grammar topic in portion Contextfree Grammar and Syntax Analysis of Compiler
Answer» The correct ANSWER is (d) < > > > EASIEST explanation: This relation is established of BASIS of the PRECEDENCE of operators.

Discussion

No Comment Found

Related InterviewSolutions

Which of the following is true?(a) All subsets of a regular set are always regular(b) All finite subsets of non-regular set are always regular(c) Union of two non regular set of language is not regular(d) Infinite times union of finite set is always regularI got this question in an internship interview.This key question is from Regular Grammar in chapter Contextfree Grammar and Syntax Analysis of Compiler
Which of the following is true?(a) (01)*0 = 0(10)*(b) (0+1)*0(0+1)*1(0+1) = (0+1)*01(0+1)*(c) (0+1)*01(0+1)*+1*0* = (0+1)*(d) All of the mentionedThe question was asked in an international level competition.My doubt is from Regular Grammar in section Contextfree Grammar and Syntax Analysis of Compiler
A CFG is closed under _________(a) Union(b) Kleene star(c) Concatenation(d) None of the mentionedThe question was posed to me during an interview for a job.Enquiry is from Context Free Grammar topic in chapter Contextfree Grammar and Syntax Analysis of Compiler
Grammars that can be translated to DFAs is ___________(a) Left linear grammar(b) Right linear grammar(c) Generic grammar(d) All of the mentionedThis question was addressed to me in final exam.I'd like to ask this question from Context Free Grammar in section Contextfree Grammar and Syntax Analysis of Compiler
A context free language is called ambiguous if _________(a) It has 2 or more left derivations for some terminal string ѡ є L (G)(b) It has 2 or more right derivations for some terminal string ѡ є L (G)(c) It has 2 or more left & right derivations for some terminal string ѡ є L (G)(d) None of the mentionedI got this question during an internship interview.This interesting question is from Context Free Grammar topic in section Contextfree Grammar and Syntax Analysis of Compiler
Output file of Lex is __________ the input file is Myfile.(a) Myfile.e(b) Myfile.yy.c(c) Myfile.lex(d) Myfile.objI got this question in final exam.My question is taken from Syntax Analyser topic in portion Contextfree Grammar and Syntax Analysis of Compiler
A Push Down Automata is if there is at most one transition applicable to each configuration?(a) Deterministic(b) Non deterministic(c) Finite(d) Non finiteI got this question in a job interview.This intriguing question originated from Right Left Linear Grammar in portion Contextfree Grammar and Syntax Analysis of Compiler
Which of the following statement is true?(a) Every language that is defined by regular expression can also be defined by finite automata(b) Every language defined by finite automata can also be defined by regular expression(c) We can convert regular expressions into finite automata(d) All of the mentionedThe question was posed to me by my school principal while I was bunking the class.My enquiry is from Right Left Linear Grammar in division Contextfree Grammar and Syntax Analysis of Compiler
Automaton accepting the regular expression of any number of a’ s is ___________(a) a*(b) ab*(c) (a/b)*(d) a*b*cThis question was posed to me during an online interview.This interesting question is from Context Free Grammar in division Contextfree Grammar and Syntax Analysis of Compiler
Which phase of the compiler is Syntax Analysis?(a) First(b) Second(c) Third(d) None of the mentionedI had been asked this question during an interview.I need to ask this question from Syntax Analyser topic in chapter Contextfree Grammar and Syntax Analysis of Compiler

Discussion

No Comment Found

Related InterviewSolutions

Reply to Comment