On 4/27/07, Larry Wall <[EMAIL PROTECTED]> wrote:
: Are you sure you want to guarantee left-to-right starting
: position order? If there are multiple processors available, and
: in a lazy context, it may be preferrable to not guarantee any
: order. Then, if one processor that starts at a later position
: but which finds a match quickly while another processor starts
: earlier but needs to take a lot longer to find its first match,
: the lazy processing can start working on the first match found
: at the earliest possible time.
No, I'm not sure, which is why I put in the conjectures. :-)
Right. It's a tricky issue from an implementation standpoint. A
backtracking NFA most naturally implements it in left-to-right
starting position order, whereas a DFA most naturally implements it in
left-to-right *ending* position order.
Hmm, do we have lazy sets?
Luke
