about summary refs log tree commit diff stats
path: root/archive/1.vm.arc/tangle.mu
diff options
context:
space:
mode:
authorKartik Agaram <vc@akkartik.com>2019-07-27 16:01:55 -0700
committerKartik Agaram <vc@akkartik.com>2019-07-27 17:47:59 -0700
commit6e1eeeebfb453fa7c871869c19375ce60fbd7413 (patch)
tree539c4a3fdf1756ae79770d5c4aaf6366f1d1525e /archive/1.vm.arc/tangle.mu
parent8846a7f85cc04b77b2fe8a67b6d317723437b00c (diff)
downloadmu-6e1eeeebfb453fa7c871869c19375ce60fbd7413.tar.gz
5485 - promote SubX to top-level
Diffstat (limited to 'archive/1.vm.arc/tangle.mu')
-rw-r--r--archive/1.vm.arc/tangle.mu35
1 files changed, 35 insertions, 0 deletions
diff --git a/archive/1.vm.arc/tangle.mu b/archive/1.vm.arc/tangle.mu
new file mode 100644
index 00000000..3e73dd89
--- /dev/null
+++ b/archive/1.vm.arc/tangle.mu
@@ -0,0 +1,35 @@
+; To demonstrate tangle directives, we'll construct a factorial function with
+; separate base and recursive cases. Compare factorial.mu.
+; This isn't a very realistic example, just a simple demonstration of
+; possibilities.
+
+(function factorial [
+  (default-space:space-address <- new space:literal 30:literal)
+  (n:integer <- next-input)
+  { begin
+    base-case
+  }
+  recursive-case
+])
+
+(after base-case [
+  ; if n=0 return 1
+  (zero?:boolean <- equal n:integer 0:literal)
+  (break-unless zero?:boolean)
+  (reply 1:literal)
+])
+
+(after recursive-case [
+  ; return n*factorial(n-1)
+  (x:integer <- subtract n:integer 1:literal)
+  (subresult:integer <- factorial x:integer)
+  (result:integer <- multiply subresult:integer n:integer)
+  (reply result:integer)
+])
+
+(function main [
+  (1:integer <- factorial 5:literal)
+  ($print (("result: " literal)))
+  (print-integer nil:literal/terminal 1:integer)
+  (print-character nil:literal/terminal ((#\newline literal)))
+])