Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. Pages: 76. Chapters: Accumulator, Iteration, Exception handling, Program counter, Control table, Continuation, Exception handling syntax, Eval, Tail call, For loop, Goto, Foreach, Setjmp.h, Main function, Hooking, Event loop, Left recursion, COMEFROM, While loop, Setcontext, Signal, Microsoft-specific exception handling mechanisms, Do while loop, Hardware register, Delimited continuation, Fiber, Conditional loop, Status register, Zahn's construct, Deferred Procedure Call, Inner loop, Branch, User exit, Index register, J operator, Stack register, Indirect branch, Loop counter, Label, Entry point, Exception guarantees, Wild branch, Fast path, Join point, Engine. Excerpt: Control tables are tables that control the program flow or play a major part in program control. There are no rigid rules concerning the structure or content of a control table - its only qualifying attribute is its ability to direct program flow in some way through its 'execution' by an associated interpreter. The design of such tables is sometimes referred to as table driven design. In some cases, control tables can be specific implementations of finite state machine-based automata-based programming. Control tables often have the equivalent of conditional expressions or function references embedded in them, usually implied by their relative column position in the association list. Control tables reduce the need for programming similar structures or program statements over and over again. The two-dimensional nature of most tables makes them easier to view and update than the one-dimensional nature of program code. In some cases, non-programmers can be assigned to maintain the control tables. similar to bytecode - but usually with operations implied by the table structure itself The tables can have multiple dimensions, of fixed or variable lengths and are usually portable...