Using the new framing format, we now have liked nests of frames, each frame representing a comma open description of the current pointer and overload for one o the two tables, self and other.
Now, G machine wants to make an assumption. At any given pointm, when self and other have their top frames in canonical form (commad and dot without overload) then G should execute the general sql: select where keywords match, links maybe match, and no overload operator in either link!
That last condition might come from a compound operator, it interrupts G and notifies G that a light weight operator has intruded. G machine, at the interruption, as all pointers up to date in frames for both self and other, at the time of the interruption. G can restart the query any time after the new operator has run through the triple machine.
So, down in the middle of a 10,000 word match, the client wants a three word sequence match and wants to suddenly deliver it in some special format, he introduces a schema operator. Not a problem, G should just kick in a new frame, execute the traversals associated with the new schema. When new frame is exhausted, exhausted, close that schema frame, restart the top two frames for self and other.
Thusly, we can relieve the grammaticists from having to develop context specific grammar, we just mainly have to agree on some customary results when we mix and entangle light weight operators.
No comments:
Post a Comment