Josh Holtrop 3a8d9ca55d token matching loop storing ovector for longest match so the longest-matching token does not need to be re-matched to obtain subpattern match strings

2010-05-07 15:24:50 -04:00

..

parser.cc

token matching loop storing ovector for longest match so the longest-matching token does not need to be re-matched to obtain subpattern match strings

2010-05-07 15:24:50 -04:00

parser.h

expanded parse() to compile all tokens, ready to match them

2010-05-07 13:07:21 -04:00