course : Compilation Techniques

Based this table, please draw Go To Transition Diagram. make sure the image is clear and easy to understand!

Goto Kernel state closure E-> . E 0 E -> .E; E -> .T; E-> .E ATT-> .F; T =>.TME; F->.(E); F-> .Int} goto (0, E) E-> E.; E-> E.AT 12 E-> E.; E-> E.A T; A -> .+; A => .-) goto (0, T) LE=> 1T => T.ME) 2 E => T.; T => T.ME: M -> .; M -> ./1 goto (0, E) {T-> E.) goto (0, 0) E-> (.E] 4 F-> (.E); E-> .T; E-> .E A T; T -> .F; T -> .TMF; E-> .(E); F-> .int goto (0, int) IE -> Int.) 5 F->int.) goto (1, A) E -> EA.T) 6 IE -> EA.T; T -> .F; T =>.T MF;F>. (E); F->int) goto (1, +) IA-> 7 LA -> +) goto (1,-) IA -> -. ) 8 (A -> -. goto (2, M) (T-> T M.F IT -> T M.F; F>. (E); E-> .int) goto (2) IM -> 10 M -> ..) goto (2,/ IM -> 7.2 11 goto (4, E) E-> (E.): E -> E.AT 12 E-> (E.); E -> E.AT; A-> .+; A -> .-) goto (4, T) (E-) 1.T-> T.MF) 2 goto (4, E) (T-> F. 3 goto (4,0) F-> (E) 14 Igoto (4, int) E-> Int.) 5 goto (6, 1) LE -> EAT. T => T.M F1 13 E-> EAT.; T -> T.M E; M -> .; M =>./} goto (6, F) (T-> F.) 3 goto (6, 6) IF-> (.E)} 4 goto (6, int) > Int.) 5 goto (9, E) IT-TNE.) T-> T ME.) goto (9, 0) LE -> (E) 14 goto (9, int) -> int.) 5 goto (12) 15 goto (12, A) E-> EA.T) 6 goto (12+) A => + ) 17 goto (12,-) A->-. goto (13, M) IT -> TME 9 goto (13) TM -> 10 goto (13, 7) M-> 111