[ragel-users] One question.
nathan.sweet at gmail.com
Tue Mar 29 21:59:03 PDT 2011
Yes, see the int stack in the link. :) Also note the code under "prepush".
On Tue, Mar 29, 2011 at 9:38 PM, Gordeev Vladimir <
gordeev.vladimir.v at gmail.com> wrote:
> Hm, this looks like solution. I will try it. Thanks.
> Related question: Does Ragel have some inner stack to handle nested
> On 30.03.2011 00:59, Nate wrote:
> You can use fcall to jump to a machine, then fret to resume where you were.
> It's a bit tricky, but once you understand it you can parse recursively. See
> the startTable action here (though this is a pretty hairy parser):
> On Tue, Mar 29, 2011 at 2:55 PM, Jonathan Castello <twisolar at gmail.com>wrote:
>> On Tue, Mar 29, 2011 at 1:15 PM, Gordeev Vladimir
>> <gordeev.vladimir.v at gmail.com> wrote:
>> > So I got following error:
>> > test.rl:7:32: graph lookup of "list" failed
>> The reason you get that error is because a rule can only reference
>> definitions that came before it. "list" doesn't exist until the
>> definition is finished, so it can't reference itself. (That would
>> create a recursive structure anyways, which Ragel isn't equipped to
>> handle natively.)
>> ragel-users mailing list
>> ragel-users at complang.org
> ragel-users mailing listragel-users at complang.orghttp://www.complang.org/mailman/listinfo/ragel-users
> ragel-users mailing list
> ragel-users at complang.org
-------------- next part --------------
An HTML attachment was scrubbed...
More information about the ragel-users