List questions from context-free-grammar

Published on 26 Mar 2026 - 3:11

34

Views

$LR(k)$ grammar and handles

Published on 15 Jul 2022 - 13:08

48

Views

Is this correctly CFG for this language?

Published on 03 Aug 2022 - 9:48

53

Views

Is the following grammar a CFG?

Published on 24 Feb 2026 - 5:24

60

Views

Non-ambiguous CFG for an expression

Published on 16 Oct 2022 - 19:49

32

Views

Find a CFG for $a^{2n}b^na^k$ where $n,k \ge 0$

Published on 22 Oct 2022 - 1:15

39

Views

Making a CFG for $a^{i}b^{j}c^{k}$ such that $i+j=k+3, i,j\geq1$

Published on 25 Oct 2022 - 18:11

72

Views

Questions on Chomsky Normal Form Violations

Published on 10 Nov 2022 - 20:09

68

Views

Prove $NOTCONTEXTFREE_{TM}$ is not recursively enumerable?

Published on 02 Dec 2022 - 21:07

41

Views

Unambiguous grammar for the language $S\to A|B, A\to B1|1B, B\to A0|0A|0$

Published on 03 Dec 2022 - 18:35

37

Views

How to derive a language when there is an unreachable non-terminal symbol?

Published on 26 Mar 2026 - 3:12

48

Views

Describe the language of $S\to0S0\,\,|\,\,1S0\,\,|\,\,\varepsilon$

Published on 31 Dec 2022 - 14:52

147

Views

Context free grammar for the same amount of a’s and b’s, with the b’s in the middle

Published on 04 Jan 2023 - 14:20

45

Views

Let L CFL. Prove or disprove $B(L) = \{w : w \in L, |w|>10 \} $ is CFL

Published on 07 Jan 2023 - 19:14

47

Views

Which language will be generated by the following grammar?

Published on 26 Mar 2026 - 4:50

List Question

Prove a subset of a regular language is regular, context-free but not regular or not context free

$LR(k)$ grammar and handles

Is this correctly CFG for this language?

Is the following grammar a CFG?

Non-ambiguous CFG for an expression

Find a CFG for $a^{2n}b^na^k$ where $n,k \ge 0$

Making a CFG for $a^{i}b^{j}c^{k}$ such that $i+j=k+3, i,j\geq1$

Questions on Chomsky Normal Form Violations

Prove $NOTCONTEXTFREE_{TM}$ is not recursively enumerable?

Unambiguous grammar for the language $S\to A|B, A\to B1|1B, B\to A0|0A|0$

How to derive a language when there is an unreachable non-terminal symbol?

Describe the language of $S\to0S0\,\,|\,\,1S0\,\,|\,\,\varepsilon$

Context free grammar for the same amount of a’s and b’s, with the b’s in the middle

Let L CFL. Prove or disprove $B(L) = \{w : w \in L, |w|>10 \} $ is CFL

Which language will be generated by the following grammar?

Trending Questions

Popular # Hahtags

Popular Questions