Question

Check ambiguity, operators’ precedence and associativity (

2) <E> → id | <E> - id | <E> * id

Answer 1

A grammar is said to ambiguous if for any string generated by it, it produces more than one-

• Parse tree
• Or derivation tree
• Or syntax tree
• Or leftmost derivation
• Or rightmost derivation

Here 3 parse tree can be generarated by the grammer

as

< E >                                 < E >                                          < E >

   |                                         |                                                  |

id                                      -id                                                *id

so the grammar is ambiguos

operator precedence

A grammar is said to be operator precedence grammar if it has two properties:

• No R.H.S. of any production has a.
• No two non-terminals are adjacent.

here it have no and no other non terminals

*>-

For an grammar to be associative it should be unambiguos but here the grammar is ambiguos so its not an associative grammar