Am I right that you want to define a parameterize grammar (where you
are counting the let nesting depth)?
You can't do that like that; instead just define E that has all lets
in it, and when you wanted E_i for some i, write a metafunction that
counts the depth of the E and use a side-condition to ensure that the
size is i.
hth,
Robby
On Thu, May 14, 2009 at 11:03 AM, Christos Dimoulas <chrd...@ccs.neu.edu> wrote:
> I would like to define the following grammar in Redex:
>
> e := .... | let x = e in e | {e}_i
> E_0 := [] | let x=E_0 in e
>
> E_i := let x = E_i in e | {E_0}_i | {E_i}_j
>
> where i,j in N^*.
>
> Do you have any ideas how I could code that in Redex?
>
> Thank you.
>
> .Christos
> _________________________________________________
> For list-related administrative tasks:
> http://list.cs.brown.edu/mailman/listinfo/plt-dev
>
_________________________________________________
For list-related administrative tasks:
http://list.cs.brown.edu/mailman/listinfo/plt-dev
