Newbetuts
.
New posts in context-free-grammar
Construct grammar given the following language {a^n b^m | n,m = 0,1,2,...,n <= 2m} [closed]
grammar
context-free-grammar
computation-theory
context-sensitive-grammar
Show that minimal CFG is undecidable (Sipser 5.36)
computational-complexity
context-free-grammar
turing-machines
Context-free grammars versus context-sensitive grammars?
algorithm
parsing
grammar
context-free-grammar
context-sensitive-grammar
How to prevent duplications when generating strings from context free grammar
python
context-free-grammar
formal-languages
automata-theory
How to create a grammar for complement of $a^nb^n$?
formal-languages
context-free-grammar
A computer's memory is finite, so how can there be languages more powerful than regular?
computational-complexity
computability
formal-languages
context-free-grammar
regular-language
What is the language of this deterministic finite automata?
grammar
context-free-grammar
finite-automata
deterministic
Can a regular grammar be ambiguous?
automata
regular-language
context-free-grammar
Is D's grammar really context-free?
c++
grammar
context-free-grammar
d
Generating functions for context-free languages
combinatorics
generating-functions
formal-languages
context-free-grammar
Tips for creating "Context Free Grammar"
grammar
context-free-grammar
lexical-analysis
formal-languages
What are the differences between PEGs and CFGs?
regex
parsing
language-agnostic
context-free-grammar
peg
What programming languages are context-free?
compiler-theory
context-free-grammar
Difference between an LL and Recursive Descent parser?
parsing
grammar
context-free-grammar
recursive-descent
ll
What is a Context Free Grammar?
regex
parsing
grammar
context-free-grammar
Regular vs Context Free Grammars
context-free-grammar
regular-language
automata
Finding Context Free Grammar for a language
automata
context-free-grammar
pushdown-automata
Eilenberg's rational hierarchy of nonrational automata & languages
automata
formal-languages
semigroups
context-free-grammar
Determining Ambiguity in Context Free Grammars
computer-science
trees
context-free-grammar
An efficient way to determine if two context free grammars are equivalent?
computer-science
context-free-grammar
Prev
Next