Re^2: Growing strings in search

Sounds like you are describing "flex" or "lex". That makes this problem simple, just run a "flex" process against each individual string doing incremental reads -> problem solved :)

Comment on Re^2: Growing strings in search

Replies are listed 'Best First'.
Re^3: Growing strings in search by roboticus (Chancellor) on Apr 15, 2020 at 23:03 UTC
tybalt89: Yes, it's very much like that. ...roboticus When your only tool is a hammer, all problems look like your thumb.	[reply]
Re^3: Growing strings in search by AnomalousMonk (Archbishop) on Apr 16, 2020 at 03:00 UTC
I've never done anything significant with `f?lex` and it's been a long, long time since I've even read anything about its/their capabilities, but don't they have the same inherent "time-forward", if you will, orientation that regex compilers have? IOW, if you had a flex process that parsed backwards, it would be easy to use, but isn't the big trick to design such a process in the first place? Can you expand on the capabilities of flex in this regard? Give a man a fish: `<%-{-{-{-<`	[reply] [d/l] [select]