Re: about counting the times of 'recursion'

[Hans Aberg]

[Please keep the cc to Help-Bison so others can follow.

It is simple to generate list of arbitrary length on both sides, and  
check that they agree in the actions. The grammatical capabilities are  
rather limited, so extend it by resolving in the actions.

  Hans

On 8 Jun 2009, at 01:26, Max cs wrote:

> Thanks for your comments, but I did not see any different from my  
> Grammar? How to guarantee the number of elements in the two sides of  
> '=' are the same?
> i.e.   a,b,c = 1,2,3  is accepted but not a,b,c = 1,2,3,4 or a,b,c =  
> 1 ,2
>
> Thanks
>
> max