5.4. Units associated with routines

5.4.1. Routine texts

Examples:

VOID: print(x); (REF REAL a, REAL b)BOOL: (a < b | a := b; TRUE | FALSE) .}

5.4.1.1. Syntax

b) procedure with PARAMETERS yielding MOID NEST1 routine text{44d ,5A} : NEST1 new DECS2 declarative defining new DECS2{e} brief pack, where DECS2 like PARAMETERS{c,d,-}, formal MOID NEST1 declarer{46b } , routine{94f } token, strong MOID NEST1 new DECS2 unit{32d } .

c) WHETHER DECS DEC like PARAMETERS PARAMETER{b,c} : WHETHER DECS like PARAMETERS{c,d,-} and DEC like PARAMETER{d,-}. {PARAMETER :: MODE parameter.}

d) WHETHER MODE TAG like MODE parameter{b,c} : WHETHER true.

e) NEST2 declarative defining new DECS2{b,e,34j } : formal MODE NEST2 declarer{46b } , NEST2 MODE parameter joined definition of DECS2{41b,c } ; where (DECS2) is (DECS3 DECS4), formal MODE NEST2 declarer{46b } , NEST2 MODE parameter joined definition of DECS3{41b,c } , and also{94f } token, NEST2 declarative defining new DECS4{e}.

f) NEST2 MODE parameter definition of MODE TAG2{41c } : MODE NEST2 defining identifier with TAG2{48a } .

g) *formal MODE parameter : NEST MODE parameter definition of MODE TAG{f}. {Examples:

}

a)

REAL: random * 10

b)

(BOOL a, b)BOOL: (a | b | FALSE)

e)

BOOL a, b ·BOOL a, BOOL b

f)

a

5.4.1.2. Semantics

1. T, and
2. the environ necessary for {7.2.2.c } T in E.

5.4.2. Formulas

5.4.2.1. Syntax

B) MONADIC :: priority iii iii iii i.

C) ADIC :: DYADIC ; MONADIC.

D) TALLETY :: TALLY ; EMPTY.

a) MOID NEST DYADIC formula{c,5B } : MODE1 NEST DYADIC TALLETY operand{c,-}, procedure with MODE1 parameter MODE2 parameter yielding MOID NEST applied operator with TAD{48b } , where DYADIC TAD identified in NEST{72a } , MODE2 NEST DYADIC TALLY operand{c,-}.

b) MOID NEST MONADIC formula{c,5B } : procedure with MODE parameter yielding MOID NEST applied operator with TAM {48b } , MODE NEST MONADIC operand{c}.

c) MODE NEST ADIC operand{a,b} : firm MODE NEST ADIC formula{a,b} coercee{61b } ; where (ADIC) is (MONADIC), firm MODE NEST SECONDARY{5C } .

d) *MOID formula : MOID NEST ADIC formula{a,b}.

e) *DUO dyadic operator with TAD : DUO NEST DEFIED operator with TAD{48a,b } .

f) *MONO monadic operator with TAM : MONO NEST DEFIED operator with TAM{48a,b } .

g) *MODE operand : MODE NEST ADIC operand{c}. {Examples:

}

a)

-x+1

b)

-x

c)

-x ·1

5.4.2.2. Semantics

· let R be the routine yielded in E by the operator of F;

· let V₁, ... , V_n {n is 1 or 2} be the {collateral} yields of the operands of F, in an environ E1 established {locally, see 3.2.2.b } around E;

· W is the yield of the calling {5.4.3.2.b } of R in E1, with V₁, ... , V_n;

· it is required that W be not newer in scope than E.

{Observe that a ^ b is not precisely the same as a^b in the usual notation; indeed, the value of (- 1 ^ 2 + 4 = 5) and that of (4 - 1 ^ 2 = 3) both are true, since the first minus-symbol is a monadic-operator, whereas the second is a dyadic-operator.}

5.4.3. Calls

Examples:

sin(x) ·(p | sin | cos)(x) .}

5.4.3.1. Syntax

b) actual NEST PARAMETERS PARAMETER{a,b} : actual NEST PARAMETERS{b,c}, and also{94f } token, actual NEST PARAMETER {c}.

c) actual NEST MODE parameter{a,b} : strong MODE NEST unit{32d } . {Examples:

}

a)

put(stand out, x) (see 10.3.3.1.a )

b)

stand out, x

c)

x

5.4.3.2. Semantics

· let R {a routine} and V₁, ... , V_n be the {collateral} yields of the PRIMARY of C, in E, and of the constituent actual-parameters of C, in an environ E1 established {locally, see 3.2.2.b } around E;

· W is the yield of the calling {b}of R in E1 with V₁, ... , V_n;

· it is required that W be not newer in scope than E.

b) The yield W of the "calling", of a routine R in an environ E1, possibly with {parameter} values V₁, ... , V_n, is determined as follows:

· let E2 be the environ established {3.2.2.b } upon E1, around the environ of R, according to the declarative of the declarative-pack, if any, of the routine-text of R, with the values V₁, ... , V_n, if any;

· W is the yield in E2 of the unit of the routine-text of R.

{Consider the following serial-clause:

PROC samelson = (INT n, PROC(INT)REAL f)REAL:
  BEGIN LONG REAL s := LONG 0;
      FOR i TO n DO s +:= LENG f(i) ^ 2 OD;
      SHORTEN long sqrt(s)
  END;
samelson(m, (INT j)REAL: x1[j])

.

REAL(
    INT n = m, PROC(INT)REAL f = (INT j)REAL: x1[j];
    BEGIN LONG REAL s := LONG 0;
        FOR i TO n DO s +:= LENG f(i) ^ 2 OD;
        SHORTEN long sqrt(s)
    END)

.

5.4.4. Jumps

Examples:

y = IF x >= 0 THEN sqrt(x)ELSE GOTO princeton FI ·GOTO st pierre de chartreuse . Alternatively, if the context expects the mode 'procedure yielding MOID', then a routine whose unit is that jump is yielded instead, as in

PROC VOID m := GOTO north berwick .}

5.4.4.1. Syntax

b) go to{a} : STYLE go to{94f ,-} token ; STYLE go{94f ,-} token, STYLE to symbol{94g,-}. {Examples:

}

a)

GOTO kootwijk ·GO TO warsaw ·zandvoort

b)

GOTO ·GO TO

5.4.4.2. Semantics

· let the scene yielded in E by the label-identifier of J be composed of a series S2 and an environ E1;

· let S1 be the series of the smallest {1.1.3.2.g } serial-clause containing S2;

· the elaboration of S1 in E1, or of any series in E1 elaborated in its place, is terminated {2.1.4.3.e };

· S2 in E1 is elaborated "in place of" S1 in E1;

· J in E {is completed and} yields the routine composed of

 
Next