RACSO
R
DFA
CFG
Operations:
Reg
,
CF
PDA
Reductions:
K
,
WP
,
CFG
,
NP
,
SAT
ANTLR:
lex
,
syn
Exams
log in
,
register
,
guest
This site uses cookies only for the purpose of identifying user sessions. This is required to properly register actions.
Exercise
‹
13
›
:
CFG for
{
a
n
0
b
a
n
1
b
…
a
n
m
−
1
b
a
n
m
∣
m
≥
1
∧
∃
i
∈
{
1
,
…
,
m
}
:
(
n
0
=
n
i
)
}
\{ a^{n_0} b a^{n_1} b \ldots a^{n_{m-1}} b a^{n_m} \mid m\geq 1 \wedge \exists i\in\{1,\ldots,m\}: (n_0 = n_i) \}
{
a
n
0
b
a
n
1
b
…
a
n
m
−
1
b
a
n
m
∣
m
≥
1
∧
∃
i
∈
{
1
,
…
,
m
}
:
(
n
0
=
n
i
)}
Write a CFG (
which will be ambiguous
) generating the words of the form
a
n
0
b
a
n
1
b
…
a
n
m
−
1
b
a
n
m
a^{n_0}ba^{n_1}b\ldots a^{n_{m-1}} b a^{n_m}
a
n
0
b
a
n
1
b
…
a
n
m
−
1
b
a
n
m
for which there exists an
i
∈
{
1
,
…
,
m
}
i\in\{1,\ldots,m\}
i
∈
{
1
,
…
,
m
}
such that
n
0
=
n
i
n_0=n_i
n
0
=
n
i
.
Authors:
Guillem Godoy /
Documentation:
// Write your CFG here...
To be able to submit you need to
log in
,
register
, or
become a guest
.