On Sunday, March 11, 2012 3:44:22 AM UTC-7, Harald Schilly wrote: > > > > On Saturday, March 10, 2012 2:53:25 PM UTC+1, rjf wrote: >> >> >> It is not a simple language. > > > I'm sure you all know more about this than me. Is there a common way to > "measure" this? What I'm thinking about are those grammar dependency trees. >
To address this issue more specifically, the complexity of a grammar does not reflect the entire complexity of a language. Scheme is more complicated than its utterly simple grammar would indicate. Mathematica is far more complicated than its utterly complicated (not even written down!) grammar would indicate. The fact that one can teach the IMPLEMENTATION of scheme down to assembly language in a chapter or two of a textbook (Norvig's AI programming book) suggests there is a simplicity to it. RJF -- To post to this group, send an email to sage-devel@googlegroups.com To unsubscribe from this group, send an email to sage-devel+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/sage-devel URL: http://www.sagemath.org
