Compiler Design-Lexical Analysis [GATE (Graduate Aptitude Test in Engineering) Computer Science]: Questions 1 - 5 of 14

Access detailed explanations (illustrated with images and videos) to 2290 questions. Access all new questions- tracking exam pattern and syllabus. View the complete topic-wise distribution of questions. 3 Year Validity- Access Unlimited Times on Unlimited Devices.

View Sample Explanation or View Features.

Rs. 600.00 -OR-

How to register? Already Subscribed?

Question 1

Question MCQ▾

Which of the following is not a lexical analyzer or lexical generator?

Choices

Choice (4)Response

a.

Lexx +

b.

Quex

c.

JavaCC

d.

None of the above

Edit

Question 2

Appeared in Year: 2010

Question MCQ▾

Which of the following is the most general phase structured grammar? (June Paper II)

Choices

Choice (4)Response

a.

Regular

b.

Context-sensitive

c.

Context free

d.

Question does not provide sufficient data or is vague

Edit

Question 3

Appeared in Year: 2010

Question MCQ▾

Which of the following is used for grouping of characters into tokens (in a computer) ? (June Paper II)

Choices

Choice (4)Response

a.

A parser

b.

Code optimizer

c.

Code generator

d.

Scanner

Edit

Question 4

Appeared in Year: 2017

Question MCQ▾

Consider the following statements related to compiler construction:

I. Lexical Analysis is specified by context-free grammars and implemented by pushdown automata.

II. Syntax Analysis is specified by regular expressions and implemented by finite-state machine.

Which of the above statement (s) is/are correct? (January paper II)

Choices

Choice (4)Response

a.

Only I

b.

I and II

c.

Only II

d.

Neither I nor II

Edit

Question 5

Appeared in Year: 2014

Question Match List-Ⅰ List-Ⅱ▾

Match the following: (December Paper III)

List-Ⅰ (Column I)List-Ⅱ (Column II)
(A)

Context sensitive grammar

(i)

Pushdown automaton

(B)

Regular grammar

(ii)

Linear bounded automaton

(C)

Unrestricted grammar

(iii)

Turing machine

(D)

Context free grammar

(iv)

Deterministic finite automaton

Choices

Choice (4)Response
  • (A)
  • (B)
  • (C)
  • (D)

a.

  • (ii)
  • (iii)
  • (i)
  • (iv)

b.

  • (iv)
  • (ii)
  • (iii)
  • (i)

c.

  • (i)
  • (ii)
  • (iv)
  • (iii)

d.

  • (ii)
  • (iv)
  • (iii)
  • (i)

Edit