Prepare
A macro has been parsed up to a section checkpoint (§). Make a copy of the parse stack, then perform the equivalent of an AppendArgument on the copy, the specified number of times minus one (because zero is not a legal operand). Make it into a single list phrase and push it onto the original parse stack. It will be consumed by a subsequent RunPrefixFunction.
This instruction is detected specially by the message bundle tree's expand operation. Its successors are separated into distinct message bundle trees, one per message bundle.
Properties
Whether this operation can run successfully if there is a pre-parsed first argument that has not yet been consumed.
Assume that the instruction encodes an operand that represents the index of an argument to be checked (for grammatical restrictions): answer the operand.
Whether this instance commutes with ParsePart instructions.
A Statistic that records the number of nanoseconds spent while expanding occurrences of this ParsingOperation.
Assume that the instruction encodes an operand that represents a message part index: answer the operand. Answer 0 if the operand does not represent a message part.
A Statistic that records the number of nanoseconds spent while executing occurrences of this ParsingOperation.
Functions
Given a ParsingOperation, answer an equal operation object that is equal to it, possibly itself, such that all invocations of intern with equal operations will produce the same object. It uses the weak internedInstructions map(s).
Given a program counter, answer the list of successor program counters that should be explored. For example, a BranchForward instruction will need to visit both the next program counter and the branch target.