If I have the grammar : E->E*F | F+E |F F->id , Now here although + and * are defined at the same level , with different associativity but this grammar produces 2 different parse trees for the string id+id*id , so here we can't make any generalization regarding precedence of the operators although they are defined at the same level . So what conclusion can be drawn from this ?
asked
Mar 19, 2018
in Compiler Design
radha gogia
315 views