Compiler design -Quiz2

The regular expression represents

• part of the language

• can not represent any language

• Constituent string of a language

• None of the other options

The output of the lexical analyzer is

• A set of RE

• Syntax Tree

• set of tokens

• String char

Two Important lexical categories are

• White Space

• Comments

• None of the mentioned

• White Space & Comments

when the expression sum=3+2 is tokenized then what is the token category of 3

• Identifier

• Assignment operator

• Integer integral

• Addition operator

A DFA cannot have

• Epsilon transitions

• An isolated state

• More than one transition from a state on same in out

• All of the other options

A regular expression for accepting strings with exactly one 1 more than 0’s is

• 0*1

• (0|1)*1(0|1)*

• (0|1)*1(0|1)*|1(0|1)*

• Not possible

Number of possible epsilon transitions from a state in an NFA is

• One

• At most one

• Many

• Zero

The following of a set of states, P, of an NFA is defined as the set of states reachable from any state in P following ε‐transitions

• ε‐closure

• ε‐park

• Q in the tuple

• None of the mentioned

A certain compiler corrects errors like “fi” to “if” automatically. This is an example of recovery in

• Panic mode

• Delete character

• Replace Character

• Transpose character

The regular expression: 0*10*10*10* is the representation of which following language over the alphabet {0,1}?

• All binary strings possessing exactly three 1’s.

• All binary strings possessing more than three 1’s.

• All binary strings possessing less than three 1’s.

• All binary strings possessing less than three 1’s.