Construct unambiguous context-free grammars for each of the following languages. In each case show that your grammar is correct.
a) Arithmetic expressions in postfix notation
b) Right - associative lists of identifiers separated by commas
c) Left- associative lists of identifiers separated by commas
d) Arithmetic expressions of integers and identifiers with the four binary operators.