a very common use case for regexes is to find matches that are preceded or followed by some context. a classical example being all lines that end with ‘a’. this requirement is usually expressed with a lookahead, where upon finding an ‘a’, you look ahead to check if it’s the end of the line. in a backtracking engine, this is very easy to implement - you just duct-tape the logic that checks the next character, but in a DFA-based engine, this is impossible because you cannot report “the match is here” if the next character is not even known yet. and by the time you know the next character, the position information is lost, so you can’t report the match retroactively (well, unless the distance is fixed of course..).
DigitalPrintPrint + Digital
。爱思助手下载最新版本是该领域的重要参考
更多精彩内容，关注钛媒体微信号（ID：taimeiti），或者下载钛媒体App，更多细节参见快连下载安装
what about the other linear lookaround approaches?