151:
74:
53:
22:
411:
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
172:
451:
It turns out that we cannot always eliminate all mutual recursion, whether cv-inlining or ov-inlining is used. The following question is the main focus of this article. Question 1. When can we eliminate all mutual
443:
section says "Any mutual recursion between two procedures can be converted to direct recursion by inlining the code of one procedure into the other." To support this statement, it cites the paper
196:
475:
Proposal: change the incorrect sentence to "Mutual recursion between two procedures can in some cases be converted to direct recursion by inlining the code of one procedure into the other."
336:
460:
If the call graph contains at least two node-disjoint circuits in an SCC, then there is no mutual-recursion elimination sequence, regardless of whether cv- or ov-inlining is performed.
412:
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?
253:
191:
505:
431:
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?
124:
114:
464:
Lemma 2 contradicts this article's statement that any mutual recursion between two procedures can be converted to direct recursion by inlining. Consider two procedures
510:
90:
500:
298:
272:
399:
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
137:
81:
58:
361:
413:
244:
472:
which each call themselves and also call each other. Neither one can be inlined into the other, since it contains a call to itself.
225:
317:
282:
163:
33:
292:
206:
327:
89:
related articles on
Knowledge. If you would like to participate, please visit the project page, where you can join
354:
417:
482:
263:
39:
21:
478:
182:
234:
86:
447:. However, the content of this paper directly contradicts this statement. Section 3 says:
308:
150:
173:
Requested articles/Applied arts and sciences/Computer science, computing, and
Internet
494:
435:
Incorrect statement that all mutual recursion can be converted to direct recursion
444:
215:
73:
52:
486:
421:
291:
Find pictures for the biographies of computer scientists (see
15:
85:, a collaborative effort to improve the coverage of
197:Computer science articles needing expert attention
445:On the conversion of indirect to direct recursion
458:
449:
337:WikiProject Computer science/Unreferenced BLPs
8:
254:Computer science articles without infoboxes
192:Computer science articles needing attention
158:Here are some tasks awaiting attention:
132:
47:
506:Low-importance Computer science articles
49:
19:
99:Knowledge:WikiProject Computer science
511:WikiProject Computer science articles
102:Template:WikiProject Computer science
7:
79:This article is within the scope of
427:Tree vs Forest example is not great
38:It is of interest to the following
273:Timeline of computing 2020–present
14:
501:B-Class Computer science articles
299:Computing articles needing images
149:
72:
51:
20:
119:This article has been rated as
441:Conversion to direct recursion
1:
353:Tag all relevant articles in
93:and see a list of open tasks.
439:The second paragraph in the
362:WikiProject Computer science
138:WikiProject Computer science
82:WikiProject Computer science
293:List of computer scientists
527:
125:project's importance scale
487:13:03, 7 April 2024 (UTC)
355:Category:Computer science
131:
118:
105:Computer science articles
67:
46:
422:21:26, 11 May 2013 (UTC)
357:and sub-categories with
462:
454:
318:Computer science stubs
28:This article is rated
395:Use ALL the languages
136:Things you can help
456:And Lemma 2 says:
34:content assessment
407:, not to mention
392:
391:
388:
387:
384:
383:
380:
379:
376:
375:
518:
410:
406:
402:
366:
360:
235:Computer science
164:Article requests
153:
146:
145:
133:
107:
106:
103:
100:
97:
96:Computer science
87:Computer science
76:
69:
68:
63:
59:Computer science
55:
48:
31:
25:
24:
16:
526:
525:
521:
520:
519:
517:
516:
515:
491:
490:
437:
429:
408:
404:
400:
397:
372:
369:
364:
358:
346:Project-related
341:
322:
303:
277:
258:
239:
220:
201:
177:
104:
101:
98:
95:
94:
61:
32:on Knowledge's
29:
12:
11:
5:
524:
522:
514:
513:
508:
503:
493:
492:
436:
433:
428:
425:
414:74.103.134.250
396:
393:
390:
389:
386:
385:
382:
381:
378:
377:
374:
373:
371:
370:
368:
367:
350:
342:
340:
339:
333:
323:
321:
320:
314:
304:
302:
301:
296:
288:
278:
276:
275:
269:
259:
257:
256:
250:
240:
238:
237:
231:
221:
219:
218:
212:
202:
200:
199:
194:
188:
178:
176:
175:
169:
157:
155:
154:
142:
141:
129:
128:
121:Low-importance
117:
111:
110:
108:
91:the discussion
77:
65:
64:
62:Low‑importance
56:
44:
43:
37:
26:
13:
10:
9:
6:
4:
3:
2:
523:
512:
509:
507:
504:
502:
499:
498:
496:
489:
488:
484:
480:
476:
473:
471:
467:
461:
457:
453:
448:
446:
442:
434:
432:
426:
424:
423:
419:
415:
394:
363:
356:
352:
351:
349:
347:
343:
338:
335:
334:
332:
330:
329:
324:
319:
316:
315:
313:
311:
310:
305:
300:
297:
294:
290:
289:
287:
285:
284:
279:
274:
271:
270:
268:
266:
265:
260:
255:
252:
251:
249:
247:
246:
241:
236:
233:
232:
230:
228:
227:
222:
217:
214:
213:
211:
209:
208:
203:
198:
195:
193:
190:
189:
187:
185:
184:
179:
174:
171:
170:
168:
166:
165:
160:
159:
156:
152:
148:
147:
144:
143:
139:
135:
134:
130:
126:
122:
116:
113:
112:
109:
92:
88:
84:
83:
78:
75:
71:
70:
66:
60:
57:
54:
50:
45:
41:
35:
27:
23:
18:
17:
477:
474:
469:
465:
463:
459:
455:
450:
440:
438:
430:
398:
345:
344:
328:Unreferenced
326:
325:
307:
306:
281:
280:
262:
261:
243:
242:
224:
223:
205:
204:
181:
180:
162:
161:
120:
80:
40:WikiProjects
495:Categories
452:recursion?
216:Computing
479:Vrama628
264:Maintain
207:Copyedit
245:Infobox
183:Cleanup
123:on the
30:B-class
226:Expand
36:scale.
309:Stubs
283:Photo
140:with:
483:talk
468:and
418:talk
409:bool
403:and
115:Low
497::
485:)
420:)
365:}}
359:{{
481:(
470:B
466:A
416:(
405:}
401:{
348::
331::
312::
295:)
286::
267::
248::
229::
210::
186::
167::
127:.
42::
Text is available under the Creative Commons Attribution-ShareAlike License. Additional terms may apply.
