Question

CFG for the language $L = \{(a^n)(b^m)(c^k) \mid k = |n – m|, n,m,k \geqslant 0\}$

score 789 · Answer 1 · 2026-03-25 14:36:42

789

Views

CFG for the language $L = \{(a^n)(b^m)(c^k) \mid k = |n – m|, n,m,k \geqslant 0\}$

Published on 25 Mar 2026 - 14:36

score 1.7k · Answer 2 · 2026-03-25 14:35:52

1.7k

Views

What is the maximum number of reduce moves that can be taken by a bottom-up parser for a grammar with no epsilon and unit-production

Published on 25 Mar 2026 - 14:35

score 88 · Answer 3 · 2015-10-01 15:02:05

88

Views

Language to Context Free Grammar

Published on 01 Oct 2015 - 15:02

score 674 · Answer 4 · 2026-03-04 22:35:35

674

Views

How would I find the Context Free Grammar for the complement of L = {a^n | n>= 0}? The alphabet is {a}.

Published on 04 Mar 2026 - 22:35

score 1k · Answer 5 · 2026-03-26 02:57:37

1k

Views

Construct DFA from context-free grammar

Published on 26 Mar 2026 - 2:57

score 173 · Answer 6 · 2026-03-27 00:07:15

173

Views

Is $L_1$ context free language?

Published on 27 Mar 2026 - 0:07

score 1.6k · Answer 7 · 2015-10-16 09:20:49

1.6k

Views

Is $L = \left \{ a^m b^mca^nb^m \mid m,n \geq 0 \right \}$ context free language?

Published on 16 Oct 2015 - 9:20

score 25 · Answer 8 · 2026-03-08 08:48:20

25

Views

Suppose that CFG G defines $T^*$. Does G defines every language $L$ over the alphabet T?

Published on 08 Mar 2026 - 8:48

score 2.2k · Answer 9 · 2026-03-23 03:51:56

2.2k

Views

What is meant by S -> SS in a CFG?

Published on 23 Mar 2026 - 3:51

score 106 · Answer 10 · 2026-03-04 18:34:02

106

Views

Context free grammar for these langauges?

Published on 04 Mar 2026 - 18:34

score 3.3k · Answer 11 · 2015-10-29 12:01:22

3.3k

Views

How to draw DPDA for language $L = \{a^ncb^{2n} | n \geq1\}$over the alphabet $\Sigma =\{a,b,c\} ?$

Published on 29 Oct 2015 - 12:01

score 36 · Answer 12 · 2015-11-04 18:00:30

36

Views

What happens when all productions in a grammar are useless?

Published on 04 Nov 2015 - 18:00

score 839 · Answer 13 · 2026-03-09 05:51:30

839

Views

When eliminating the lambda expressions from this grammar, are we missing a production?

Published on 09 Mar 2026 - 5:51

score 8.1k · Answer 14 · 2015-11-05 14:20:18

8.1k

Views

How we decide for a given context free grammar generate an infinite number of strings?

Published on 05 Nov 2015 - 14:20

score 782 · Answer 15 · 2015-11-10 01:06:46

782

Views

Prove that the context free grammar S --> aS | λ has the language {$a^n | n >= 0$}

Published on 10 Nov 2015 - 1:06

List Question

CFG for the language $L = \{(a^n)(b^m)(c^k) \mid k = |n – m|, n,m,k \geqslant 0\}$

What is the maximum number of reduce moves that can be taken by a bottom-up parser for a grammar with no epsilon and unit-production

Language to Context Free Grammar

How would I find the Context Free Grammar for the complement of L = {a^n | n>= 0}? The alphabet is {a}.

Construct DFA from context-free grammar

Is $L_1$ context free language?

Is $L = \left \{ a^m b^mca^nb^m \mid m,n \geq 0 \right \}$ context free language?

Suppose that CFG G defines $T^*$. Does G defines every language $L$ over the alphabet T?

What is meant by S -> SS in a CFG?

Context free grammar for these langauges?

How to draw DPDA for language $L = \{a^ncb^{2n} | n \geq1\}$over the alphabet $\Sigma =\{a,b,c\} ?$

What happens when all productions in a grammar are useless?

When eliminating the lambda expressions from this grammar, are we missing a production?

How we decide for a given context free grammar generate an infinite number of strings?

Prove that the context free grammar S --> aS | λ has the language {$a^n | n >= 0$}

Trending Questions

Popular # Hahtags

Popular Questions