adplus-dvertising
frame-decoration

Question

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

a.

top-down parser

b.

bottom-up parser

c.

multitape turing machine

d.

none of the mentioned

Posted under Formal Languages and Automata Theory

Answer: (a).top-down parser

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

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

Similar Questions

Discover Related MCQs

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

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
View All MCQs on Formal Languages and Automata Theory

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!

Web Technologies

Master the building blocks of the web with our Web Technologies MCQs. From HTML and...

Java Programming

Level up your coding skills with our Java Programming MCQs. From object-oriented...

R Programming

Unleash the power of statistical computing with our R Programming MCQs. Topics cover...

Wireless and Mobile Communications

Get to grips with modern communication technologies with our Wireless and Mobile...

Cloud Computing

Stay on top of the biggest trend in IT with our Cloud Computing MCQs. These questions...

MATLAB

Hone your computational mathematics skills with our MATLAB MCQs. Understand...

Human Computer Interaction

Enhance your knowledge of Human-Computer Interaction with our specialized MCQs....

MongoDB

Learn the leading NoSQL database with our MongoDB MCQs. Understand everything from...

Formal Languages and Automata Theory

Discover the mathematical models of computation with our Formal Languages and...