Question
a.
top down parsers
b.
botton up parsers
c.
predictive parsing
d.
none of these
Posted under Systems Programming
Engage with the Community - Add Your Comment
Confused About the Answer? Ask for Details Here.
Know the Explanation? Add it Here.
Q. Recursive descent parsing is an example of
Similar Questions
Discover Related MCQs
Q. LR stands for
View solution
Q. A compiler that runs on one machine and produces code for a different machine is called
View solution
Q. YACC stands for
View solution
Q. An optimizer compiler
View solution
Q. Which of the following is not an intermediate code form?
View solution
Q. Which of the following parser is most powerful?
View solution
Q. A parser with the valid prefix property is advantageous because it
View solution
Q. YACC builds up
View solution
Q. The ultimate goal of a compiler is to,
View solution
Q. Which method is used for resolving data dependency conflict by the compiler itself?
View solution
Q. Inherited attribute is a natural choice in
View solution
Q. A grammar that produces more than one parse tree for some sentence is called
View solution
Q. Pee hole optimization
View solution
Q. The optimization which avoids test at every iteration is
View solution
Q. Advantage of panic mode of error recovery is that
View solution
Q. Which of the following is used for grouping of characters into tokens (in a computer)
View solution
Q. A compiler for a high-level language that runs on one machine and produces code for a different machine is called
View solution
Q. Cross-compiler is a compiler
View solution
Q. The __________ is a technique for building cross compilers for other machines.
View solution
Q. __________ was developed from the beginning as a cross compiler.
View solution
Suggested Topics
Are you eager to expand your knowledge beyond Systems Programming? We've curated a selection of related categories that you might find intriguing.
Click on the categories below to discover a wealth of MCQs and enrich your understanding of Computer Science. Happy exploring!
