> This SQL 2003 grammar has infinite look-ahead [according to Terrence] in some > of the rules relating to SQL expressions. > The grammar will not generate no matter how much memory you have until the > infinite look-ahead is resolved.
Thanks. I've been running with a huge heap. but it still seems to run quite a while before failing. for now i've been inserting backtrack=true and k=1 where I am getting the OOMEs. and that seems to alleviate things. ckw -- Chris K Wensel [email protected] http://www.concurrentinc.com -- Concurrent, Inc. offers mentoring, support for Cascading List: http://www.antlr.org/mailman/listinfo/antlr-interest Unsubscribe: http://www.antlr.org/mailman/options/antlr-interest/your-email-address -- You received this message because you are subscribed to the Google Groups "il-antlr-interest" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/il-antlr-interest?hl=en.
