Skip to main content

Home/ linguistics/ Group items tagged regular

Rss Feed Group items tagged

Filter: All | Bookmarks | Topics Simple Middle
anonymous

Regular Expression Matching Can Be Simple And Fast (with NFAs) - 1 views

swtch.com/...regexp1.html

computational expression fsa linguistics match regexp regular regular expressions speed

shared by anonymous on 24 Aug 07 - Cached
  • anonymous on 19 May 08
     
    Thompson NFA (Nonfinite State Automata) perform way faster with longer regular expressions than those algorithms used in scripting languages
1 - 2 of 2
Showing 20▼ items per page