Home / Engineering / Theory of Computation and Compiler Design / Question
M
Q.) 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?
Related MCQs on Theory of Computation and Compiler Design
Q. Fourier transform of a signal gives the
Q. Which common bus specification provides the fastest data transfer rate?
Q. Which of the following is property of ACID principle?
Q. For which of the following inputs would Kadane’s algorithm produce a WRONG output?
Q. JavaScript is also called server-side JavaScript.
Q. What happens during recall in neural networks?
Q. What do you mean by generalization error in terms of the SVM?
Discusssion
Login to discuss.