CFGs, derivations, derivations treesUnless stated otherwise, the base alphabet in this problem set is = {0,1}.
Now the vocabulary is S={0,1,(),cup ,**,(O)/(,)e}. Construct a CFG that generates exactly Regular Expressions, such as (0cup (10)**1)**
Write down the derivation of the RE (Ocup (10)**1)**.
Hint: Look at the recursive definition of REs in the handout. It works with one non-terminal symbol.
4. Now the vocabulary is S = { o, 1, (, ), u, * , , e }. Construct a CFG that generates exactly Regular Expressions, such as (0 (10)*1)*
Write down the derivation of the RE (o u (1o)*1)*
Hint: Look at the recursive definition of REs in the handout. It works with one non-terminal sumbol.