start | find | index | login or register | edit
Ragel
by earl, 4358 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/
powered by vanilla
echo earlZstrainYat|tr ZY @.
earl.strain.at • esa3 • online for 6857 days • c'est un vanilla site