ATC_CS1/3_2023-24

DFA accepts

• Any number of a's

• At least 1 "a"

• zero or more a's

• none of the above

ECLOSE(A)=?

• {A,B,C}

• {B,C}

• {A}

• {A,B}

Set of strings of a's and b's of any length including null string.

• a+b

• ab

• (a+b)*

• none of the above

what is the language generated by grammar?

• (0+1)*

• (01)*

• (0+1)

• 01

Pumping lemma is used

• To prove language is regular.

• To prove language is irregular.

• To prove language is regular or irregular.

• none of the above

In CFG tuple V is

• non terminal

• terminal

• value

• none of the above

Parsing is categorized into how many types?

• 1. three types

• 1. four types

• 1. two types

• 1. five types

The output of the lexical analyzer is _______

• 1. string character

• 1. a syntax tree

• 1. a set of RE

• 1. a set of tokens

Which grammar gives multiple parse trees for the same string?

• 1. Unambiguous

• 1. Regular

• 1. Ambiguous

• 1. All of the above

Which phenomenon happens when the non-terminal on the left side is repeated as the first symbol on the right side?

• 1. Left-most derivation

• 1. Left recursion

• 1. Left factoring

• 1. Left parsing