List questions from context-free-grammar

Published on 26 Mar 2026 - 4:52

460

Views

Decidability of DCFL and Undecidability of CFL with respect to regularity

Published on 24 Feb 2026 - 2:08

123

Views

Context Free Grammar for strings of $z^n$y$x^m$ $w^n$

Published on 28 Mar 2026 - 12:14

56

Views

Syntax diagram confusion

Published on 24 Oct 2021 - 23:46

330

Views

What are general tips for generating grammars for context free languages?

Published on 12 Nov 2021 - 18:42

431

Views

CFG with even length and not in the form of SS.

Published on 20 Nov 2021 - 6:25

383

Views

Why is {$0^ 1^ : ≥0$} context free?

Published on 09 Dec 2021 - 8:46

42

Views

Find a CFG for all words that can be obtained in the form $a^ib^{i+k}a^k$

Published on 13 Dec 2021 - 5:22

156

Views

Finding Context Free Grammar for a language

Published on 24 Feb 2026 - 5:23

40

Views

Proof of context free Language

Published on 25 Mar 2026 - 20:08

37

Views

constructing grammar for 101(1+0)*

Published on 26 Mar 2026 - 3:18

66

Views

Constructing grammar for $a^ib^j$ / $i\neq j$

Published on 28 Mar 2026 - 13:59

168

Views

How do you show that the language $L= \{ a^nb^nc^na^kb^lc^m \mid l,m,n \geqslant 0 \text{ and } k >0 \}$ is not context-free.

Published on 17 Mar 2022 - 13:32

93

Views

Prove the language of equal a's and b's or b's and c's is inherently ambiguous

Published on 19 Mar 2022 - 22:16

410

Views

CFG for $\{0^i1^j0^k\mid i+2j=3k\}$

Published on 22 Mar 2022 - 19:54

List Question

Combination of 2 context free grammars

Decidability of DCFL and Undecidability of CFL with respect to regularity

Context Free Grammar for strings of $z^n$y$x^m$ $w^n$

Syntax diagram confusion

What are general tips for generating grammars for context free languages?

CFG with even length and not in the form of SS.

Why is {$0^ 1^ : ≥0$} context free?

Find a CFG for all words that can be obtained in the form $a^ib^{i+k}a^k$

Finding Context Free Grammar for a language

Proof of context free Language

constructing grammar for 101(1+0)*

Constructing grammar for $a^ib^j$ / $i\neq j$

How do you show that the language $L= \{ a^nb^nc^na^kb^lc^m \mid l,m,n \geqslant 0 \text{ and } k >0 \}$ is not context-free.

Prove the language of equal a's and b's or b's and c's is inherently ambiguous

CFG for $\{0^i1^j0^k\mid i+2j=3k\}$

Trending Questions

Popular # Hahtags

Popular Questions