List questions from context-free-grammar

Published on 25 Mar 2026 - 1:39

3.7k

Views

context free grammar to deterministic finite-state automaton

Published on 04 Aug 2016 - 5:52

151

Views

I am confused about how epsilon works in parsing tables (or my book is wrong)?

Published on 25 Mar 2026 - 22:44

254

Views

Does the fact that $L_1L_2$ and $L_2L_1$ are both regular imply that at least one between $L_1$ and $L_2$ is regular?

Published on 13 Aug 2016 - 9:09

2.6k

Views

Is there any language that $\bar L^= (\bar L)^$?

Published on 25 Mar 2026 - 9:38

515

Views

Can a context-sensitive grammar have an empty string?

Published on 26 Aug 2016 - 3:15

2.5k

Views

Find CFGs that generate the regular language for all strings with exactly one a or one b

Published on 28 Aug 2016 - 19:57

164

Views

Conversion into GNF of a given language

Published on 10 Sep 2016 - 9:51

39

Views

Unable to get a terminal at the start for the GNF

Published on 23 Sep 2016 - 6:23

42

Views

Translate Grammar to plain english

Published on 27 Sep 2016 - 19:50

364

Views

correct disambiguation of a grammar?

Published on 29 Sep 2016 - 2:46

823

Views

Single state PDA for $L = \{ a^nb^n \mid n\ge 0 \}$

Published on 09 Oct 2016 - 19:14

62

Views

Give a context free grammar for the language

Published on 10 Oct 2016 - 1:34

6.8k

Views

The context free grammar for language $L = \{a^nb^mc^k \mid k = |n - m|, n≥0,m≥0,k≥0\}$ is

Published on 25 Mar 2026 - 11:16

491

Views

Construct context-free grammar with double restriction on amount of a's and b's?

Published on 15 Oct 2016 - 13:37

List Question

CFG and Regularity of Two Language?

context free grammar to deterministic finite-state automaton

I am confused about how epsilon works in parsing tables (or my book is wrong)?

Does the fact that $L_1L_2$ and $L_2L_1$ are both regular imply that at least one between $L_1$ and $L_2$ is regular?

Is there any language that $\bar L^= (\bar L)^$?

Can a context-sensitive grammar have an empty string?

Find CFGs that generate the regular language for all strings with exactly one a or one b

Conversion into GNF of a given language

Unable to get a terminal at the start for the GNF

Translate Grammar to plain english

correct disambiguation of a grammar?

Single state PDA for $L = \{ a^nb^n \mid n\ge 0 \}$

Give a context free grammar for the language

The context free grammar for language $L = \{a^nb^mc^k \mid k = |n - m|, n≥0,m≥0,k≥0\}$ is

Construct context-free grammar with double restriction on amount of a's and b's?

Trending Questions

Popular # Hahtags

Popular Questions