Login or Register to Ask a Question and Join Our Community


Software Releases - RSS News

Ragel State Machine Compiler 6.3 (Default branch)

Login to Discuss or Reply to this Discussion in Our Community

 
Thread Tools Search this Thread
Special Forums News, Links, Events and Announcements Software Releases - RSS News Ragel State Machine Compiler 6.3 (Default branch)
# 1  
Old 08-29-2008
Ragel State Machine Compiler 6.3 (Default branch)
Ragel compiles finite state machines from regular languages into C, C++, Objective-C, D, Java, or Ruby code. It allows the programmer to embed actions at any point in a regular language, and to control non-determinism in the resulting machines. It understands concatenation, union, kleene star, subtraction, intersection, epsilon transitions, and various other common operators. It also supports the construction of scanners and the building of state machines using state charts. It can be used to create very fast recognizers and parsers that are also robust. License: GNU General Public License (GPL) Changes:
Duplicate include prevention was fixed and improved. A false assertion spurred during the creation of scanners with conditions was fixed. A crash on the failed lookup of a goto/call target was fixed. Image

Image

More...
Login or Register to Ask a Question

Previous Thread | Next Thread

3 More Discussions You Might Find Interesting

1. Shell Programming and Scripting

Vim function to generate RTL Code(finite state machine) in verilog

Hi I wanted to call the AutoFsm function (given below) in vim to generate a code something like: **********verilog code to generate ************* always @(posedge clk or negedge rst_n) begin if(!rst_n) begin state_r <= #1 next_stateascii_r; ... (0 Replies)
Discussion started by: dll_fpga
0 Replies

2. Programming

Bitwise operation for state machine

Hello All, I am writing basic state machine which maintains 8 different states and there is posibility that system may be in multiple states at a time (Except for state1 to state3. menas only once state can be active at a time from state1 to state3). I have declared... (9 Replies)
Discussion started by: anand.shah
9 Replies

3. Programming

How Can a Machine Reads a Compiler Since A Compiler is Written in Text! Not Binaries?

To make a programming language you need a compiler, so what was the first programming language and how was is created if you need the compiler first? The compiler itself is considered as a high language comparing to the machine! since the compiler is not created in 1's and 0's... Eventhough i... (12 Replies)
Discussion started by: f.ben.isaac
12 Replies
Login or Register to Ask a Question

LEARN ABOUT DEBIAN

jocamllex

JOCAMLLEX(1)						      General Commands Manual						      JOCAMLLEX(1)

NAME

       jocamllex - The JoCaml lexer generator

SYNOPSIS

       jocamllex [ -o output-file ] [ -ml ] filename.mll

DESCRIPTION

       The  jocamllex(1)  command generates Objective Caml lexers from a set of regular expressions with associated semantic actions, in the style
       of lex(1).

       Running jocamllex(1) on the input file lexer.mll produces Caml code for a lexical analyzer in file lexer.ml.

       This file defines one lexing function per entry point in the lexer definition. These functions have the same names  as  the  entry  points.
       Lexing functions take as argument a lexer buffer, and return the semantic attribute of the corresponding entry point.

       Lexer  buffers  are  an	abstract  data	type  implemented  in  the standard library module Lexing. The functions Lexing.from_channel, Lex-
       ing.from_string and Lexing.from_function create lexer buffers that read from an input channel, a character string, or any reading function,
       respectively.

       When used in conjunction with a parser generated by jocamlyacc(1), the semantic actions compute a value belonging to the type token defined
       by the generated parsing module.

OPTIONS

       The jocamllex(1) command recognizes the following options:

       -o output-file
	      Specify the output file name output-file instead of the default naming convention.

       -ml    Output code that does not use the Caml built-in automata interpreter. Instead, the automaton is encoded  by  Caml  functions.   This
	      option is useful for debugging jocamllex(1), using it for production lexers is not recommended.

SEE ALSO

       jocamlyacc(1).
       The Objective Caml user's manual, chapter "Lexer and parser generators".

																      JOCAMLLEX(1)