RACSO
DFA
CFG
Operations:
Reg
,
CF
PDA
Reductions:
K
,
WP
,
CFG
,
NP
,
SAT
ANTLR:
lexical
,
syntactic
Exams
log in
,
register
,
become guest
This site uses cookies only for the purpose of identifying user sessions. This is required to properly register actions.
Exercise
‹
39
›
:
Non-ambiguous CFG for the complement of
{
a
n
b
n
∣
n
≥
0
}
\{ a^n b^n \mid n\geq 0 \}
{
a
n
b
n
∣
n
≥
0
}
Write a
non-ambiguous
CFG generating the language of words over
{
a
,
b
}
\{a,b\}
{
a
,
b
}
that are not of the form
a
n
b
n
a^nb^n
a
n
b
n
, where
n
≥
0
n\geq 0
n
≥
0
.
Authors:
Guillem Godoy /
Documentation:
// Write your CFG here...
To be able to submit you need to either
log in
,
register
, or
become a guest
.