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. >From my personal experience and looking at those graphs: narrow trees with not too many nodes are easier to understand, whereas broader trees with more nodes are harder. Here are some examples, e.g. Python is easy, as is JavaScript. Harder is Perl and Ruby; I also found one for Java and C. Might be interesting to create one for MMAs grammar! Python: http://www.flickr.com/photos/nicksieger/281055485/ Ruby, Java, JavaScript: http://antigreen.org/vadim/ProgLanguageComparison/grammar-vizualization/visualization-of-rubys-grammar.html Ansi C: http://c2.com/cgi/wiki?BnfToDot H -- 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
