8 views

Construct unambiguous context-free grammars for each of the following languages. In each case show that your grammar is correct.

1.  Arithmetic expressions in postfix notation.
2. Left-associative lists of identifiers separated by commas.
3. Right-associative lists of identifiers separated by commas.
4. Arithmetic expressions of integers and identifiers with the four binary operators $+, -, *, /$.
5. Add unary plus and minus to the arithmetic operators of $(d)$.

| 8 views