Q. Which grammar defines Lexical Syntax ?

View solution

Q. Which of the following statements is false?

View solution

Q. Which of the following grammar rules violate the requirements of an operator grammar ?
P, Q, R are nonterminals, and r, s, t are terminals.

1. P → Q R
2. P → Q s R
3. P → ε
4. P → Q t R r

View solution

Q. The action of parsing the source program into the proper syntactic classes is called

View solution

Q. Which of the following statement is true?

View solution

Q. Minimum hamming distance method is used for connection of

View solution

Q. Pee hole optimization is a form of

View solution

Q. The value of k, in LR(k) cannot be

View solution

Q. The cost of developing a compiler is proportional to

View solution

Q. ud-chaining is useful for

View solution

Q. An ideal compiler should

View solution

Q. which of the following class of statements usually produces no executable code when compiled ?

View solution

Q. A compiler which allows only the modified section of the source code to be re-compiled is called

View solution

Q. Storage mapping is done by

View solution

Q. A computer programe that converts the whole programe into machine language at a single time is called

View solution

Q. Compiler can check-

View solution

Q. System program such a s compiler are designed so that they are

View solution

Q. Compiler can diagnose

View solution

Q. A programmer, by mistake, writes an instruction to divide, instead of a multiply, such error can be detected by a/an

View solution

Q. Disadvantage of " Compile and GO " loading scheme is that

View solution