Q. If L1 and L2 are context free languages, L1-L2 are context free:

View solution

Q. A___________ is context free grammar with atmost one non terminal in the right handside of the production.

View solution

Q. There is a linear grammar that generates a context free grammar

View solution

Q. The following format of grammatical notation is accepted by which of the following:
AB->CD

A->BC or

A->B or

A->a

where A, B, C, D are non terminal symbols and a is a terminal symbol.

View solution

Q. Every Kuroda Normal form grammar generates ___________

View solution

Q. Which of the following can generate Unrestricted grammars?

View solution

Q. Given a grammar in GNF and a derivable string in the grammar with the length n, any ___________will halt at depth n.

View solution

Q. Which of the following grammars is similar to Floyd Normal form?

View solution

Q. Which among the following can parse a context free grammar?

View solution

Q. The standard version of CYK algorithm operates only on context free grammars in the following form:

View solution

Q. The __________ running time of CYK is O(n^3 .|G|)
where n is the length of the parse string and |G| is the size of the context free grammar G.

View solution

Q. Which of the following is true for Valiants algorithm?

View solution

Q. Which among the following is a correct option in format for representing symbol and expression in Backus normal form?

View solution

Q. Which of the following is not a negative property of Context free languages?

View solution

Q. The intersection of context free language and regular language is _________

View solution

Q. Which of the following is regular?

View solution

Q. Which of the following is not context free?

View solution

Q. Which of the following can be used to prove a language is not context free?

View solution

Q. Which of the following are valid membership algorithms?

View solution

Q. Which of the following belong to the steps to prove emptiness?

View solution