David Mertens was talking about numerical regular expressions back in 2009.  
(See http://mailman.jach.hawaii.edu/pipermail/perldl/2009-August/002018.html)  
But I don't know what (if anything) came from that.  I don't see anything 
obvious on his github.

On Sep 1, 2013, at 8:14 AM, Chris Marshall wrote:

> I have a 1-D byte sequence for which I would like
> to find sequences of bytes starting matching various
> templates like:
> 
>  start-byte any-byte 45 (sequence of non-0 bytes) 0
> 
> which, I realize could be done as pattern matching
> and tokenizing via regular expressions.  I haven't
> found a convenient method to do so in PDL but it
> seems one approach might be something like a
> convolution but using XOR and orover to combine
> values rather than multiply and addition.
> 
> I would like to avoid reinventing the wheel if possible.
> 
> Thoughts?
> Chris
> 
> _______________________________________________
> Perldl mailing list
> [email protected]
> http://mailman.jach.hawaii.edu/mailman/listinfo/perldl
> 


_______________________________________________
Perldl mailing list
[email protected]
http://mailman.jach.hawaii.edu/mailman/listinfo/perldl

Reply via email to