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 64 · Answer 1 · 2026-03-25 07:45:47

64

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 25 Mar 2026 - 7:45

score 52.8k · Answer 2 · 2014-03-30 21:15:28

52.8k

Views

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

Published on 30 Mar 2014 - 21:15

score 198 · Answer 3 · 2014-04-01 02:48:38

198

Views

Creating the production for a CFG

Published on 01 Apr 2014 - 2:48

score 783 · Answer 4 · 2014-04-02 10:41:41

783

Views

Context Free Grammar for natural numbers

Published on 02 Apr 2014 - 10:41

score 51 · Answer 5 · 2014-04-02 20:24:39

51

Views

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

Published on 02 Apr 2014 - 20:24

score 273 · Answer 6 · 2014-04-03 22:47:00

273

Views

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

Published on 03 Apr 2014 - 22:47

score 690 · Answer 7 · 2014-04-04 17:20:49

690

Views

Prove a language is Context Free

Published on 04 Apr 2014 - 17:20

score 137 · Answer 8 · 2014-04-04 18:05:56

137

Views

Chomsky Normal Form Details

Published on 04 Apr 2014 - 18:05

score 398 · Answer 9 · 2014-04-05 23:03:35

398

Views

How to prove not a CFL with pumping lemma?

Published on 05 Apr 2014 - 23:03

score 122 · Answer 10 · 2014-04-08 20:56:37

122

Views

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

Published on 08 Apr 2014 - 20:56

score 66 · Answer 11 · 2014-04-09 14:28:51

66

Views

Describe this language that is generated by Context Free Grammar

Published on 09 Apr 2014 - 14:28

score 163 · Answer 12 · 2026-03-25 07:38:23

163

Views

Chomsky Normal Form for Integer Recognition

Published on 25 Mar 2026 - 7:38

score 915 · Answer 13 · 2014-04-17 17:08:25

915

Views

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

Published on 17 Apr 2014 - 17:08

score 77 · Answer 14 · 2014-04-24 02:57:32

77

Views

How come this grammar is unambiguous?

Published on 24 Apr 2014 - 2:57

score 39 · Answer 15 · 2014-04-24 03:19:12

39

Views

Are there general guidelines to make a grammar unambiguous?

Published on 24 Apr 2014 - 3:19

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