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
‹
45:
CFG for
{
a
n
b
m
c
k
d
t
∣
n
=
m
∨
n
=
k
∨
n
=
t
}
\{ a^n b^m c^k d^t \mid n=m \vee n=k \vee n=t \}
{
a
n
b
m
c
k
d
t
∣
n
=
m
∨
n
=
k
∨
n
=
t
}
Write a CFG (
which will be ambiguous
) generating the words of the form
a
n
b
m
c
k
d
t
a^n b^m c^k d^t
a
n
b
m
c
k
d
t
where the amount of
a
a
a
’s equals the amount of
b
b
b
’s or the amount of
c
c
c
’s or the amount of
d
d
d
’s.
Authors:
Carles Creus, Guillem Godoy /
Documentation:
// Write your CFG here...
To be able to submit you need to either
log in
,
register
, or
become a guest
.