Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Search and match variable length wildcards #27

Open
nishihatapalmer opened this issue Nov 16, 2020 · 1 comment
Open

Search and match variable length wildcards #27

nishihatapalmer opened this issue Nov 16, 2020 · 1 comment

Comments

@nishihatapalmer
Copy link
Owner

There is a middle ground between fixed length sequences that byteseek currently supports, and full regular expressions (which needs a lot more dev and test). We can support wildcards between sequence elements.

.* wildcards: A sequence like 01 02 .* 03 04 can be matched easily (01 02, then search for 03 04).
.{1,4} variable length wildcards. A sequence like 01 02 03 .{1,4} 04 05 can be matched as 01 02 03, then search for 04 05.

Also need to support backtracking (optionally).

@nishihatapalmer
Copy link
Owner Author

nishihatapalmer commented Nov 16, 2020

To support all of the matching performed by the DROID application, it would also have to support alternative sequences ('one' | 'two' | 'three'). This would be a bit more complex than just having variable length wildcards, but probably not a lot more.
It would require at least some of the multi-pattern matching currently at incubator stage to be promoted to fully tested and supported.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Projects
None yet
Development

No branches or pull requests

1 participant