Blog: CS606 1st Quiz Spring 2013 File 1 Shared by Farree

CS 606 Quiz

Can a DFA simulate NFA?
Yes
No
Sometimes
Depend upon nfa

____________________ phase which supports macro substitution and conditional compilation.
Semantic
Syntax
Preprocessing
None

Which of the statement is true about Regular Languages?
Regular Languages are the most popular for specifying tokens.
Regular Languages are based on simple and useful theory.
Regular Languages are easy to understand.
All of the given

Lexer and scanner are two different phases of compiler
True
False

Lexical Analyzer generator ________________ is written in Java.
Flex
Jlex
Complex
None of the given

In a transition table cells of the table contain the ________ state.
Reject state
Next state
Previous state
None of the given

The transition graph for an NFA that recognizes the language ( a | b)*abb will have following set of states.
{0}
{0,1}
{0,1,2}
{0,1,2,3}

Front end of two pass compiler takes_________________ as input.
Source code
Intermediate representation
Machine code
None

In multi pass compiler during the first pass it gathers information about ___________________ .
Declarations
Bindings
Static information
None

Functions of Lexical analyzer are?
Removing white space
Removing constants, identifiers and keywords
Removing comments
All of the given