The interesting aspect of implementing Circuits With Multiple Inner Contexts is that their very structure suggests the order in which each of their pieces should be created.
In other words, the point of viewing the circuit as a whole is to evaluate it for some arguments. If we see the circuit’s inner parts in terms of a graph, implementing the circuit is equivalent to coloring each node of the graph while traversing it. Therefore, a suitable implementation technique in these situations is to take enough example arguments so that their corresponding evaluations will require the circuit’s graph to be completely painted with our implementations.
~
A Mentoring Course on Smalltalk, p. 104
We play the role of a JIT compiler.
~
This is what we did when we went over an example of how our bidirectional approach to `match:` would work earlier in this chapter. So again, it is all about some sort of Connectedness Check in a graph, or traversing an information space either towards its attractors or visiting all possible locations. The Laws of Form are present everywhere.
So, for our concrete purposes, we will concentrate on the expression below.
’a#c*fg#ij*x#z’ matches: ’abcQQfgfghijQQxyz’
[…]