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

Last Updated :
Discuss
Comments

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

This question is part of this quiz :

Lexical analysis,Parsing and Syntax directed translation,UGC NET CS 2017 Jan - II
Tags:
Compiler Design
UGC-NET
Share your thoughts in the comments