On Fri, Mar 6, 2009 at 2:56 PM, Sandro Magi <[email protected]>wrote:
> 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. Interesting. I had not known that rule. Yes. That does simplify things a good bit. shap
_______________________________________________ bitc-dev mailing list [email protected] http://www.coyotos.org/mailman/listinfo/bitc-dev
