PROG$24310$: C Programming Language

Evaluation: $,10$ points, $10\%$ of your final grade.

Due date: See SLATE.

Late submission: $10\%$ per day penalty, up to $3$ days.

Problem N$1(3$ points$).$

You have the following context$-$free gramma:

$S$BAA

$A$Aab$|b$

$BBa|b$

Using the grammar above, is it possible to derive a string "baababbabab" $?$

If so$,$ please provide the derivation process and build the abstract syntax tree.

Is this grammar ambiguous? If so$,$ you need to explain why it is ambiguous $($please

provide an alternative AST$)$ or explain why you cannot build an alternative AST.