News for hackers. Stuff that matters.

A comment on Rulex – A new, portable, regular expression language. Parent comment

Re:Rulex – A new, portable, regular expression language by masklinn on Friday June 10, 2022 @07:10AM (#31692445)
There’s also the postgres regex engine, I don’t know how it works under the hood but it’s very resistant to catastrophic backtracking despite features which normally translate to nfa (e.g. backrefs).
[ Parent | on HN ]
Re:Rulex – A new, portable, regular expression language by nsajko on Friday June 10, 2022 @07:14AM (#31692475)
> features which normally translate to nfa (e.g. backrefs)

You're very wrong, backreferences in general can't be translated to finite automata (NFA is short for nondeterministic finite automaton). See these comments:

https://news.ycombinator.com/item?id=18431610

https://news.ycombinator.com/item?id=27877743

[ Parent | on HN ]
Re:Rulex – A new, portable, regular expression language by masklinn on Friday June 10, 2022 @11:34AM (#31695596)
Maybe try to read my comment again because I don't think you understood what I wrote.
[ Parent | on HN ]
Re:Rulex – A new, portable, regular expression language by nsajko on Friday June 10, 2022 @04:04PM (#31698798)
You say:

> resistant to catastrophic backtracking despite features which normally translate to nfa

I interpret this as you equating NFA with backtracking engines, which would be incorrect. Is my interpretation wrong?

[ Parent | on HN ]