Hi Niklas, See below.
Would it be possible, in theory, for SableCC to do that transformation internally and transparently, i.e. keeping the structure of the specified grammar for the AST?
SableCC 4 implements linear-approximate LR(K). The linear approximation loses some recognitive power in order to reduce the size of the parser. SableCC 4 also tries linear-approximate LALR(K), first, and only expands the number of states to eliminate LALR-specific conflicts (which are totally unintuitive for grammar developers).
An LALR(K) parser has the same number of states as an LR(0) parser. :) Have fun, Etienne -- Etienne M. Gagnon, Ph.D. SableCC: http://sablecc.org _______________________________________________ SableCC-Discussion mailing list [email protected] http://lists.sablecc.org/listinfo/sablecc-discussion
