Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
Performance of Regular Expressions
(
medium.com/textmaster-engineering
)
5 points
by
mrzasa
on Oct 30, 2018
|
hide
|
past
|
favorite
|
2 comments
tsuberim
on Oct 30, 2018
[–]
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.
mrzasa
on Oct 30, 2018
|
parent
[–]
Not sure what you mean. For detailed complexity analysis, please read this excellent post by Russ Cox:
https://swtch.com/~rsc/regexp/regexp1.html
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search:
