Menu

Question Discussion & Solution

MCQ
Q.
Consider a CFG with the following productions. S ? AA | B A ? 0A | A0 | 1 B ? 0B00 | 1 S is the start symbol, A and B are non-terminals and 0 and 1 are the terminals. The language generated by this grammar is

forum Community Discussion

speaker_notes_off

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

login Login to Discuss

auto_awesome Similar Questions

MCQ
1.
A context free language is called ambiguous if _________
forum Discussion
MCQ
2.
Which of following statement(s) is/are not correct? (I) Languages generated by the grammar S?aSa ? aa is not regular. (II) Languages generated by the grammar S?aSb ? aa is not regular. (III) Languages generated by the grammar S?S1|S3, S1?aS1c |S2|?, S2?aS2b|?, S3?aS3b|S4| ?, S4?bS4c|? is {a^nb^mc^k | k = |n - m|, n?0, m?0, k?0}. (IV) Languages generated by the grammar S?S1S3, S1?aS1c |S2|?, S2?aS2b|?, S3?aS3b|S4| ?, S4?bS4c|? is {a^nb^mc^k | k = |n - m|, n?0, m?0, k?0}.
forum Discussion
MCQ
3.
The context free grammar S ? SS | 0S1 | 1S0 | ? generates
forum Discussion
MCQ
4.
Grammar that produce more than one Parse tree for same sentence is ___________
forum Discussion
MCQ
5.
Which of these does not belong to CFG ?
forum Discussion

category More Theory of Automata Topics

article

Reqular Expressions

format_list_bulleted 114 MCQs
Practice arrow_forward
article

Finite Automata

format_list_bulleted 44 MCQs
Practice arrow_forward
article

Context Free Grammars

format_list_bulleted 76 MCQs
Practice arrow_forward
article

Push Down Automata

format_list_bulleted 37 MCQs
Practice arrow_forward
article

Regular and context free languages

format_list_bulleted 65 MCQs
Practice arrow_forward
article

Pumping Lemma

format_list_bulleted 14 MCQs
Practice arrow_forward
article

Turning Machine

format_list_bulleted 14 MCQs
Practice arrow_forward