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
‹
9
›
:
Non-ambiguous CFG for
{
a
i
b
j
∣
i
≥
j
∨
i
≤
2
j
}
\{ a^i b^j \mid i\geq j \vee i\leq 2j \}
{
a
i
b
j
∣
i
≥
j
∨
i
≤
2
j
}
Write a
non-ambiguous
CFG generating the words of the form
a
i
b
j
a^ib^j
a
i
b
j
where the number of
a
a
a
’s is at least the number of
b
b
b
’s, or it is at most twice the number of
b
b
b
’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
.