内容简介:Did you ever want to match a regex, but all you had was a fat32 driver? Ever wanted to serialize your regex DFAs into one of the most widely supported formats used by over 3 billion devices?Worry no more, withTo run it, you can
regex2fat
Did you ever want to match a regex, but all you had was a fat32 driver? Ever wanted to serialize your regex DFAs into one of the most widely supported formats used by over 3 billion devices? Are directory loops your thing?
Worry no more, with regex2fat
this has become easier than ever before!
With just a little regex2fat '[YOUR] F{4}VOUR{1,7}E (R[^E]G)*EX HERE.' /dev/whatever
, you will have a fat32 regex DFA of your favourite regex.
For example, to see whether the string 'Y FFFFVOURRE EX HEREM'
would match, just mount it and check if '/Y/SPACE/F/F/F/F/V/O/U/R/R/E/SPACE/E/X/SPACE/H/E/R/E/M/MATCH'
exists.
To run it, you can install cargo
and then run cargo install regex2fat
(or compile it directly from this repo).
If you have the cargo bin directory in your path, you should be able to invoke it like described above.
The file created will be a fat32 image, which can probably be mounted or put on a drive in some way, but most likely shouldn't.
FAQ
Q: How does this work?
A: Regular regexes (i.e. no backreferences and similar advanced features) can be turned into a so called DFA (deterministic state automaton). This is basically a bunch of arrows going between states, where an arrow is labeled with a letter so that a letter in a state causes the current state to go along the arrow to another state, with a subset of states being accepting. Yes, I'm bad at explaining, you're better off reading the wikipedia article on DFAs if you don't know what it is.
Because I'm lazy, I used BurntSushi/regex-automata to get an DFA from a regex.
While Fat32 normally has a tree-like structure, each directory just references blocks anywhere on the file system, so the same block can be referenced from multiple directories.
The directories also have no explicit field for parent directories, so one can leave ..
out.
This allows for graph structures inside a file system, which a DFA basically is.
Q: Should I use this in production
anywhere?
A: No, but I can't stop you.
Q: Does this actually work?
A: I've tried it on Windows 10 and Linux so far. It seems to work flawlessly on Windows as far as I've tested.
On Linux, the fat32 code claims an directory is invalid if there are two dentries with the same directory name and the same parent in a loop (or something like that), so some paths are forbidden.
Might be fun to try on some embedded devices.
Q: NOOOOOOOOOOO!!! YOU CAN'T TURN A DFA INTO A FAT32 FILE SYSTEM!!!! YOU CAN'T JUST HAVE A DIRECTORY WITH MULTIPLE PARENTS!!! YOU ARE BREAKING THE ASSUMPTION OF LACK OF LOOPERINOS NOOOOOOOOO
A: Haha OS-driven regex engine go brrrrr
以上所述就是小编给大家介绍的《Regex2fat: Turn your favorite regex into FAT32》,希望对大家有所帮助,如果大家有任何疑问请给我留言,小编会及时回复大家的。在此也非常感谢大家对 码农网 的支持!
猜你喜欢:本站部分资源来源于网络,本站转载出于传递更多信息之目的,版权归原作者或者来源机构所有,如转载稿涉及版权问题,请联系我们。
算法分析-有效的学习方法(影印版)
Jeffrey J.McConnell / 高等教育出版社 / 2003-03-01 / 28.0
本书主要目标是提高读者关于算法对程序效率的影响等问题的认知水平,并培养读者分析程序中的算法所必需的技巧。各章材料以激发读者有效的、协同的学习方法的形式讲述。通过全面的论述和完整的数学推导,本书帮助读者最大限度地理解基本概念。 本书内容包括促使学生参与其中的大量程序设计课题。书中所有算法以伪码形式给出,使得具备条件表达式、循环与递归方面知识的读者均易于理解。本书以简洁的写作风格向读者介绍了兼具......一起来看看 《算法分析-有效的学习方法(影印版)》 这本书的介绍吧!