Question
a.
top down parser
b.
bottom up parser
c.
CYK algorithm
d.
all of the mentioned
Posted under Formal Languages and Automata Theory
Engage with the Community - Add Your Comment
Confused About the Answer? Ask for Details Here.
Know the Explanation? Add it Here.
Q. Which among the following can parse a context free grammar?
Similar Questions
Discover Related MCQs
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
Q. Which of the following is true for CYK Algorithm?
View solution
Q. Which of the following steps are wrong with respect to infiniteness problem?
View solution
Q. State true or false:
Statement: Every context free language can be generated by a grammar which contains no useless non terminals.
View solution
Suggested Topics
Are you eager to expand your knowledge beyond Formal Languages and Automata Theory? We've curated a selection of related categories that you might find intriguing.
Click on the categories below to discover a wealth of MCQs and enrich your understanding of Computer Science. Happy exploring!
