A Stack Implementation of A Shift-Reduce Parser Stack Input Action $ id+id*id$shift Sid +id*id$ reduce by F→id Parse Tree SF +id*id$ reduce by T→F ST +id*id$ reduce by E→T E8 SE +id*id$ shift $E+ id*id$ shift E 3 T7 SE+id *id$ reduce by F→id SE+F *id$ reduce by T→F SE+T *id$ shift $E+T* id$ shift 1 id SE+T*id $ reduce by F→id SE+T*F $ reduce by T→T*F id SE+T $ reduce by E→E+T SE $ accept CS308 Compiler TheoryA Stack Implementation of A Shift-Reduce Parser Stack Input Action $ id+id*id$ shift $id +id*id$ reduce by F → id Parse Tree $ F +id*id$ reduce by T → F $ T +id*id$ reduce by E → T E 8 $E +id*id$ shift $E+ id id$ * shift E 3 + T 7 $E+id *id$ reduce by F → id $E+ F *id$ reduce by T → F T 2 T 5 * F 6 $E+T *id$ shift $E+T* id$ shift F 1 F 4 id $E+T*id $ reduce b y F → id $E+T*F $ reduce by T → T*F id id $E+T $ reduce by E → E+T $E $ t CS308 Compiler Theory 9 accep t