Ragel State Machine Compiler

Ragel compiles finite state machines from regular languages into runnable C code. It allows you to embed function calls at any point in your regular language, and to control the non-determinism in the resulting machines. It function calls at any point in your regular language, and to control the non-determinism in the resulting

It understands concatenation, union (the "or" operator), kleene star, subtraction, and intersection, as well as some helpers like "!", "?" and "+". Ragel's finite state machines are closed under all of its operators. This property allows for arbitrary regular lanuages to be described. It can be used to create a parser for any language that is regular.

Last updated 7 Jan, 2008


User level: Submit a level

User Rating:

Homepage

License(s) :

GPLv2

Rate it!

 

About

Leadership
Requirements
  • Flex (Build Prerequisite)
  • Bison (Build Prerequisite)
Related Projects

State Machine Compiler

Versions

4.1

4.1 stable released 2005-06-27

User Community and Support

English user manual in PostScript format available from http://www.elude.ca/ragel/ragel-guide-3.7.ps.gz; English user manual in PDF format available from http://www.elude.ca/ragel/ragel-guide-3.7.pdf

General Resources
Support Resources

Development

Developer Resources
Bug Tracking Resources
 

Please send comments on these web pages to bug-directory@fsf.org, send other questions to info@fsf.org.

Copyright © 2000 - 2009 Free Software Foundation, Inc., 51 Franklin Street, 5th Floor, Boston, MA 02110-1301, USA

The copyright licensing notice below applies to this text. Any software described in this text has its own copyright notice and license, which can usually be found in the distribution itself.

Permission is granted to copy, distribute, and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation; with no Invariant Sections, with no Front-Cover Texts, and with no Back-Cover Texts.