... few rules in the syntax, and other complicated rules aren't simultaneously introduced. See: APL, which is infix but has a very simple right-to-left interpretation except where explicitly parenthesised. (People exposed to other languages before APL sometimes think it's harder than it really is, because they're used to infix operators having diverse precedences+associativities, and APL has ...

... include makefile.definitions I don't understand the error message It seems that some part of font-lock is requesting the second submatch (in a regex, ie. the match for the second parenthesised part), which wasn't found. Hard to say why exactly that is, might be that some regex there is malformed, or maybe someone forgot to catch errors somewhere. The best starting point is to ...

Chris Rathman wrote: On Feb 12, 8:43 pm, Jon Harrop <j...@ffconsultancy.com> wrote: Can I just note that Chris had parenthesised expressions like: (1+(2*3)) I mean, ((f a) b) is bad but the above is ordinary maths! On a somewhat related subject... My thinking is that I really need to go through the motions of reconciling the F# and O'Caml code. Maybe. F# is ...

On Feb 12, 8:43 pm, Jon Harrop <j...@ffconsultancy.com> wrote: Can I just note that Chris had parenthesised expressions like: (1+(2*3)) I mean, ((f a) b) is bad but the above is ordinary maths! On a somewhat related subject... My thinking is that I really need to go through the motions of reconciling the F# and O'Caml code. The material in SICP really shouldn't dictate a ...

..., if only for the benefit of the reader. This is epecially true for Haskell, where operator binding precedence can be defined (almost) ad libitum. Can I just note that Chris had parenthesised expressions like: (1+(2*3)) I mean, ((f a) b) is bad but the above is ordinary maths! -- Dr Jon D Harrop, Flying Frog Consultancy OCaml for Scientists http://www.ffconsultancy.com/...

... 1. First begin by defining the syntax of your algebra. Since this is a post lets be simple; I'm supposing that algebraic expressions (exprs) are regimented into fully parenthesised form. Here are the type rules. (datatype expr __________________________ (number? X) : verified > X : number; X : number; _________ X : expr; if (not (...