I'm in the midst of altering ragel internals to bring the implementation
of conditions right into the core data structure. In previous versions
it could be described as an add-on. The benefits will be fewer "alphabet
space exhausted" exceptions when developing grammars. Also, the ragel
internals will become easier to understand.
Next I want to add in some language constructs that support the common
usage patterns that have emerged for parsing binary protocols using
ragel's conditions. They shows up for me in my work, where I use Ragel
for binary protocols.
There are different ways to approach value-specified repetition. Some
ways are more awkward than others. Some work well if there is at least
one item. Others work when you can have a zero-length list of items.
-Adrian
On 12-06-14 08:35 AM, [email protected] wrote:
Hi Adrian,
Any information on what sort of support (if any) for binary protocols in
the next release would be very much appreciated.
Thanks
implementation, but it's not extensive. I'm hoping 7.0 comes out
sometime in the next four months. The changes run deep, right down to
the core of the NFA -> DFA algorithm and so I'm in no rush.
Thanks. What kind of support will there for binary protocols in version 7.0?
Will it allow ability to work with bits or mostly at the byte level?
_______________________________________________
ragel-users mailing list
[email protected]
http://www.complang.org/mailman/listinfo/ragel-users
