Jonathan S. Shapiro wrote: > The problem is that in things like > > f a b + f c d > > we do not know how many arguments to "consume" for f until f is typed, > and we don't have that information at parse time. This works in ML > *because* of curried forms. The parser builds:
Can't you just consume until you hit an invalid name, ie. non-alphanumeric character? Assuming infix can be comprised only of symbols, like ML, while legal names are only alphanumeric. Sandro _______________________________________________ bitc-dev mailing list [email protected] http://www.coyotos.org/mailman/listinfo/bitc-dev
