Performance of Regular Expressions
(
2 comments
| 5 points
| on HN
)
Re:Performance of Regular Expressions
by tsuberim on Tuesday October 30, 2018 @08:31AM
(#18335876)
Isn't it O(n) where n is the length of the string to match? Because you can compile any regex to a DFA and run it over the string.
[ Parent
| on HN ]
Re:Performance of Regular Expressions
by mrzasa on Tuesday October 30, 2018 @09:51AM
(#18336420)
Not sure what you mean. For detailed complexity analysis, please read this excellent post by Russ Cox: https://swtch.com/~rsc/regexp/regexp1.html
[ Parent
| on HN ]