Select a tag to browse associated projects and drill deeper into the tag cloud.
Ragel compiles finite state machines from regular languages into executable C, C++, Objective-C, D, Java or Ruby code. 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. ... [More]
A parser/lexer generator written in Java. This is a development fork of the well known JavaCC parser generator originally developed at Sun Microsystems.
News09 Sep 2008: New source tarball and Windows pre-compiled executables. Checked with valgrind for memory leak. Tests are still to be fixed! 25 Aug 2008: Back to the NFA approach! Also, now every modifier is greedy. The expressions like ".+z" or "\d+3" will never succeed as the ... [More]
What?An AS3 dynamic, recursive descent (predictive) parser generator for LL(k) non-left-recursive grammars with AST and XML generation facilities. Something along the lines of http://spirit.sourceforge.net/, only way simpler. You should be able to define grammars using plain strings and generate ... [More]
An IEEE Std 1003.1 compliant shell parsing library. The library does not execute, nor interpret, shell code. It merely scans an input stream and parses tokens, delegating intepretation to the caller. An event driven approach is taken, using callbacks to notify the caller of tokens.