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
‹
11
›
:
Non-ambiguous CFG for
{
a
i
b
j
c
k
∣
j
=
i
+
k
}
\{ a^i b^j c^k \mid j=i+k \}
{
a
i
b
j
c
k
∣
j
=
i
+
k
}
Write a
non-ambiguous
CFG generating the words of the form
a
i
b
j
c
k
a^i b^j c^k
a
i
b
j
c
k
such that the number of
b
b
b
’s coincides with the number of
a
a
a
’s plus the number of
c
c
c
’s.
Authors:
Guillem Godoy /
Documentation:
// Write your CFG here...
To be able to submit you need to either
log in
,
register
, or
become a guest
.