On Tue, 13 Jun 2006, Sylvain Schmitz wrote: > Since we are talking about conflicts and looping parsers, there is a > possibility for an infinite loop with bison's conflict resolution in LALR(1). > See attached file loop.y.
Here's one that uses rule order rather than precedence declarations: S: A ; B: C ; C: B ; A: B ; C: 'a' ; Input is just 'a'. Joel _______________________________________________ [email protected] http://lists.gnu.org/mailman/listinfo/help-bison
