What you really need to know about regular expressions before using them

Posted by: Rico Marianis Performance Tidbits, on 21 Jul 2015 | View original | Bookmarked: 0 time(s)

  Approach #1 -- Non-deterministic Finite Automaton This approach first converts the regular expression into a non-deterministic state machine, which is just like a state machine expect you have to keep track of all the states you might be in.  Sort of like when you have a choice of going left or right you go both ways and remember it could be either.  The state machine you get from this approach is proportional to the size of the expression in a fairly direct way and does not depend...

Category: Regex | Other Posts: View all posts by this blogger | Report as irrelevant | View bloggers stats | Views: 343 | Hits: 10

Similar Posts

  • What you really need to know about regular expressions before using them more
  • Assembly-Free jQuery in SharePoint Sites Using the SmartTools jQueryLoader more
  • Silverlight minor update released today more
  • .NETOOP high level configuration storage decision. more
  • Eloquera Database - the web-oriented client/server object database for .NET more
  • Silverlight 2 gets minor update more
  • How to migrate a VirtualPC disk to a VMware Fusion disk more
  • Micro Architectures more
  • new Repository<T>().DoMagic() more
  • RADactive I-Load 2008.R2 Image Upload Web Control more

News Categories

.NET | Agile | Ajax | Architecture | ASP.NET | BizTalk | C# | Certification | Data | DataGrid | DataSet | Debugger | DotNetNuke | Events | GridView | IIS | Indigo | JavaScript | Mobile | Mono | Patterns and Practices | Performance | Podcast | Refactor | Regex | Security | Sharepoint | Silverlight | Smart Client Applications | Software | SQL | VB.NET | Visual Studio | W3 | WCF | WinFx | WPF | WSE | XAML | XLinq | XML | XSD