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
‹
34
›
:
Unambiguous CFG for
{
x
c
y
∣
x
,
y
∈
{
a
,
b
}
∗
∧
∣
x
∣
a
b
a
=
∣
y
∣
b
a
b
}
\{ xcy \mid x,y\in\{a,b\}^* \wedge |x|_{aba}=|y|_{bab} \}
{
x
cy
∣
x
,
y
∈
{
a
,
b
}
∗
∧
∣
x
∣
aba
=
∣
y
∣
bab
}
Write an
unambiguous
CFG generating the words of the form
x
c
y
xcy
x
cy
, where
x
,
y
x,y
x
,
y
are words over
{
a
,
b
}
\{a,b\}
{
a
,
b
}
such that the number of occurrences of
a
b
a
aba
aba
in
x
x
x
is equal to the number of occurrences of
b
a
b
bab
bab
in
y
y
y
.
Authors:
Guillem Godoy /
Documentation:
// Write your CFG here...
To be able to submit you need to
log in
,
register
, or
become a guest
.