Skip to content
Related Articles
Open in App
Not now

Related Articles

UGC-NET | UGC NET CS 2017 Jan – II | Question 33

Improve Article
Save Article
  • Last Updated : 12 Sep, 2019
Improve Article
Save Article

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 ?


Only I


Only II


Both I and II


Neither I nor II

Answer: (D)


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
Please comment below if you find anything wrong in the above post

My Personal Notes arrow_drop_up
Related Articles

Start Your Coding Journey Now!