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
‹
30
›
:
Non-ambiguous CFG for
{
w
∈
{
a
,
b
,
c
}
∗
∣
∣
w
∣
a
+
∣
w
∣
b
=
∣
w
∣
c
}
\{ w \in \{a,b,c\}^* \mid |w|_a+|w|_b=|w|_c \}
{
w
∈
{
a
,
b
,
c
}
∗
∣
∣
w
∣
a
+
∣
w
∣
b
=
∣
w
∣
c
}
Write a
non-ambiguous
CFG generating the words over
{
a
,
b
,
c
}
\{a,b,c\}
{
a
,
b
,
c
}
such that the number of occurrences of
a
a
a
plus the number of occurrences de
b
b
b
coincides with the number of occurrences of
c
c
c
.
Authors:
Guillem Godoy, Carles Creus /
Documentation:
// Write your CFG here...
To be able to submit you need to either
log in
,
register
, or
become a guest
.