Computer Science – Principles of Computer Compiler Design

Cross-compiler is a compiler

Incremental-compiler is a compiler

For which of the following reasons. an interpreter is preferred to a compiler?

For which of the following reasons a compiler is preferable to an interpreter?

The cost of developing a compiler is proportional to the

An ideal compiler should

An optimizing compiler

In a compiler, grouping of characters into tokens is done by the

Whether a given pattern constitute a token or not

A grammar will be meaningless if the

Which of the following grammars are not phase-structured ?

Which of the following is the most general phase-structured grammar?

In a context-sensitive grammar,

In a context-free grammar.

If w is a string of terminals and A, B are two non-terminals. than which of the following are right-linear grammars?

If a is a terminal and S,A, B are three non-terminals, then which of the following are regular grammars?

Representing the syntax by a grammar is advantageous because

CFG can be recognized by a

CFG can be recognized by

Choose the correct statements.

A grammar can have

A top-down parser generates

A bottom-up parser generates

A given grammar is said to be ambiguous if

The grammar E → E + E | E*E | a, is

Choose the correct statement.

Consider the grammar
S → ABSc | Abc
BA → AB
Bb → bb
Ab → ab
Aa → aa
Which of the following sentences can be derived by this grammar?

The language generated by the above grammar is the set of all strings, made up of a, b, c, such that

In an incompletely specified automata

The main difference between a DFSA and a NDFSA is

Two finite state machines are said to be equivalent if they

Choose the correct answer.
FORTRAN is a

If two finite states machine M and N are isomorphic, then M can be transformed to N by relabeling

In a syntax directed translation scheme, if the value of an attribute of a node is a function of the values of the attributes of its children, then it is called a

Synthesized attribute can easily be simulated by an

For which of the following situations inherited attribute is a natural choice ?

The graph depicting the inter-dependencies of the attributes of different nodes in a parse tree is called a

Choose the correct statements.

A syntax tree

Syntax directed translation scheme is desirable because

Which of the following is not an intermediate code form?

Three address codes can be implemented by

Three address code involves

Symbol table can be used for

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

Which of the following symbol table implementation is based on the property of locality of reference?

Which of the following symbol table implementation is best suited if access time is to be minimum?

Which of the following symbol table implementation makes efficient use of memory ?

Access time of the symbol table will be logarithmic if it is implemented by a

An ideal compiler should

Which of the following is not a source of error?

Any transcription error can be repaired by

Hamming distance is a

Error repair may

A parser with the valid prefix property is advantageous because

The advantage of panic mode of error recovery is that

To recover from an error, the operator precedence parser may

Which of the following optimization techniques are typically applied on loops?

The technique of replacing run time computations by compile time computations is called

The graph that shows the basic blocks and their successor relationship is called

Reduction in strength means

A basic block can be analyzed by a

ud-chaining is useful for

Which of the following concepts can be used to identify loops ?

Which of the following are not loop optimization techniques?

Running time of a program depends on the

du-chaining

Which of the following comments about peep-hole optimization are true?

Shift-reduces parsers are

Recursive decent parsing is an example of

In operator precedence parsing. precedence relations are defined

For parsing arithmetic expressions, involving (, ). + and -. the precedence relation between – and -. will be <. if

For the previous problem. the precedence relation between ) and ( will be

LR stands for

LR parsers are attractive because

Which of the following is the most powerful parser?

Choose the correct statements.

YACC builds up

Choose the correct statements.

LR(k) grammar

The set of all viable prefixes of right sentential form of a given grammar

The ‘k’ , in LR(k) cannot be

This grammar is

The above grammar is used to generate all valid arithmetic expressions in a hypothetical language in which

The above grammar is used to generate all valid arithmetic expressions in a hypothetical language in which

Back-patching is useful for handling

Consider the grammar
E → TE’
E’ → +TE’ | ε
T → FT’
T’ → +FT’ | ε
F → (E) | id
First₁ (E) will be same as that of

Follow₁ (F) is

Which of the Following remarks logically follows?

Merging states with a common core may produce ____, conflicts but does not produce ____ conflicts in an LALR parser

For a CFG, FOLLOW (A) is the set of all terminals that can immediately appear to the right of the non-terminal A in some sentential form. We define two sets LFOLLOW (A) and RFOLLOW (A) by replacing the word sentential by “Left most sentential” and “Right most sentential” respectively in the definition of FOLLOW(A).
Choose the correct statements(s).

In a programming language, an identifier is permitted to be a letter followed by any number of letters or digits. If L and D denote the set of letters and digits respectively, which of the following expressions defines an identifier?

A shift reduce parser carries out the actions specified within braces immediately after reducing with the corresponding rule of grammar
S → xxW { print “1” }
S → Y { print “2” }
W → Sz { print “3” }
What is the translation of xxxxyzz using the syntax directed translation scheme described by the above rules?

Which of the following features cannot be captured by CFG?

A language L allows the declaration of arrays whose sizes are not known during compilation
It is required to make efficient use of memory. Which one of the following is true?

Consider an ε-free CFG. If for every pair of productions A → u A → v