Go backward to The UNITY Notation
Go up to Top
Go forward to Quantified Assignments
Enumerated Assignments
- List of assignment statements:
- x, y, z := 0, 1, 2
- x, y := 0, 1 || z := 2
- x := 0 || y := 1 || z := 2
- Case analysis:
- x := -1 if y < 0
~ 0 if y = 0
- Nondeterministic choice.
- Examples:
- x, y := y, x.
- x := y if y >= 0
~ -y if y <= 0.
- s, i := s+A[i], i+1 if i < N
- C[k] := min(A[i], B[j])
|| k := k+1
|| i := i+1 if A[i] <=B[j]
|| j := j+1 if A[i] >=B[j]
Wolfgang.Schreiner@risc.uni-linz.ac.at
Id: intro.tex,v 1.2 1996/01/31 15:37:03 schreine Exp schreine