|
From: | Hans Aberg |
Subject: | Re: avoiding infinite loops |
Date: | Tue, 13 Jun 2006 21:00:04 +0200 |
On 13 Jun 2006, at 17:51, David Russinoff wrote:
Apparently, Bison has some method more avoiding loops of this sort, which is not discussed in the dragon book and not reflected in the output file. Can anyone tell me exactly how this works?
You should have gotten an ambiguous grammar. Then Bison still produces a runnable parser by choosing: in the case of reduce/reduce conflicts, shift over reduce, and in the case of reduce/reduce conflicts, the first occurring reduce in the .y grammar.
Hans Aberg
[Prev in Thread] | Current Thread | [Next in Thread] |