3 ms·
This really just seems to be ML-style syntax - which is not ambiguous at all, it's just different from C-like languages (functions applied one argument at a tim
by TheMatten 5y ago
This really just seems to be ML-style syntax - which is not ambiguous at all, it's just different from C-like languages (functions applied one argument at a time, with function application (empty space) having the biggest precendece)
- heinrich5991 5y agoIn this case (and if it were interpreted as Haskell syntax), the above term would be wrong.
- postalrat 5y agoIs it one of these? fibonacci (it) - 1 + fibonacci (it) - 2 fibonacci (it - 1) + fibonacci (it - 2) fibonacci (it - 1 + fibonacci (it - 2))
- marcosdumay 5y agoOn any sane ML-style language, it would be this: (fibonacci it) - 1 + (fibonacci it) - 2 But I guess it isn't the case here, because that code doesn't make sense.