TCS test no 1

Obtaining the final string by concatenating the labels of the tree from left to right is called yield of a _____ tree.

• Perfect

• Concatenation

• Leaves crafting

• Parse

Given the grammar G = {{S, B}, {0,1}, {S}, P}, what are {0,1}?

• Non terminals

• Production

• Starting Symbol

• Terminals

What is a type of derivation tree that is obtained by applying production to the rightmost variable in each step?

• Right part tree

• Right derivation tree

• Production processing rightly

• Rightly derivation tree

A left recursive production has a form of X --> aX. True or False

• True

• False

A grammar G is said to be ________ if there exists two or more derivation tree for some sting in a L(G).

• Ambitions

• Ambigious

• Ambiguous

• Ambitious

Which of the following is NOT considered closed for Context free languages?

• Concatenation

• Union

• Kleen Star

• Complement

Pushdown automata accepts

• Regular language

• Context-free language

• Context-sensitive language

• Both Regular and context-free language

What is addition in pushdown automata as compare to finite state automata?

• Stack memory

• Input Tape

• Read Head

• None of them

A pushdown automata behaves like an finite state automata when the number of auxiliary memory it has, is

• 1

• 2

• 0

• 3

State true or false:

Statement: For every CFL, G, there exists a PDA M such that L(G) = L(M) and vice versa.

• true

• false