start | find | index | login or register | edit | ||
Ragel
by earl, 6163 days ago
"Ragel compiles executable finite state machines from regular languages. Ragel state machines can not only recognize byte sequences as regular expression machines do, but can also execute code at arbitrary points in the recognition of a regular language."- http://www.cs.queensu.ca/~thurston/ragel/ |
search 42 active users
backlinks (more) none, yet recent stores (more) echo earlZstrainYat|tr ZY @. |
|
earl.strain.at • esa3 • online for 8662 days • c'est un vanilla site |