Jump to content

Talk:Mutual recursion

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by 197.84.242.2 (talk) at 16:44, 13 October 2017 (Use ALL the languages). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
WikiProject iconComputer science B‑class Low‑importance
WikiProject iconThis article is within the scope of WikiProject Computer science, a collaborative effort to improve the coverage of Computer science related articles on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.
BThis article has been rated as B-class on Wikipedia's content assessment scale.
LowThis article has been rated as Low-importance on the project's importance scale.
Things you can help WikiProject Computer science with:

Use ALL the languages

The examples in this article are a little hectic - we start at Standard ML, then go to C (which isn't syntactically valid, functions must have { and }, not to mention bool is more characteristic of C++ and must be explicitly included or defined in C), then swing by Python (which isn't marked as such), back to Standard ML, and finally we end with Scheme. Shouldn't this be simplified to a smaller number of consistent pseudocode examples (that both academics and programmers can understand), instead of a handful of examples in different languages that all say the same thing? Or at the very least, can we pick one language and stick with it? 74.103.134.250 (talk) 21:26, 11 May 2013 (UTC)[reply]

Tree vs Forest example is not great

The tree vs forest example doesn't make sense. A tree is not the "parent" of a "forest" in a real sense. Perhaps a more appropriate parent-child example could be found?