Q. At the end of parsing,

View solution

Q. Dead-code elimination in machine code optimization refers to:

View solution

Q. A parse tree is an annotated parse tree if:

View solution

Q. In a two pass compiler, during the first pass:

View solution

Q. A single instruction in an assembly language program contains:

View solution

Q. Absolute loader demands that the programmer needs to know the:

View solution

Q. Top-down parsers are predictive parsers, because:

View solution

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