Skip to content
Related Articles

Related Articles

UGC-NET | UGC NET CS 2017 Jan – II | Question 33
  • Last Updated : 12 Sep, 2019

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 ?
(A) Only I
(B) Only II
(C) Both I and II
(D) Neither I nor II


Answer: (D)

Explanation: Both statements are wrong for detailed information on lexical analysis and syntax analysis Refer:Compiler Design | Introduction to Syntax Analysis and Compiler Design | Lexical Analysis
option (D) is correct.

Quiz of this Question

My Personal Notes arrow_drop_up
Recommended Articles
Page :