syntax2.txt

From duba@aten.cs.rice.edu Fri Feb 17 14:52:26 1995
Date: Fri, 17 Feb 95 14:52:22 CST
From: duba@aten.cs.rice.edu (Bruce Duba)
To: shriram@aten.cs.rice.edu, matthias@aten.cs.rice.edu
Subject: JAM

D := i = E 
   | i(P) = E
   | kind i(P) : i

Ds := epsilon
    | D{; D}*

P := epsilon
   | i{, i}*

E := C
   | i
   | i(A)
   | i[A] 
   | P(A)
   | if E then E {elseif E then E}* ({else E}| endif)
   | let Ds in E
   | inorder E{; E}* return E
   | set L to E
   | (E)
   | Uop E
   | E Bop E
   | [A{; A}*]

A := epsilon
   | E{, E}*

L := i
   | i[A]

Uop := - | + 

Bop := + | - | * | / | ^ | = | <= | >= | =/= | < | >

P := tuple? | tabulate | size(?)
   | array? | array | size(?)
   | text? 
   | number? | zero? | positive? | odd? | sqrt | log | sin | cos | tan | atan
   | boolean? | and | or | not | xor | nand | nor
?  | list? | null? | pair? | cons | list | car | cdr
   | function?
   | equal?

C := true | false
   | Sym
   | Num
   | empty

Sym := `c*'

c := character