Q. If A, B and C are any three sets, then A – (B ∪ C) is equal to

View solution

Q. A = {x: x ≠ x }represents

View solution

Q. If A, B, C be three sets such that A ∪ B = A ∪ C and A ∩ B = A ∩ C, then

View solution

Q. The number of proper subsets of the set {1, 2, and 3} is

View solution

Q. If A and B are any two sets, then A ∪ (A ∩ B) is equal to

View solution

Q. If A, B and C are any three sets, then A × (B ∪ C) is equal to

View solution

Q. __________ a part of a compiler that is responsible for recognizing syntax.

View solution

Q. The process of forming tokens from an input stream of characters is called_____.

View solution

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