Q. Are ambiguous grammar context free?

View solution

Q. Which of the following is not a notion of Context free grammars?

View solution

Q. State true or false:
Statement: The recursive inference procedure determines that string w is in the language of the variable A, A being the starting variable.

View solution

Q. Which of the following statements are correct for a concept called inherent ambiguity in CFL?

View solution

Q. Is the following statement correct?
Statement: Recursive inference and derivation are equivalent.

View solution

Q. A->aA| a| b
The number of steps to form aab:

View solution

Q. An expression is mentioned as follows. Figure out number of incorrect notations or symbols, such that a change in those could make the expression correct.
L(G)={w in T*|S→*w}

View solution

Q. The language accepted by Push down Automaton:

View solution

Q. Which among the following is the correct option for the given grammar?
G->X111|G1,X->X0|00

View solution

Q. Which of the following the given language belongs to?
L={a^mb^mc^m| m>=1}

View solution

Q. Choose the correct option:
Statement: There exists two inference approaches:

1. Recursive Inference
2. Derivation

View solution

Q. Choose the correct option:
Statement 1: Recursive Inference, using productions from head to body.

Statement 2: Derivations, using productions from body to head.

View solution

Q. State true or false:
Statement: Every right-linear grammar generates a regular language.

View solution

Q. What the does the given CFG defines?
S->aSbS|bSaS|e and w denotes terminal

View solution

Q. If L1 and L2 are context free languages, which of the following is context free?

View solution

Q. For the given Regular expression, the minimum number of variables including starting variable required to derive its grammar is:
(011+1)*(01)*

View solution

Q. For the given Regular expression, the minimum number of terminals required to derive its grammar is:
(011+1)*(01)*

View solution

Q. A grammar G=(V, T, P, S) is __________ if every production taken one of the two forms:
B->aC

B->a

View solution

Q. Which among the following is a CFG for the given Language:
L={x∈{0,1}*|number of zeroes in x=number of one’s in x}

View solution

Q. Which of the following languages are most suitable for implement context free languages ?

View solution