Ragel State Machine Compiler

Adrian Thurston <nospam@ragel.ca>
28 Feb 2002 00:09:54 -0500

          From comp.compilers

Related articles
Ragel State Machine Compiler nospam@ragel.ca (Adrian Thurston) (2002-02-28)
Ragel State Machine Compiler athurston@gmail.com (age) (2006-01-07)
| List of all articles for this month |

From: Adrian Thurston <nospam@ragel.ca>
Newsgroups: comp.compilers
Date: 28 Feb 2002 00:09:54 -0500
Organization: Compilers Central
Keywords: tools, available
Posted-Date: 28 Feb 2002 00:09:54 EST

There is a new compiler tool recently released called Ragel. It is useful
for performing lexical analysis and general parsing of regular languages.


Brief description:

Ragel compiles finite state machines from regular languages into runnable
C code. It allows you to insert function calls at any point in your
regular language, and to control the non-determinism in the resulting
machines. 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.

  Adrian Thurston

Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.