Next: , Previous: , Up: Procedural Language Interpreter   [Index]

6.6 Procedural Program Execution

Program may be executed from start to finish via a single function call, or step by step.

See x1f4_ever_shuffle.

See x1f4_link_shuffle.

See x1f4_long_shuffle.

See x1f4_note_shuffle.

The single call program executors do not tend to tasks such as temporaries disposal, but some of the functions allow for a method to be called back after each successfully executed instruction. The method would perform the required keeing clean tasks, together with whatever else the application has on agenda.

When executing programs step by step each next instruction execution takes one function call. Such, the application initializes program execution and than for as long as the program execution hasn’t completed and application so desires, it executes the program instructions.

See x1f4_head_shuffle.

See x1f4_slip_shuffle.

See x1f4_step_shuffle.

See x1f4_tail_shuffle.

By and large, each coded expression translates to an executable instruction and control statements add each one or two extra executable instructions.

Before step by step execution programs need undergo some step by step execution required transform.

See x1f4_rail_shuffle.

The step by step program execution makes use of a (step by step) execution context, that has to be created before execution commences. Applications will like to dispose of such context once program execution completes.

See x1f4_near_shuffle.

See x1f4_side_shuffle.

Next: , Previous: , Up: Procedural Language Interpreter   [Index]