https://github.com/zhxxch/limregex

A DFA-based regular expression prototype implementation
https://github.com/zhxxch/limregex

Last synced: 13 days ago
JSON representation

A DFA-based regular expression prototype implementation

• Host: GitHub
• URL: https://github.com/zhxxch/limregex
• Owner: zhxxch
• License: mit
• Created: 2015-08-27T06:16:22.000Z (over 9 years ago)
• Default Branch: master
• Last Pushed: 2017-09-17T08:00:09.000Z (over 7 years ago)
• Last Synced: 2024-11-05T19:27:31.705Z (2 months ago)
• Language: C
• Size: 14.6 KB
• Stars: 0
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md
  • License: LICENSE

Awesome Lists containing this project

README

        
# limregex

A C programming exercise,

DFA-based regular expression implementation

Supports only * | ( ) ? . \d \D \w \W \s \S.

With backslash and "\xHH" escapes and UTF-8. 

  

**NO support for + ,**  

     + and \+ both match character '+'.  

**NO support for character classes,**  

     '[', ']' will be characters to match.  

**NO support for counted repetition,**  

     '{', '}' will be characters to match.  

**NO support for backreference.**  

## Demo:

        unsigned int match_length, code[50];

        /*  compile */

        limregexcl(code, 50, "hs|(s|hh)");

        /*  match   */

        match_length = limregexec("sssssh", code);

TODO: fix bugs, refactor all codes