Question

There is a sequence of operations on grammars of a string that strictly decreases the size of grammars down to the smallest grammer.

score 67 · Answer 1 · 2026-05-10 15:26:27

67

Views

There is a sequence of operations on grammars of a string that strictly decreases the size of grammars down to the smallest grammer.

Published on 10 May 2026 - 15:26

score 52.8k · Answer 2 · 2026-04-15 06:15:53

52.8k

Views

Find a CFG for L = { a^nb^m : n != m }

Published on 15 Apr 2026 - 6:15

score 201 · Answer 3 · 2026-04-08 16:16:42

201

Views

Creating the production for a CFG

Published on 08 Apr 2026 - 16:16

score 786 · Answer 4 · 2026-04-10 18:47:49

786

Views

Context Free Grammar for natural numbers

Published on 10 Apr 2026 - 18:47

score 54 · Answer 5 · 2026-04-12 18:26:38

54

Views

how to come up with a solution of finite or infinite language using context free grammer?

Published on 12 Apr 2026 - 18:26

score 276 · Answer 6 · 2026-04-13 08:14:16

276

Views

Can any Language that is generated LL1 Grammar is regular.?

Published on 13 Apr 2026 - 8:14

score 693 · Answer 7 · 2026-04-04 13:21:02

693

Views

Prove a language is Context Free

Published on 04 Apr 2026 - 13:21

score 140 · Answer 8 · 2026-04-14 01:35:38

140

Views

Chomsky Normal Form Details

Published on 14 Apr 2026 - 1:35

score 401 · Answer 9 · 2026-04-10 23:52:05

401

Views

How to prove not a CFL with pumping lemma?

Published on 10 Apr 2026 - 23:52

score 125 · Answer 10 · 2026-04-12 08:15:22

125

Views

How is this derivation possible in a context-free grammar?

Published on 12 Apr 2026 - 8:15

score 69 · Answer 11 · 2026-04-13 07:00:24

69

Views

Describe this language that is generated by Context Free Grammar

Published on 13 Apr 2026 - 7:00

score 167 · Answer 12 · 2026-05-10 14:02:30

167

Views

Chomsky Normal Form for Integer Recognition

Published on 10 May 2026 - 14:02

score 918 · Answer 13 · 2026-04-13 17:02:23

918

Views

Is the language $L = \{0^m1^n: m \neq n \}$ not context free?

Published on 13 Apr 2026 - 17:02

score 80 · Answer 14 · 2026-04-13 14:10:37

80

Views

How come this grammar is unambiguous?

Published on 13 Apr 2026 - 14:10

score 42 · Answer 15 · 2026-04-11 10:52:46

42

Views

Are there general guidelines to make a grammar unambiguous?

Published on 11 Apr 2026 - 10:52

List Question

There is a sequence of operations on grammars of a string that strictly decreases the size of grammars down to the smallest grammer.

Find a CFG for L = { a^nb^m : n != m }

Creating the production for a CFG

Context Free Grammar for natural numbers

how to come up with a solution of finite or infinite language using context free grammer?

Can any Language that is generated LL1 Grammar is regular.?

Prove a language is Context Free

Chomsky Normal Form Details

How to prove not a CFL with pumping lemma?

How is this derivation possible in a context-free grammar?

Describe this language that is generated by Context Free Grammar

Chomsky Normal Form for Integer Recognition

Is the language $L = \{0^m1^n: m \neq n \}$ not context free?

How come this grammar is unambiguous?

Are there general guidelines to make a grammar unambiguous?

Trending Questions

Popular # Hahtags

Popular Questions