equal
deleted
inserted
replaced
191 (ii) rules of the form $B ::= B \cdot B$ are always ambiguous $B \cdot B\cdot B$ |
191 (ii) rules of the form $B ::= B \cdot B$ are always ambiguous $B \cdot B\cdot B$ |
192 (iii) this is fine |
192 (iii) this is fine |
193 (iv) same as (ii) $E\cdot + \cdot E \cdot + \cdot E$ |
193 (iv) same as (ii) $E\cdot + \cdot E \cdot + \cdot E$ |
194 } |
194 } |
195 |
195 |
196 \item Suppose the string $``9-5+2''$. Give all ASTs that |
196 \item Suppose the string $``9-5+2''$. Give all parse trees that |
197 the following two grammars generate for this string. |
197 the following two grammars generate for this string. |
198 |
198 |
199 Grammar 1, where List is the starting symbol: |
199 Grammar 1, where List is the starting symbol: |
200 |
200 |
201 \begin{center} |
201 \begin{center} |