Created
August 9, 2019 02:16
-
-
Save j2doll/16d876cb167d85c3e596b1a672d6a19f to your computer and use it in GitHub Desktop.
[beautiful code] A Regular Expression Matcher : Brian Kernighan & Rob Pike
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
// http://genius.cat-v.org/brian-kernighan/articles/beautiful | |
// c matches any literal character c | |
// . matches any single character | |
// ^ matches the beginning of the input string | |
// $ matches the end of the input string | |
// * matches zero or more occurrences of the previous character | |
/* match: search for regexp anywhere in text */ | |
int match(char *regexp, char *text) | |
{ | |
if (regexp[0] == '^') | |
return matchhere(regexp+1, text); | |
do { /* must look even if string is empty */ | |
if (matchhere(regexp, text)) | |
return 1; | |
} while (*text++ != '\0'); | |
return 0; | |
} | |
/* matchhere: search for regexp at beginning of text */ | |
int matchhere(char *regexp, char *text) | |
{ | |
if (regexp[0] == '\0') | |
return 1; | |
if (regexp[1] == '*') | |
return matchstar(regexp[0], regexp+2, text); | |
if (regexp[0] == '$' && regexp[1] == '\0') | |
return *text == '\0'; | |
if (*text!='\0' && (regexp[0]=='.' || regexp[0]==*text)) | |
return matchhere(regexp+1, text+1); | |
return 0; | |
} | |
/* matchstar: search for c*regexp at beginning of text */ | |
int matchstar(int c, char *regexp, char *text) | |
{ | |
do { /* a * matches zero or more instances */ | |
if (matchhere(regexp, text)) | |
return 1; | |
} while (*text != '\0' && (*text++ == c || c == '.')); | |
return 0; | |
} |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment