Q. Terminal table -

View solution

Q. Which of the following is a phase of a compilation process ?

View solution

Q. Uniform symbol table

View solution

Q. In operator precedence parsing, precedence relations are defined

View solution

Q. LR parsers are attractive because

View solution

Q. The most powerful parser is

View solution

Q. Let ( Z,* ) be an algebraic structure, where Z is set of integers and the operation * is defined by n * m =maximum ( n , m ) Which of the following statements is true for ( Z, * ) ?

View solution

Q. The identification of common sub-expression and replacement of run-time computations by compile-time computations is

View solution

Q. An intermediate code form is

View solution

Q. The best way to compare the different implementations of symbol table is to compare the time required to

View solution

Q. To recover from an error, the operator precedence parser may

View solution

Q. Reduction in strength means

View solution

Q. Substitution of values for names whose values are constant, is done in

View solution

Q. Function of the syntax phase is to

View solution

Q. Which of the following features cannot be captured by CFG ?

View solution

Q. Which of the following statement is true ?

View solution

Q. Which is not true about syntax and semantic parts of a computer language?

View solution

Q. The table created by lexical analysis to describe all literals used in the source program is

View solution

Q. The task(s) of the Lexial analysis phase is/are:

View solution

Q. The table created by lexical analysis to describe all literals used in the source program, is:

View solution