./oceani --noexec --print .tmp.code1a >> .tmp.code2a || exit 1;\
if ! cmp -s .tmp.code1 .tmp.code2a; then \
echo " Failed"; diff -u .tmp.code1 .tmp.code2a; exit 1; fi ; \
+ echo -n "brackets.. "; \
+ echo '``````' > .tmp.code2b ; echo '``````' > .tmp.code2c ;\
+ ./oceani --noexec --print --brackets .tmp.code1 >> .tmp.code2b || exit 1; \
+ ./oceani -npb .tmp.code2b >> .tmp.code2c || exit 1 ; \
+ if ! cmp -s .tmp.code2b .tmp.code2c; then \
+ echo " Failed"; diff -u .tmp.code2b .tmp.code2c; exit 1; fi; \
echo -n "exec-after-print.. "; \
./oceani .tmp.code1 $${1+"$$@"} > .tmp.have ; \
if ! cmp -s .tmp.want .tmp.have; then \
print "error is ", target - guess * guess
for j:=0; then j = j+3 ; while j < 10:
- if j != 0 and then 20 / j > 3:
+ if j != 0 and 20 / j > 3:
print "20 /", j," =", 20 / j
else
print "I won't calculate 20 /", j
pi ::= 3.1415926535897
- if 355/113 == pi or else +(pi - 355/113) < 0.001:
+ if 355/113 == pi or +(pi - 355/113) < 0.001:
print "Close enough"
print "lower" if 355/113 < pi else "higher"
print "higher" if 355/113 > pi else "lower"
else
print 'larger'
+ // different parsing options
+ for {
+ x:=1; sum := 0
+ } then {
+ x = x + 1
+ } while {
+ use x < 10
+ } do {
+ sum = sum + x
+ } case 1 {
+ print "impossible"
+ }
+
###### output: cond_loop
Success
1 2 4 8 16 32 64
active:Boolean = True
struct baz { a:number; b:Boolean; }
+ struct bat {
+ a:string
+ b:Boolean
+ }
+ struct bat2 a:string; b:Boolean
func main
do
for i:=0; then i=i+1; while i < 4:
print info[i].name, info[i].active, info[i].size[0]
info[0].thing.b = True
+ x:bat
+ x.a = "Hello"
###### output: structs
angular := to_polar(32, 23)
print angular.rho, angular.theta
+ func test2(n:number; s:string;) : (ret:number)
+ ret = n + $s
+
+ func random
+ return
+ n:number
+ do
+ n = 4 // xkcd:221
+
+ // exercise the parsing options
+ func t1 (a:number) {
+ print "t1"
+ }
+ func t2 (a:string) {print "string"}
+ func t3() print "t3"
+
###### output: functions
done
1 done
func insert(list:@linkage; new:string)
p:=list
- while ?p.next and then p.next.this < new:
+ while ?p.next and p.next.this < new:
p = p.next.list
t:@node = @new()
t.list.next = p.next
func main()
print "hello" ++ 5, 5 ++ "hello"
-
+ hello := "there"; print 4+hello
b ::= 3
b = b + 1
###### output: type_err1
.tmp.code:3:25: error: expected string found number
.tmp.code:3:28: error: expected string found number
+ .tmp.code:4:34: error: expected number but variable 'hello' is string
+ .tmp.code:4:8: info: this is where 'hello' was set to string
.tmp.code:6:8: error: Cannot assign to a constant: b
.tmp.code:5:8: info: name was defined as a constant here
.tmp.code:8:11: error: Arithmetic returns number but Boolean expected
###### output: type_err5
.tmp.code:8:7: error: type already declared: foo
- .tmp.code:2:7: info: this is location of declartion: foo
+ .tmp.code:2:7: info: this is location of declaration: foo
.tmp.code:10:13: Syntax error in struct field: :
.tmp.code:5:7: error: type has recursive definition: baz
.tmp.code:2:7: error: type has recursive definition: foo