Compiler Theory help

[idhasitha]

machan menna meka kragana help ekak dipalakoo

Given the grammar E ---> E+E | E-E | E*E | (E) | -E | id and the operator precedence table below, show how the string (id – id) * id will be parsed by

·Shift-reduce parser
·Operator precedence parser
In both cases, you must clearly show all the steps in the parsing process.

 

[idhasitha]

bupppp

 

[srijayanath2002]

E->E*E
E->(E)*E
E->(E-E)*E
E->(ID-ID)*ID
Do not know answer is correct

 

[idhasitha]

bmpp

 

[idhasitha]

bumpp

 

[idhasitha]

bumpp

 

[idhasitha]

bumppp