UGC-NET | UGC NET CS 2017 Jan – II | Question 33
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 ?
Both I and II
Neither I nor II
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
Please Login to comment...