Ragel State Machine Compiler 6.1 (Default branch)


 
Thread Tools Search this Thread
Special Forums News, Links, Events and Announcements Software Releases - RSS News Ragel State Machine Compiler 6.1 (Default branch)
# 1  
Old 03-27-2008
Ragel State Machine Compiler 6.1 (Default branch)

Ragel compiles finite state machines from regularlanguages into C, C++, Objective-C, D, Java, orRuby code. It allows the programmer to embedactions at any point in a regular language, and tocontrol non-determinism in the resulting machines.It understands concatenation, union, kleene star,subtraction, intersection, epsilon transitions,and various other common operators. It alsosupports the construction of scanners and thebuilding of state machines using state charts. Itcan be used to create very fast recognizers andparsers that are also robust.License: GNU General Public License (GPL)Changes:
Scanners now ensure that any leaving actions atthe end of a pattern are executed. They are alwaysexecuted before the pattern action. The -d optionfor turning off the removal of duplicate actionsfrom actions lists was added.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
INTERCAL::ByteCode(3pm) 				User Contributed Perl Documentation				   INTERCAL::ByteCode(3pm)

TITLE
Language::INTERCAL::Bytecode - intermediate language DESCRIPTION
The CLC-INTERCAL compiler works by producing bytecode from the program source; this bytecode can be interpreted to execute the program immediately; alternatively, a backend can produce something else from the bytecode, for example C or Perl source code which can then be compiled to your computer's native object format. The compiler itself is just some more bytecode. Thus, to produce the compiler you need a compiler compiler, and to produce that you need a compiler compiler compiler; to produce the latter you would need a compiler compiler compiler compiler, and so on to infinity. To simplify the programmer's life (eh?), the compiler compiler is able to compile itself, and is therefore identical to the compiler compiler compiler (etcetera). The programmer can start the process because a pre-compiled compiler compiler, in the form of bytecode, is provided with the CLC-INTERCAL distribution; this compiler compiler then is able to compile all other compilers, as well as to rebuild itself if need be. See the online manual or the HTML documentation included with the distribution for more information about this. SEE ALSO
A qualified psychiatrist AUTHOR
Claudio Calvelli - intercal (whirlpool) sdf.lonestar.org (Please include the word INTERLEAVING in the subject when emailing that address, or the email may be ignored) perl v5.8.8 2008-03-29 INTERCAL::ByteCode(3pm)