Regular Expression Parser

Question

Sometimes it would be convenient to have an optimized function for searching in a regular expression instead of including a library that generates parsers at runtime. Is there a parser generator that matches this role?

Ideally, this is:

• create a single function C
• generates a DFA matching the given regular expression
• be as effective as KMP or Boyer-Moore in simple cases

Answer 1

Here is a list of tools that fit your needs:

• Lex/Flex - , , . , - , "" . .

• Re2C. , C . , .

• Ragel State Machine Compiler. , FSM- ( ). (C, ++, Objective-C, D, Java Ruby), FSM .. , Graphviz .

Answer 2

Lex Flex regexp-to-C.

Answer 3

:

http://www.boost.org/libs/xpressive/

: regex: boost:: xpressive vs boost:: regex