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
‹
19
›
:
Non-ambiguous CFG for
{
w
∈
{
a
,
b
}
∗
∣
w
=
w
R
∧
∣
w
∣
a
b
a
>
0
}
\{ w \in \{a,b\}^* \mid w=w^R \wedge |w|_{aba}>0 \}
{
w
∈
{
a
,
b
}
∗
∣
w
=
w
R
∧
∣
w
∣
aba
>
0
}
Write a
non-ambiguous
CFG generating the palindromic words over
{
a
,
b
}
\{a,b\}
{
a
,
b
}
with some occurrence of
a
b
a
aba
aba
.
Authors:
Guillem Godoy /
Documentation:
// Write your CFG here...
To be able to submit you need to either
log in
,
register
, or
become a guest
.