TheoryOfComputers$-$ThirdTest$-2020(3)$

Mailings

Review View

Tell me

AaBbCcDdEe

AaBbCcDdEe

AaBbCcDc

AaBbCcDdE $lon$

Normal

No Spacing

Heading $1$

Heading $2$

$\{a^n{b}^m{c}^k|n+m=k\}$

Application BNF $($Backus$-$Naus Form$)(10\%)$

Write a complete left$-$most derivation of the stringApplication BNF $($Backus$-$Naus Form$)(10\%)$Write a single BNF production rule that is equivalent to the following context$-$free grammar

$S$aSaS

$bB$

$BbB$

$B$

Parsing and Parse Trees$(10\%)$

Draw three different parse trees for the string ababbaab based on the following grammar $G$ :

$SSS$

$S$aSb

$S$bSa

$S$