Chapter 3, Problem 16PS

Explanation of Solution

Consider the following BNF:

<assign> -> <id> = <expr>

<id> -> A|B|C

<expr> -> <expr> + <expr>

| <expr> * <expr>

|(<expr>)

|<id>

BNF:

Backus-Naur Form (BNF) is unambiguous and also it is precise. It is a formal and mathematical way of representation for specifying the context-free grammars. BNF is used to describe the syntax of the Algol 60 programming language...