StackOverflow Questions for Tag: context-free-language

imahmadrezas

Reputation: 3

Pathway to build LL-parser

parsinggrammarcontext-free-grammarll-grammarcontext-free-language

Score: 0

Answers: 0

Shahin Ghasemi

Reputation: 1759

How to convert cfg to pda with 2 states?

context-free-grammarformal-languagescontext-free-language

Score: 1

Answers: 2

Pedram

Reputation: 1

Prove that the following language is not a context-free

context-free-languagepumping-lemma

Score: 0

Answers: 2

Laurence

Reputation: 157

Deterministic Context-Free Grammar versus Context-Free Grammar?

parsingprogramming-languagesbig-ocontext-free-grammarcontext-free-language

Score: 5

Answers: 1

rideau

Reputation: 1

NLTK tell if word is generated by CFG

nltkcontext-free-grammarcontext-free-languagecykearley-parser

Score: 0

Answers: 1

Kapil

Reputation: 113

Why pumping lemma for context free languages do not have bound on first part of string?

context-free-languagepumping-lemma

Score: 1

Answers: 0

Cmôn

Reputation: 23

Is this languages REGULAR / CONTEXT FREE but not REG / Nothing?

context-free-grammarregular-languagecontext-free-language

Score: -2

Answers: 1

zephyrus

Reputation: 1

what is the Context-Free Grammar for the following language?

context-free-grammarregular-languagensregularexpressioncontext-free-languageautomata-theory

Score: 0

Answers: 1

Fatemeh_taj

Reputation: 23

CFG for L={ a^n b^m : n <= m+3 , n,m>=0}

context-free-grammarcontext-free-language

Score: 1

Answers: 1

RipLearning

Reputation: 11

Can this language be expressed with a regular expression?

regexcontext-free-grammarregular-languagefinite-automatacontext-free-language

Score: 0

Answers: 1

S.EB

Reputation: 2226

Is there any way to count the production of specific rules in order in a context free grammar?

compiler-constructiongrammarcontext-free-grammarregular-languagecontext-free-language

Score: 0

Answers: 0

Lilith X

Reputation: 99

Are there any languages such that they are proper subsets of each other and satisfy these conditions

regexregular-languageformal-languagescontext-free-language

Score: 2

Answers: 2

Ronald

Reputation: 187

Is the language L = { a^n b^j : j ≤ n ≤ 2j − 1 } context-free?

formal-languagescontext-free-language

Score: -1

Answers: 1

AIM

Reputation: 137

Trying to prove that the complement of {a^i b^i c^i} is a context-free

subsetcontext-free-grammarcontext-free-language

Score: 0

Answers: 1

Aries

Reputation: 1

Specification of DFA accepting 𝐿≡∪𝑛∈N𝐿𝑛

complexity-theorycontext-free-grammarregular-languagecomputation-theorycontext-free-language

Score: 0

Answers: 0

user18470316

Reputation:

How can I define ε when I'm writing the grammar rules in parsing code?

pythonyacclexcontext-free-grammarcontext-free-language

Score: 1

Answers: 1

Alex

Reputation: 13

CFG for L = {a^mb^nc^k: k = m×n}

context-free-grammarcontext-free-language

Score: 0

Answers: 1

Pratik Hadawale

Reputation: 147

In Context Free Grammer, do we replace all variable during a substitution? or can we apply substitution rule to only of the variable of same type?

theorycontext-free-grammarautomatacontext-free-languageautomata-theory

Score: 1

Answers: 1

leander

Reputation: 33

CFG for a = b and c = d (length)

context-free-grammarcomputation-theorycontext-free-languageautomata-theory

Score: -1

Answers: 1

sarkle

Reputation: 23

CFG for a^n b^3m c d^m e f^2n with m, n > 0

context-free-grammarcontext-free-language

Score: 1

Answers: 2

PreviousPage 1Next

StackOverflow Questions for Tag: context-free-language

Pathway to build LL-parser

How to convert cfg to pda with 2 states?

Prove that the following language is not a context-free

Deterministic Context-Free Grammar versus Context-Free Grammar?

NLTK tell if word is generated by CFG

Why pumping lemma for context free languages do not have bound on first part of string?

Is this languages REGULAR / CONTEXT FREE but not REG / Nothing?

what is the Context-Free Grammar for the following language?

CFG for L={ a^n b^m : n &lt;= m+3 , n,m&gt;=0}

Can this language be expressed with a regular expression?

Is there any way to count the production of specific rules in order in a context free grammar?

Are there any languages such that they are proper subsets of each other and satisfy these conditions

Is the language L = { a^n b^j : j ≤ n ≤ 2j − 1 } context-free?

Trying to prove that the complement of {a^i b^i c^i} is a context-free

Specification of DFA accepting &#119871;≡∪&#119899;∈N&#119871;&#119899;

How can I define ε when I&#39;m writing the grammar rules in parsing code?

CFG for L = {a^mb^nc^k: k = m&#215;n}

In Context Free Grammer, do we replace all variable during a substitution? or can we apply substitution rule to only of the variable of same type?

CFG for a = b and c = d (length)

CFG for a^n b^3m c d^m e f^2n with m, n &gt; 0

CFG for L={ a^n b^m : n <= m+3 , n,m>=0}

Specification of DFA accepting 𝐿≡∪𝑛∈N𝐿𝑛

How can I define ε when I'm writing the grammar rules in parsing code?

CFG for L = {a^mb^nc^k: k = m×n}

CFG for a^n b^3m c d^m e f^2n with m, n > 0