1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
|
;; -*-theme-d-*-
;; Copyright (C) 2008-2013 Tommi Höynälänmaa
;; Distributed under GNU General Public License version 3,
;; see file doc/GPL-3.
;; Expected results: translation and running OK
(define-proper-program (tests test134)
(import (standard-library core)
(standard-library console-io))
(declare <my-tree> :pair)
(define <my-tree>
(:tuple <integer> (:uniform-list <my-tree>)))
(define my-string-append
(prim-proc string-append (<string> <string>) <string> pure))
(define-simple-proc get-prefix (((level <integer>)) <string> force-pure)
(if (<= level 0)
""
(my-string-append " " (get-prefix (- level 1)))))
(define-simple-proc do-display-my-tree
(((tree <my-tree>) (level <integer>)) <none> nonpure)
(let ((prefix <string> (get-prefix level)))
(console-display-string prefix)
(console-display (car tree))
(console-newline)
(let-mutable ((cur-subtrees (:uniform-list <my-tree>)
(car (cdr tree))))
(until ((equal? cur-subtrees null))
(let ((cur-subtrees1
(cast (:nonempty-uniform-list <my-tree>)
cur-subtrees)))
(do-display-my-tree (car cur-subtrees1)
(+ level 1))
(set! cur-subtrees (cdr cur-subtrees1)))))))
(define-simple-proc display-my-tree
(((tree <my-tree>)) <none> nonpure)
(do-display-my-tree tree 0))
(define main
(lambda (() <integer> nonpure)
(let ((my-tree
(list
1
(list
(list 2 null)
(list
3
(list
(list 4 null)
(list 5 null)))))))
(display-my-tree my-tree))
0)))
|
