.net - What are the theoretical implications of unbounded lookbehind? -


Most languages ​​allow fixed-long or cimet-long lookbounds. One notable exception is .NET, which allows operator to use.

However, NET Reggae can already identify balanced brackets using named captures, which is not a regular language. Regexs still look * regularly with? Extended replies for other subexpressions except for * (for example, additional settings!) Will also be appreciated.

tl; Dr: What looks to be regular with * regexs * lookbehind?

Hope that helps!


Comments

Popular posts from this blog

paypal - How to know the URL referrer in PHP? -

oauth - Facebook OAuth2 Logout does not remove fb_ cookie -

wpf - Line breaks and indenting for the XAML of a saved FlowDocument? -