| OCR Text |
Show 74 . transitions, FORKs, JOINs, branches, both unconditional and conditional outputs in states and during transitions, and the program. Appendix C contains all the information needed to decipher compilation of complex boolean expressions for conditions on' transitions and output generation. controlunit CompileTest9: inputs: BIG := 11 and (12 or not 13); statemachine'Test9: starts tate A: forkon BIG to B,C; moveon NOT BIG to D; hold 01,02; reset 03; set 04; end; state B: joins C on 14 AND 15 to F; joins E on 14 OR IS 'to F; hold 01; if 13 then set 03; if 14 OR IS then begin reset 04; hold 02,05; end; end; state C: moveon NOT 16 to E; joins B on 16 to F doing begin reset 03; if BIG then set 04; end; hold 01; end; state D: moveon 17 to F doing set 03; end; state E: joins B on TRUE to F; end ; state F: moveon ns to A; moveon NOT I to D; end; end; end. Figure 11 shows a Computervision image of the resulting PPL this representation. This compilation took approximately minutes and resulted in a |
