Recursive Production

[Tabiul Mahmood]

Token
   tw = 'w';
   comma = ',';
Production
    operation =  operation (comma operation)*
                     | tw

This does not work for sablecc. How can I do something like this in sablecc. In this example, the production operation could be 'w' or 'w','w','w'.........

Thanks

[Hong Phuc Bui]

You can use something like that:


Tokens

   tw = 'w';
   comma = ',';

Productions
    operation = tw tw_tail*;
    tw_tail = comma tw;

--
-- You received this message because you are subscribed to the SableCC group. To post to this group, send email to sab...@googlegroups.com. To unsubscribe from this group, send email to sablecc+u...@googlegroups.com. For more options, visit this group at https://groups.google.com/d/forum/sablecc?hl=en
---
You received this message because you are subscribed to the Google Groups "SableCC" group.
To unsubscribe from this group and stop receiving emails from it, send an email to sablecc+u...@googlegroups.com.
For more options, visit https://groups.google.com/groups/opt_out.

[Tabiul Mahmood]

Oh ok, thanks. I wish I could do the way I proposed as I feel that is more intuitive and does not break the production into multiple entries. I can do that in Antlr. I am using sablecc due to poor support for c++ in Antlr. Sablecc has been good to me so far :) but wish the production was more expressive like Antlr.

[Hong Phuc Bui]

The syntax from antlr is maybe more intuitive, but you can also transform your CST tree into AST tree with SableCC.
Something like this may be useful:

Tokens
   tw = 'w';
   comma = ',';
Productions

    operation = tw [tail]:tw_tail*
        {->New operation([tw,tail.tw])}
;

    tw_tail
        {-> tw}
        = comma tw{->tw};

Abstract Syntax Tree
    operation = tw*;

So you get a operation as a list of tw. Pls. see more about this in master thesis.