QuoteRef: morrJH8_1972 ;;757 literal expression by french quotes eg<>

QuoteRef: morrJH8_1972 ;;757 evaluation of literals by T <>, function definition

QuoteRef: morrJH8_1972 ;;757 sequence by (), matrix by [], sets by {} (any order of evaluation)

QuoteRef: morrJH8_1972 ;;757 function definition by literal sequence eg u<-<<(argl<- real, arg2<-int|-> result <-real, expression) with post arg list u(1,2)

758 ;;Quote: Madcap 6 includes a 'nestexit' to exit from all nested recursive calls

QuoteRef: morrJH8_1972 ;;758 co-routine by "suspending" execution of a function with a returned value, next call resumes at same point

QuoteRef: morrJH8_1972 ;;758 can replace () and ":" by tabbing and cr's

QuoteRef: morrJH8_1972 ;;758 where clause in for loops to bypass execution by boolean expression

QuoteRef: morrJH8_1972 ;;758 for all and there exists predicates returning true or false

QuoteRef: morrJH8_1972 ;;758 a for loop generates a sequence which can either be saved or ignored determined by whether or not bracketing of the for loop.

759 ;;Quote: Madcap allows compound ranges in for loops; evaluated in parallel, in series, or nested

QuoteRef: morrJH8_1972 ;;759 for loop notation For range-list : exp (regular for loop) or exp: range-list (generated result) eg (x:x e b) is the set of all x in b

QuoteRef: morrJH8_1972 ;;760 treewalk special-range with node: @@ and leaf: expr2 specific, not understood treewalking

QuoteRef: morrJH8_1972 ;;761 build sets through for loops e.g., {x: x .memberOf. nbr .suchThat. odd(x)} is all odd x in nbr

QuoteRef: morrJH8_1972 ;;761 ranges 0 =< a =< 10 from 0 to 10 by succ(a) k >= 1 as n times from 1 -> 1+(n-1)