Takes a state table where the following are defined: state, input+conditions, accumulate-action, pre-transition-actions, and transition-to. It takes that state table and generates very fast parsers. Similar to Ragel. Currently only outputs pure Ruby.
Required Ruby Version
None
Authors
Joseph Wecker
Versions
-
0.2.4
-
source
- 0.2.4 source August 23, 2011 (14.5 KB)
-
-
0.2.3
-
source
- 0.2.3 source August 21, 2011 (14.5 KB)
-
-
0.2.2
-
source
- 0.2.2 source August 20, 2011 (14.5 KB)
-
-
0.2.1
-
source
- 0.2.1 source August 19, 2011 (14.5 KB)
-
-
0.2.0
-
source
- 0.2.0 source August 19, 2011 (14.5 KB)
-