CD_quiz3

The output of LA is

• set of RE

• Syntax tree

• Set of tokens

• string character

A RE represents

• part of language

• Cannot represent any language

• constituent strings of a language

• none

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

• identifier

• assignment operator

• Integer literal

• addition operator

Two important lexical categories are

• white space

• comments

• none

• white space & comments

For the fortaran language statement “ do 5 i=1.25” returns token identifier for do 5 I after looking upto

• i

• =

• dot

• 5

choose most appropriate one,

The regular expression(0|1)*(0|1) represents a language with

• nonempty binary strings

• empty and non empty binary strings

• odd non empty strings

• even non empty strings

L((r)+) is equivalent to

a)

b))

c) )

d) )

• L((r) +)=L((r )*)-{€}

• L((r) +)=L((r )*)

• L((r) +)={€}

• L((r) +)=L((r ))

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

A DFA cannot have

• epsilon transistion

• more than one transistion from a state on same output

• all the above

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

• one

• at most one

• many

• zero