 Register  # 1.3. Grammars - Part 3 - Establishing Order of Operations¶

## 1.3.1. Evaluation of Expressions¶

In this module we will learn about

1. Operator precedence
2. Operator associativity
3. EBNF extensions and their advantages

In the previous module, we saw that ambiguous grammars are to be avoided because the parse trees that result from them lead to confusion when we attach semantic meaning to the structure of the parse tree. The tree cannot be relied on to specify the order of operations.

Although Example Grammar 1 does not suffer from ambiguity, it has another problem. In particular, if you return to the parse tree slide-show that accompanied Example Grammar 1, you will note that in parsing $A+B*C$, the $+$ operation was at a deeper level in the tree than $*$, thereby indicating that $A+B$ would be evaluated first and then multiplied by $C$. However that order of operation does not coincide with the operator precedence rules in almost every programming language. So Example Grammar 1, although unambiguous, is not the algebraic expression grammar that we need. Instead consider:

### 1.3.1.1. Example Grammar 3¶

$\begin{split}\begin{eqnarray*} <exp> &::=& <trm>\\ &|& <exp> + <trm> \\ &|& <exp> - <trm> \\ <trm> &:==& <fac> \\ &|& <trm> * <fac> \\ &|& <trm> / <fac> \\ <fac> &::=& <pri> \\ &|& ( <exp> ) \\ <pri> &:==& A | B | C | \ldots | X | Y | Z \end{eqnarray*}\end{split}$

Note how the parse tree in the slide-show below produced by Example Grammar 3 is different from the one produced by Example Grammar 1.

Settings Saving... Server Error
Resubmit

In particular, with Example Grammar 3, the sub-tree corresponding to the multiplication operator is at a deeper level than the sub-tree for addition, thereby corresponding to normal operator precedence in programming languages.

Below you have a slide-show "producer" for Example Grammar 3 that you can control by entering the expression for which you want a parse tree produced. You should experiment with producing a variety of slide-shows until you feel confident that you could manually construct the parse tree corresponding to any possible expression.

Once you feel confident working with parse trees, here are two questions to consider before you start on the review problems for this module.

Question 1: If you are designing a grammar corresponding to expressions, what is the strategy you would employ for introducing a different level of operator precedence -- one that is either higher or lower than that of other operators? How would this strategy play out with respect to Example Grammar 3 if you wanted to add an operator corresponding to exponentiation?

Question 2: In Example Grammar 3, operators on the same level of precedence associate in left-to-right fashion, that is, $A+B-C$ evaluates as the parenthesized expression $((A+B)-C)$. What about the grammar dictates this left-to-right associativity? How would you change the productions to achieve right-to-left associativity, that is, $(A+(B-C))$?

The review problem set for this module contains five review problems, the first four of which concern themselves with how a grammar dictates operator precedence and associativity. Do not start these problems until you have thought through answers to the two questions posed above.

The first problem illustrates how grammatical structure influences the evaluation of arithmetic expressions, and thus the semantics of programs. Note that, to get credit for the first problem, you must solve it correctly three times in a row because the question is randomized. After you get the question right one time, the Check Answer button will then allow you to proceed to the next instance of the question.

## 1.3.2. Associativity¶

This problem demonstrates how grammatical structure impacts the associativity property of arithmetic operators.

## 1.3.3. Precedence and Associativity¶

This problem illustrates how grammatical structure impacts the associativity property and order of precedence of arithmetic operators.

## 1.3.4. Characterizing a Language Given the BNF¶

This problem asks you to provide a characterization in English of the language generated by a BNF grammar. After you finish it, there is one more problem about Extended Backus-Naur Form, which is described before the problem.

## 1.3.5. Extended BNF¶

The symbols we have used in our representation of grammars collectively comprise what is known as Backus-Naur Form (BNF). In Extended Backus-Naur Form (EBNF) we add five meta-symbols to those already used in BNF notation:

1. Kleene closure operator $*$, which means "zero or more" Hence if $<fn\_name>$ were a non-terminal representing a valid function name and $<parameter>$ were a non-terminal representing a valid parameter, then the EBNF notation for function calls with zero or more parameters would be

$\begin{split}<fn\_name> "(" <parameter>* ")"\end{split}$
2. Positive closure operator $+$. The EBNF notation for function calls that must have at least one parameter would be

$\begin{split}<fn\_name> "(" <parameter>+ ")"\end{split}$
3. The two paired parenthesis symbols $( \; )$, which are used for grouping. For example, if $<positive\_number>$ were the non-terminal denoting a valid positive number, then the following EBNF would dictate that we must have a plus or minus sign preceding a number

$\begin{split}(+ | -) <positive\_number>\end{split}$
1. The "optional operator" $?$, which specifies that you can have zero or one of whatever grammatical structure precedes the operator. For example, if our language allowed an optional plus or minus sign in front of a number, we would use the EBNF

$\begin{split}(+ | -)? <positive\_number>\end{split}$

EBNF is used to reduce the number of productions a grammar needs to specify a language. However, it does not increase the expressive power of grammars, that is, any grammatical structure that can be expressed in EBNF can also be expressed in BNF if one is willing to use more productions.

This last problem is about the equivalence between a given BNF grammar (the same one as in part 4 above) and a smaller EBNF grammar.  