Compiler Design

Choose the correct option / answer the following:
During lexical analysis, how many tokens are identified in the following statement? while(count<=10) count = count + 1;
(i) 9
(ii) 11
(iii) 10
(iv) 12

Which phase of compiler converts source code into tokens?

(i) Code generation
(ii) Lexical analysis
(iii) Optimization
(iv) Parsing

Choose the correct answer of the following:
The output of a lexical analyzer is
(i) a machine code
(ii) an intermediate code
(iii) a stream of tokens
(iv) a parse tree

Choose the correct option / answer the following:
Which of the following is NOT accepted by finite automata?
(i) Palindromes
(ii) Strings with even number of a's
(iii) Binary strings divisible by 3
(iv) Strings ending with 'ab'

Which data structure is mainly used in lexical analysis?

(i) Queue
(ii) Stack
(iii) Tree
(iv) Finite automata

Choose the correct answer of the following:
In a compiler, ________ checks every character of the source text.
(i) the lexical analyzer
(ii) the syntax analyzer
(iii) the code generator
(iv) the code optimizer

Which automaton accepts regular languages?

(i) PDA
(ii) DFA
(iii) Turing machine
(iv) LBA

Choose the correct answer of the following:
A compiler for a high-level language that runs on one machine and produce code for different machines is called
(i) optimizing compiler
(ii) one-pass compiler
(iii) cross-compiler
(iv) multipass compiler

Describe the major phases of a compiler, highlighting the role of each phase in the compilation process. Illustrate your answer with a neat and labeled diagram of the compilation phases.

Define Compiler. Explain all phases of a compiler with neat diagram.

What is the difference between a compiler and an interpreter? Discuss the different components of a language processing system using work-flow diagram.

Explain the working of each phase of compiler in detail with an example.

Differentiate between Deterministic Finite Automata (DFA) and Non-Deterministic Finite Automata (NFA). Also, explain the procedure to convert an NFA to DFA with a suitable example.

Construct a DFA for the regular expression $r = 0^*1^*2^*$.

Design a finite automaton that accepts all binary strings that do not contain the substring "101".

What is the pass of a compiler? Explain how the single- and multi-pass compilers work.

Explain different phases of compiler.

Define regular expression. Write the regular expression for the language having a string which should have at least one '0' and at least one '1'.

Write down the differences between DFA and NFA.

Convert the regular expression $(a+b)^*ab$ into NFA.

Write short notes on: Lex and Yaac