Question
a.
next tokens are predicted
b.
length of the parse tree is predicted before hand
c.
lowest node in the parse tree is predicted
d.
next lower level of the parse tree is predicted
Engage with the Community - Add Your Comment
Confused About the Answer? Ask for Details Here.
Know the Explanation? Add it Here.
Q. Top-down parsers are predictive parsers, because:
Similar Questions
Discover Related MCQs
Q. In the context of compiler design, “reduction in strength” refers to:
View solution
Q. How many states can a process be in?
View solution
Q. The parsing technique that avoids back tracking is:
View solution
Q. A Top-down Parse generates:
View solution
Q. In an absolute loading scheme, which loader function is accomplished by programmer?
View solution
Q. Symbol table can be used for:
View solution
Q. Linking:
View solution
Q. Which of the following is the most general phase-structured grammar ?
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. The ‘K’ in LR (K) cannot be:
View solution
Q. Peep-hole optimization is a form of:
View solution
Q. An operating system is:
View solution
Q. A permanent database of a general model of compiler is...................
View solution
Q. Loading operating system from secondary memory to primary memory is called...............
View solution
Q. Which statement is wrong ?
View solution
Q. Tasks done in parsing are:
View solution
Q. YACC builds up ................. parsing table.
View solution
Q. The action of passing the source program into the proper syntactic class is known as:
View solution
Q. The dynamic binding occurs during the:
View solution
Q. A Top-down Parse generates:
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!
