Menu

Question Discussion & Solution

MCQ
Q.
Consider the following languages:
I. {ambncpdq ? m + p = n + q, where m, n, p, q ? 0}
II. {ambncpdq ? m = n and p = q, where m, n, p, q ? 0}
III. {ambncpdq ? m = n = p and p ? q, where m, n, p, q ? 0}
IV. {ambncpdq ? mn = p + q, where m, n, p, q ? 0}
Which of the above languages are context-free?

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.
Which of the following sentences can be generated by

S -> aS | bA
A -> d | cA
forum Discussion
MCQ
2.
Given the following grammars: G1: S ? AB|aaB A ? aA | ? B ? bB | ? G2: S ? A|B A ? aAb | ab B ? abB | ? Which of the following is correct?
forum Discussion
MCQ
3.
Consider the following statements about the context free grammar G = {S-->SS , S-->ab , S-->ba , S-->^} I. G is ambiguous II. G produces all strings with equal number of a
forum Discussion
MCQ
4.
Let G = (V, T, S, P) be a context-free grammar such that every one of its productions is of the form A ? v, with |v| = K > 1. The derivation tree for any W ? L(G) has a height h such that
forum Discussion
MCQ
5.

Which of these languages are not context free

forum Discussion

category More Theory of Automata Topics

article

Reqular Expressions

format_list_bulleted 114 MCQs
article

Finite Automata

format_list_bulleted 44 MCQs
article

Context Free Grammars

format_list_bulleted 76 MCQs
article

Push Down Automata

format_list_bulleted 37 MCQs
article

Regular and context free languages

format_list_bulleted 65 MCQs
article

Pumping Lemma

format_list_bulleted 14 MCQs
article

Turning Machine

format_list_bulleted 14 MCQs