TC Quiz-3

Which ones are not in the proper form of CNF.

• A--> aB

• A-->BD

• A-->a

• A-->aBb

Which one is generated from the CFG

S-->aSa | bSb |a | b

• Set of all strings that start and end with same symbol

• Set of all even length palindromes

• Set of all odd length palindromes

• Set of all paliindromes

The Push Down Automata uses ____ as the memory component

• Queue

• Stack

• Tree

• Heap

The production of the form A->B , where A and B are non terminals is called

• Null Production

• CNF

• Unit Production

• GNF

A PDA machine configuration (p, w, y) can be correctly represented as:

• (current state, stack content, unprocessed input)

• (current state, unprocessed input, stack content)

• (unprocessed input, stack content, current state)

• None of these

A language is accepted by a push down automata if it is:

• Regular

• Context Free

• Both Regular and Context Free

• None of these

The Grammar S-->aSb | SS | ε is

• Not CFG, Not Regular

• Not CFG, But Regular

• CFG , Not Regular

• None of these

• S-->aS | ε

• S-->aS | a

• S--> aS |b

• S-->bS | a