concept abstract state machine in category c
appears as: abstract state machine, bstract state machine, n abstract state machine
Basically, what we have discussed up to this chapter always had well-defined behavior, so the abstract state machine is always in a well-defined state. Signed arithmetic changes this, so as long as you don’t need it, avoid it. We say that a program performs a trapC (or just traps) if it is terminated abruptly before its usual end.
As a consequence, all computation is fixed through the values, types, and their binary representations that are specified in the program. The program text describes an abstract state machineC that regulates how the program switches from one state to the next. These transitions are determined by value, type, and binary representation only.
double f(double a); // Equivalent calls to f, steps in the abstract state machine f(3); // Decay → call (&f)(3); // Address of → call (*f)(3); // Decay → dereference → decay → call (*&f)(3); // Address of → dereference → decay → call (&*f)(3); // Decay → dereference → address of → call !@%STYLE%@! {"css":"{\"css\": \"font-weight: bold;\"}","target":"[[{\"line\":0,\"ch\":0},{\"line\":0,\"ch\":6}],[{\"line\":0,\"ch\":0},{\"line\":0,\"ch\":6}]]"} !@%STYLE%@!
