#### CIT342 List of Questions

**Q1 A grammar G is ambiguous if there exists some string w ****�****?? L(G) for which ****�****?****��****?****��****?****�****..**

there are two or more distinct derivation trees

there are two or more distinct leftmost derivations

there are two or more distinct rightmost derivations.

**All of the options**

**Q2 The reduction u ****�****??v is called a ****�****?****��****?****��****?****��****?****��****?****��****?****�****..**

**direct production**

direct variable

direct function

None of the Options

**Q3 The pumping lemma is based on the ****�****?****��****?****��****?****��****?****��****?****�****. principle and it can be used to prove that an infinite language is not regular.**

pigeon hose

pigeon pole

**pigeon hole**

None of the Options

**Q4 The Pumping Lemma says that: ****�****?****��****?****��****?****��****?****�****.**

If an infinite language is regular, it can be defined by a DFA.

The DFA has some finite number of states (say, n).

Since the language is infinite, some strings of the language must have length > n.

**All of the options **

**Q5 A regular language is given in a standard representation if it is specified by one of:**

A regular expression.

**A regular notion.**

A regular grammar.

A finite automaton (DFA or NFA).

**FOR YOUR COURSE TMA SOLUTIONS as well as PAST QUESTIONS AND ANSWERS FOR EXAMS CONTACT 08039407882 on whatsapp.**