| 1 |
Ragel compiles finite state machines from regular languages into runnable C |
| 2 |
code. Ragel state machines can not only recognize byte sequences as regular |
| 3 |
expression machines do, but can also execute code at arbitrary points in the |
| 4 |
recognition of a regular language. |
| 5 |
|
| 6 |
When you wish to write down a regular language you start with some simple |
| 7 |
regular language and build a bigger one using the regular language operators |
| 8 |
union, concatenation, kleene star, intersection and subtraction. This is |
| 9 |
precisely the way you describe to Ragel how to compile your finite state |
| 10 |
machines. Ragel also understands operators that insert function calls into |
| 11 |
machines and operators that control any non-determinism in machines. |
| 12 |
|
| 13 |
WWW: http://www.complang.org/ragel/ |
