Annotation of OpenXM/src/asir-doc/parts/asir.texi, Revision 1.8
1.8 ! takayama 1: @comment $OpenXM: OpenXM/src/asir-doc/parts/asir.texi,v 1.7 2003/04/20 08:01:25 noro Exp $
1.3 noro 2: \BJP
1.1 noro 3: @node $B%f!<%68@8l(B Asir,,, Top
4: @chapter $B%f!<%68@8l(B Asir
1.3 noro 5: \E
6: \BEG
7: @node User language Asir,,, Top
8: @chapter User language @b{Asir}
9: \E
1.1 noro 10:
11: @noindent
1.3 noro 12: \BJP
1.1 noro 13: @b{Asir} $B$NAH$_9~$_H!?t$O(B, $B0x?tJ,2r(B, GCD $B$J$I$N7W;;$r9T$&$b$N(B, $B%U%!(B
14: $B%$%kF~=PNO$r9T$&$b$N(B, $B$"$k$$$O?t<0$N0lIt$r<h$j=P$9$b$N$J$I$5$^$6$^$J$b$N(B
15: $B$,MQ0U$5$l$F$$$k$,(B, $B%f!<%6$,<B:]$K9T$$$?$$$3$H$r<B9T$5$;$k$?$a$K$O0l(B
16: $BHL$K$O%f!<%68@8l$K$h$k%W%m%0%i%`$r=q$/I,MW$,$"$k(B. $B%f!<%68@8l$b(B
17: @b{Asir} $B$H8F$P$l$k(B. $B0J2<$G$O(B, $B%f!<%68@8l$NJ8K!5,B'$*$h$S<B:]$N%f!<(B
18: $B%68@8l%W%m%0%i%`$rNc$H$7$?%W%m%0%i%`$N=q$-J}$K$D$$$F=R$Y$k(B.
1.3 noro 19: \E
20: \BEG
21: @b{Asir} provides many built-in functions, which perform algebraic
22: computations, e.g., factorization and GCD computation, file I/O,
23: extract a part of an algebraic expression, etc.
24: In practice, you will often encounter a specific problem for which
25: @b{Asir} does not provide a direct solution. For such cases, you have
26: to write a program in a certain user language. The user language for
27: @b{Asir} is also called @b{Asir}. In the following, we describe the
28: Syntax and then show how to write a user program by several examples.
29: \E
1.1 noro 30:
31: @menu
1.3 noro 32: \BJP
1.1 noro 33: * $BJ8K!(B (C $B8@8l$H$N0c$$(B)::
34: * $B%f!<%6Dj5AH!?t$N=q$-J}(B::
1.3 noro 35: \E
36: \BEG
37: * Syntax (Difference from C language)::
38: * Writing user defined functions::
39: \E
1.1 noro 40: @end menu
41:
42:
1.3 noro 43: \BJP
1.1 noro 44: @node $BJ8K!(B (C $B8@8l$H$N0c$$(B),,, $B%f!<%68@8l(B Asir
45: @section $BJ8K!(B (C $B8@8l$H$N0c$$(B)
1.3 noro 46: \E
47: \BEG
48: @node Syntax (Difference from C language),,, User language Asir
49: @section Syntax --- Difference from C language
50: \E
1.1 noro 51:
52: @noindent
1.3 noro 53: \BJP
1.1 noro 54: @b{Asir} $B$NJ8K!$O(B C $B8@8l$K=`5r$7$F$$$k(B.
55: $B$*$b$JAj0cE@$O<!$NDL$j$G$"$k(B. $B0J2<$G(B, $BJQ?t$H$O(B @b{Asir} $B$K$*$1$k(B
56: $B%W%m%0%i%`MQ$NJQ?t(B, $B$9$J$o$ABgJ8;z$G;O$^$kJ8;zNs$r0UL#$9$k$3$H$H$9$k(B.
1.3 noro 57: \E
58: \BEG
59: The syntax of @b{Asir} is based on C language.
60: Main differences are as follows.
61: In this section, a variable does not mean an indeterminate, but
62: a program variable which is written by a string which begins with a
63: capital alphabetical letter in @b{Asir}.
64: \E
1.1 noro 65:
66: @itemize @bullet
67: @item
1.3 noro 68: \JP $BJQ?t$N7?$,$J$$(B.
69: \EG No types for variables.
1.4 noro 70: @*
1.3 noro 71: \BJP
1.1 noro 72: $B4{$K@bL@$7$?$H$*$j(B, @b{Asir} $B$G07$o$l$kBP>]<+?H$OA4$F2?$i$+$N7?(B
73: $B$r;}$C$F$$$k(B. $B$7$+$7(B, $B%W%m%0%i%`JQ?t<+BN$O(B, $B$I$N$h$&$JBP>]$G$b(B
74: $BBeF~$G$-$k$H$$$&0UL#$G7?$,$J$$$N$G$"$k(B.
1.3 noro 75: \E
76: \BEG
77: As is already mentioned, any object in @b{Asir} has their respective
78: types. A program variable, however, is type-less, that is, any typed
79: object can be assigned to it.
80: \E
1.1 noro 81:
82: @example
83: [0] A = 1;
84: 1
85: [1] type(A);
86: 1
87: [2] A = [1,2,3];
88: [1,2,3]
89: [3] type(A);
90: 4
91: @end example
92:
93: @item
1.3 noro 94: \BJP
1.1 noro 95: $BH!?tFb$NJQ?t$O(B, $B%G%U%)%k%H$G$O2>0z?t$r$3$a$F$9$Y$F6I=jJQ?t(B.
1.4 noro 96: @*
1.1 noro 97: $B$?$@$7(B, @code{extern} $B@k8@$5$l$?JQ?t$O(B, $B%H%C%W%l%Y%k$K$*$1$kBg0hJQ?t$H$J$k(B.
98: $B$9$J$o$A(B, $BJQ?t$N%9%3!<%W$OBg0hJQ?t$H6I=jJQ?t$N(B 2 $B<oN`$KC1=c2=$5$l$F$$$k(B.
99: $B%H%C%W%l%Y%k(B, $B$9$J$o$A%W%m%s%W%H$KBP$7$FF~NO$5$l$?JQ?t$OA4$FBg0hJQ?t(B
100: $B$H$7$FEPO?$5$l$k(B. $B$^$?H!?tFb$G$O<!$N$$$:$l$+$H$J$k(B.
1.3 noro 101: \E
102: \BEG
103: Variables, together with formal parameters, in a function (procedure)
104: are all local to the function by default.
1.4 noro 105: @*
1.3 noro 106: Variables can be global at the top level,
107: if they are declared with the key word @code{extern}.
108: Thus, the scope rule of @b{Asir} is very simple.
109: There are only two types of variables: global variables and local
110: variables.
111: A name that is input to the @b{Asir}'s prompt at the top level
112: is denotes a global variable commonly accessed at the top level.
113: In a function (procedure) the following rules are applied.
114: \E
1.1 noro 115:
116: @enumerate
117: @item
1.3 noro 118: \BJP
1.1 noro 119: $BH!?t$,Dj5A$5$l$k%U%!%$%k$K$*$$$F(B, $B$=$NH!?tDj5A0JA0$K(B, $B$"$k(B
120: $BJQ?t$,(B @code{extern} $B@k8@$5$l$F$$$k>l9g(B, $BH!?tFb$N$=$NJQ?t$bBg0hJQ?t(B
121: $B$H$7$F07$o$l$k(B.
1.3 noro 122: \E
123: \BEG
124: If a variable is declared as global by an @code{extern} statement in
125: a function, the variable used in that function denotes a global variable
126: at the top level.
127: Furthermore, if a variable in a function is preceded by an @code{extern}
128: declaration outside the function but in a file where the function is
129: defined, all the appearance of that variable in the same file denote
130: commonly a global variable at the top level.
131: \E
132:
133: @item
134: \JP @code{extern} $B@k8@$5$l$F$$$J$$JQ?t$O$=$NH!?t$K6I=jE*$H$J$k(B.
135: \BEG
136: A variable in a function is local to that function, if it is not declared
137: as global by an @code{extern} declaration.
138: \E
1.1 noro 139: @end enumerate
140:
141: @example
142: % cat afo
143: def afo() @{ return A;@}
144: extern A$
145: def bfo() @{ return A;@}
146: end$
147: % asir
148: [0] load("afo")$
149: [5] A = 1;
150: 1
151: [6] afo();
152: 0
153: [7] bfo();
154: 1
155: @end example
156:
157: @item
1.3 noro 158: \JP $B%W%m%0%i%`JQ?t$OBgJ8;z$G;O$^$j(B, $BITDj85(B, $BH!?t$O>.J8;z$G;O$^$k(B.
159: \EG Program variables and algebraic indeterminates are distinguished in @b{Asir}.
1.4 noro 160: @*
1.3 noro 161: \BJP
1.1 noro 162: $B$3$NE@$O(B, $B4{B8$N?t<0=hM}%7%9%F%`$N$[$H$s$I$H0[$J$kE@$G$"$k(B. @b{Asir}
163: $B$,$3$N;EMM$r:NMQ$7$?$N$O(B, $B%f!<%6$,ITDj85$N$D$b$j$G;HMQ$7$?JQ?t$K(B
164: $B$J$s$i$+$NCM$,BeF~$5$l$F$$$?>l9g$K:.Mp$r>7$/(B, $B$H$$$&(B, $B4{B8$N(B
165: $B%7%9%F%`$K$"$j$,$A$J>u67$rHr$1$k$?$a$G$"$k(B.
1.3 noro 166: \E
167: \BEG
168: The names of program variables must begin with a capital letter;
169: while the names of indeterminates and functions must begin with
170: a small letter.
171:
172: This is an unique point that differs from almost all other existing
173: computer algebra systems. The distinction between program variables
174: and indeterminates is adopted to avoid the possible and usual confusion
175: that may arise in a situation where a name is used as an indeterminate
176: but, as it was, the name has been already assigned some value.
177: To use different type of letters, capital and small, was a matter of
178: syntactical convention like Prolog, but it is convenient to distinguish
179: variables and indeterminates in a program.
180: \E
181:
182: @item
183: \JP @code{switch} $BJ8(B, @code{goto} $B$,$J$$(B.
184: \EG No @code{switch} statements, and @code{goto} statements.
1.4 noro 185: @*
1.3 noro 186: \JP @code{goto} $B$,$J$$$?$a(B, $BB?=E%k!<%W$r0lEY$KH4$1$k$N$,$d$dJ#;($K$J$k>l9g$,$"$k(B.
187: \EG Lack of @code{goto} statement makes it rather bothering to exit from within multiple loops.
188:
189: @item
190: \BJP
191: $B%3%s%^<0$O(B, @code{for (A;B;C)} $B$^$?$O(B, @code{while(A)} $B$N(B @code{A},
192: @code{B}, @code{C} $B$K$N$_;H$&$3$H$,$G$-$k(B.
193: \E
194: \BEG
195: Comma expressions are allowed only in @code{A}, @code{B} and @code{C}
196: of the constructs @code{for (A;B;C)} or @code{while(A)}.
197: \E
1.4 noro 198: @*
1.3 noro 199: \JP $B$3$l$O(B, $B%j%9%H$r@5<0$J%*%V%8%'%/%H$H$7$F2C$($?$3$H$K$h$k(B.
200: \EG This limitation came from adopting lists as legal data objects for @b{Asir}.
1.1 noro 201:
202: @end itemize
203:
204: @noindent
1.3 noro 205: \JP $B0J>e$O@)8B$G$"$k$,(B, $B3HD%$H$7$F$O<!$NE@$,5s$2$i$l$k(B.
206: \EG The above are limitations; extensions are listed as follows.
1.1 noro 207:
208: @itemize @bullet
209: @item
1.3 noro 210: \JP $BM-M}<0$KBP$9$k7W;;$r(B, $BDL>o$N(B C $B$K$*$1$k7W;;$HF1MM$K$G$-$k(B.
211: \BEG
212: Arithmetic for rational expressions can be done in the
213: same manner as is done for numbers in C language.
214: \E
1.1 noro 215:
216: @item
1.3 noro 217: \JP $B%j%9%H$,07$($k(B.
218: \EG Lists are available for data objects.
1.1 noro 219:
1.3 noro 220: \BJP
1.1 noro 221: $B9=B$BN$rMQ$$$k$^$G$b$J$$MWAG$N=89gBN$r(B, $B%j%9%H$GI=$9$3$H$,$G$-(B,
222: C $B$GD>@\=q$/>l9g$KHf3S$7$F%W%m%0%i%`$,C;$/(B, $BFI$_$d$9$/=q$1$k(B.
1.3 noro 223: \E
224: \BEG
225: Lists are conveniently used to represent a certain collection of objects.
226: Use of lists enables to write programs more easily, shorter and more
227: comprehensible than use of structure like C programs.
228: \E
1.2 noro 229:
230: @item
1.3 noro 231: \JP $B%f!<%6Dj5AH!?t$K$*$1$k%*%W%7%g%s;XDj(B.
232: \EG Options can be specified in calling user defined functions.
1.2 noro 233:
1.3 noro 234: \JP $B$3$l$K4X$7$F$O(B, @xref{$B%*%W%7%g%s;XDj(B}.
235: \EG @xref{option}.
1.1 noro 236: @end itemize
237:
1.3 noro 238: \BJP
1.1 noro 239: @node $B%f!<%6Dj5AH!?t$N=q$-J}(B,,, $B%f!<%68@8l(B Asir
240: @section $B%f!<%6Dj5AH!?t$N=q$-J}(B
1.3 noro 241: \E
242: \BEG
243: @node Writing user defined functions,,, User language Asir
244: @section Writing user defined functions
245: \E
1.1 noro 246:
247: @menu
1.3 noro 248: \BJP
1.1 noro 249: * $B%f!<%6Dj5AH!?t(B::
250: * $BJQ?t$*$h$SITDj85(B::
251: * $B0z?t(B::
252: * $B%3%a%s%H(B::
253: * $BJ8(B::
254: * return $BJ8(B::
255: * if $BJ8(B::
256: * $B%k!<%W(B break return continue::
1.5 noro 257: * $B9=B$BNDj5A(B::
1.1 noro 258: * $B$5$^$6$^$J<0(B::
259: * $B%W%j%W%m%;%C%5(B::
1.2 noro 260: * $B%*%W%7%g%s;XDj(B::
1.8 ! takayama 261: * $B%b%8%e!<%k(B::
1.3 noro 262: \E
263: \BEG
264: * User defined functions::
265: * variables and indeterminates::
266: * parameters and arguments::
267: * comments::
268: * statements::
269: * return statement::
270: * if statement::
271: * loop break return continue::
1.5 noro 272: * structure definition::
1.3 noro 273: * various expressions::
274: * preprocessor::
275: * option::
1.8 ! takayama 276: * module::
1.3 noro 277: \E
1.1 noro 278: @end menu
279:
1.3 noro 280: \BJP
1.1 noro 281: @node $B%f!<%6Dj5AH!?t(B,,, $B%f!<%6Dj5AH!?t$N=q$-J}(B
282: @subsection $B%f!<%6Dj5AH!?t(B
1.3 noro 283: \E
284: \BEG
285: @node User defined functions,,, Writing user defined functions
286: @subsection User defined functions
287: \E
1.1 noro 288:
289: @noindent
1.3 noro 290: \BJP
1.1 noro 291: $B%f!<%6$K$h$kH!?t$NDj5A$O(B @samp{def} $BJ8$G9T$&(B. $BJ8K!%(%i!<$OFI$_9~$_;~$K(B
292: $B$"$kDxEY%A%'%C%/$5$l(B, $B$*$*$h$=$N>l=j$,I=<($5$l$k(B.
293: $B4{$K(B($B0z?t$N8D?t$K4X78$J$/(B)$BF1L>$NH!?t$,Dj5A$5$l$F$$$k>l9g$K$O(B,
294: $B$=$NH!?t$O:FDj5A$5$l$k(B. @code{ctrl()} $BH!?t$K$h$j(B @code{verbose} $B%U%i%0(B
295: $B$,(B on $B$K$J$C$F$$$k>l9g(B,
1.3 noro 296: \E
297: \BEG
298: To define functions by an user himself, @samp{def} statement must be used.
299: Syntactical errors are detected in the parsing phase
300: of @b{Asir}, and notified with an indication of where @b{Asir} found the error.
301: If a function with the same name is already defined (regardless to
302: its arity,) the new definition will override the old one, and the user
303: will be told by a message,
304: \E
1.1 noro 305:
306: @example
307: afo() redefined.
308: @end example
309:
310: @noindent
1.3 noro 311: \BJP
1.1 noro 312: $B$H$$$&%a%C%;!<%8$,I=<($5$l$k(B. $B$"$kH!?t$NDj5A$K$*$$$F(B, $B$^$@L$Dj5A$NH!?t(B
313: $B$r8F$S=P$7$F$$$F$b(B, $BDj5A;~$K$O%(%i!<$K$J$i$J$$(B. $B<B9T;~$KL$Dj5A$NH!?t(B
314: $B$r8F$S=P$=$&$H$7$?>l9g$K%(%i!<$H$J$k(B.
1.3 noro 315: \E
316: \BEG
317: on the screen when a flag @code{verbose} is set to a non-zero value by
318: @code{ctrl()}.
319: Recursive definition, and of course, recursive use of functions are
320: available.
321: A call for an yet undefined function in a function definition is not
322: detected as an error. An error will be detected at execution of the
323: call of that yet undefined function.
324: \E
1.1 noro 325: @example
326: @tex
327: /* $X!$ */
328: @end tex
329:
330: def f(X) @{
331: if ( !X )
332: return 1;
333: else
334: return X * f(X-1);
335: @}
336:
337: @tex
1.3 noro 338: \JP /* ${_i}C_j ( 0 \le i \le N, 0 \le j \le i )$ */
339: \EG /* ${_i}C_j ( 0 \le i \le N, 0 \le j \le i )$ */
1.1 noro 340: @end tex
341:
342: def c(N)
343: @{
344: A = newvect(N+1); A[0] = B = newvect(1); B[0] = 1;
345: for ( K = 1; K <= N; K++ ) @{
346: A[K] = B = newvect(K+1); B[0] = B[K] = 1;
347: for ( P = A[K-1], J = 1; J < K; J++ )
348: B[J] = P[J-1]+P[J];
349: @}
350: return A;
351: @}
352: @end example
353:
354: @noindent
1.3 noro 355: \BJP
1.1 noro 356: 2 $B$DL\$NNc$G$O(B, $BD9$5(B @code{N+1} $B$N%Y%/%H%k(B (@code{A}$B$H$9$k(B) $B$,JV$5$l$k(B.
357: @code{A[I]} $B$OD9$5(B @code{I+1} $B$NG[Ns$G$"$j(B, $B$=$N$=$l$>$l$NMWAG$,(B
1.3 noro 358: \E
359: \BEG
360: In the second example, @code{c(N)} returns a vector, say @code{A}, of length
361: @code{N+1}. @code{A[I]} is a vector of length @code{I+1}, and
362: each element is again a vector which contains
363: \E
1.1 noro 364: @iftex
365: @tex
366: ${_I}C_J$
367: @end tex
368: @end iftex
369: @ifinfo
370: ICJ
371: @end ifinfo
1.3 noro 372: \JP $B$rMWAG$H$9$kG[Ns$G$"$k(B.
373: \EG as its elements.
1.1 noro 374:
375: @noindent
1.3 noro 376: \BJP
1.1 noro 377: $B0J2<$G$O(B, C $B$K$h$k%W%m%0%i%_%s%0$N7P83$,$J$$?M$N$?$a$K(B, @b{Asir} $B8@8l(B
378: $B$K$h$k%W%m%0%i%`$N=q$-J}$r2r@b$9$k(B.
1.3 noro 379: \E
380: \BEG
381: In the following, the manner of writing @b{Asir} programs is exhibited
382: for those who have no experience in writing C programs.
383: \E
1.1 noro 384:
1.3 noro 385: \BJP
1.1 noro 386: @node $BJQ?t$*$h$SITDj85(B,,, $B%f!<%6Dj5AH!?t$N=q$-J}(B
387: @subsection $BJQ?t$*$h$SITDj85(B
1.3 noro 388: \E
1.1 noro 389:
390: @noindent
1.3 noro 391: \BJP
1.1 noro 392: $B4{$K=R$Y$?DL$j(B, @b{Asir} $B$K$*$$$F$O%W%m%0%i%`JQ?t$HITDj85$rL@3N$K(B
393: $B6hJL$7$F$$$k(B.
1.3 noro 394: \E
395: \BEG
396: @node variables and indeterminates,,, Writing user defined functions
397: @subsection variables and indeterminates
398: \E
1.1 noro 399:
400: @table @b
1.3 noro 401: \BJP
1.1 noro 402: @item $BJQ?t(B
403: $BBgJ8;z$G;O$^$j(B, $B%"%k%U%!%Y%C%H(B, $B?t;z(B, @samp{_} $B$+$i$J$kJ8;zNs(B
1.3 noro 404: \E
405: \BEG
406: @item variables (program variables)
407: A program variable is a string that begins with a capital
408: alphabetical letter followed by any numbers of alphabetical letters,
409: digits and @samp{_}.
410: \E
1.1 noro 411:
1.3 noro 412: \BJP
1.1 noro 413: $BJQ?t$"$k$$$O%W%m%0%i%`JQ?t$H$O(B, @b{Asir} $B$N$5$^$6$^$J7?$NFbIt7A<0$r(B
414: $B3JG<$9$k$?$a$NH"$G$"$j(B, $B3JG<$5$l$?FbIt7A<0$,(B, $B$3$NJQ?t$NCM$G$"$k(B. $BJQ(B
415: $B?t$,<0$NMWAG$H$7$FI>2A$5$l$k;~$O(B, $B$=$3$K<}$a$i$l$?CM$KCV$-49$($i$l$k(B.
416: $B$9$J$o$A(B, $BFbIt7A<0$NCf$K$O%W%m%0%i%`JQ?t$O8=$l$J$$(B. $BJQ?t$OA4$F(B 0 $B$G(B
417: $B=i4|2=$5$l$F$$$k(B.
1.3 noro 418: \E
419: \BEG
420: A program variable is thought of a box (a carrier) which can contain
421: @b{Asir} objects of various types. The content is called the `value'
422: of that variable. When an expression in a program is to be evaluated,
423: the variable appearing in the expression is first replaced by its value
424: and then the expression is evaluated to some value and stored in
425: the memory. Thus, no program variable appears in objects in the
426: internal form.
427: All the program variables are initialized to the value 0.
428: \E
1.1 noro 429:
430: @example
431: [0] X^2+X+1;
432: 1
433: [1] X=2;
434: 2
435: [2] X^2+X+1;
436: 7
437: @end example
438:
1.3 noro 439: \BJP
1.1 noro 440: @item $BITDj85(B
441: $B>.J8;z$G;O$^$j(B, $B%"%k%U%!%Y%C%H(B, $B?t;z(B, @samp{_} $B$+$i$J$kJ8;zNs(B
442:
443: $BITDj85$H$O(B, $BB?9`<04D$r9=@.$9$k:]$KE:2C$5$l$kJQ?t$r$$$&(B. @b{Asir} $B$K(B
444: $B$*$$$F$O(B, $BITDj85$OCM$r$b$?$J$$D61[E*$J85$G$"$j(B, $BITDj85$X$NCM$NBeF~$O(B
445: $B5v$5$l$J$$(B.
1.3 noro 446: \E
447: \BEG
448: @item indeterminates
449: An indeterminate is a string that begins with a small alphabetical letter
450: followed by any numbers of alphabetical letters, digits and @samp{_}.
451:
452: An indeterminate is a transcendental element, so-called variable,
453: which is used to construct polynomial rings.
454: An indeterminate cannot have any value. No assignment is allowed to it.
455: \E
1.1 noro 456:
457: @example
458: [3] X=x;
459: x
460: [4] X^2+X+1;
461: x^2+x+1
462: @end example
463: @end table
464:
1.3 noro 465: \BJP
1.1 noro 466: @node $B0z?t(B,,, $B%f!<%6Dj5AH!?t$N=q$-J}(B
467: @subsection $B0z?t(B
1.3 noro 468: \E
469: \BEG
470: @node parameters and arguments,,, Writing user defined functions
471: @subsection parameters and arguments
472: \E
1.1 noro 473:
474: @example
475: def sum(N) @{
476: for ( I = 1, S = 0; I <= N; I++ )
477: S += I;
478: return S;
479: @}
480: @end example
481:
482: @noindent
1.3 noro 483: \BJP
1.1 noro 484: $B$3$l$O(B, 1 $B$+$i(B @code{N} $B$^$G$N<+A3?t$NOB$r5a$a$kH!?t(B @code{sum()} $B$N(B
485: $BDj5A$G$"$k(B. $B$3$NNc$K$*$1$k(B @code{sum(N)} $B$N(B @code{N} $B$,0z?t$G$"$k(B.
486: $B$3$NNc$O(B, 1 $B0z?tH!?t$NNc$G$"$k$,(B, $B0lHL$K0z?t$N8D?t$OG$0U$G$"$j(B,
487: $BI,MW$J$@$1$N8D?t$r(B @samp{,} $B$G6h@Z$C$F;XDj$9$k$3$H$,$G$-$k(B. $B0z?t$O(B
488: $BCM$,EO$5$l$k(B. $B$9$J$o$A(B, $B0z?t$r<u$1$H$C$?B&$,(B, $B$=$N0z?t$NCM$rJQ99$7$F(B
489: $B$b(B, $BEO$7$?B&$NJQ?t$OJQ2=$7$J$$(B. $B$?$@$7(B, $BNc30$,$"$k(B. $B$=$l$O(B, $B%Y%/%H%k(B,
490: $B9TNs$r0z?t$KEO$7$?>l9g$G$"$k(B. $B$3$N>l9g$b(B, $BEO$5$l$?JQ?t$=$N$b$N$r=q$-(B
491: $BBX$($k$3$H$O(B, $B$=$NH!?t$K6I=jE*$JA`:n$G$"$k$,(B, $BMWAG$r=q$-49$($?>l9g(B,
492: $B$=$l$O(B, $B8F$S=P$7B&$N%Y%/%H%k(B, $B9TNs$NMWAG$r=q$-49$($k$3$H$K$J$k(B.
1.3 noro 493: \E
494: \BEG
495: This is an example definition of a function that sums up integers
496: from 1 to @code{N}. The @code{N} in @code{sum(N)} is called the
497: (formal) parameter of @code{sum(N)}.
498: The example shows a function of the single argument.
499: In general, any number of parameters can be specified by separating
500: by commas (@samp{,}).
501: A (formal) parameter accepts a value given as an argument (or an actual
502: parameter) at a function call of the function.
503: Since the value of the argument is given to the formal parameter,
504: any modification to the parameter does not usually affect the argument
505: (or actual parameter). However, there are a few exceptions: vector
506: arguments and matrix arguments.
507:
508: Let @code{A} be a program variable and assigned to a vector value
509: @code{[ a, b ]}.
510: If A is given as an actual parameter to a formal parameter, say @code{V},
511: of a function, then an assignment in the function to the vector element
512: designator @code{V[1]}, say @code{V[1]=c;}, causes modification of the
513: actual parameter @code{A} resulting @code{A} to have an altered value
514: @code{[ a c ]}. Thus, if a vector is given to a formal parameter of
515: a function, then its element (and subsequently the vector itself) in
516: the calling side is modified through modification of the formal parameter
517: by a vector element designator in the called function.
518: The same applies to a matrix argument.
519: Note that, even in such case where a vector (or a matrix) is given to
520: a formal parameter, the assignment to the whole parameter itself has
521: only a local effect within the function.
522: \E
1.1 noro 523:
524: @example
525: def clear_vector(M) @{
526: /* M is expected to be a vector */
527: L = size(M)[0];
528: for ( I = 0; I < L; I++ )
529: M[I] = 0;
530: @}
531: @end example
532:
533: @noindent
1.3 noro 534: \BJP
1.1 noro 535: $B$3$NH!?t$O(B, $B0z?t$N%Y%/%H%k$r(B 0 $B%Y%/%H%k$K=i4|2=$9$k$?$a$NH!?t$G$"$k(B.
536: $B$^$?(B, $B%Y%/%H%k$r0z?t$KEO$9$3$H$K$h$j(B, $BJ#?t$N7k2L$r0z?t$N%Y%/%H%k$K(B
537: $B<}G<$7$FJV$9$3$H$,$G$-$k(B. $B<B:]$K$O(B, $B$3$N$h$&$J>l9g$K$O(B, $B7k2L$r%j%9%H(B
538: $B$K$7$FJV$9$3$H$b$G$-$k(B. $B>u67$K1~$8$F;H$$$o$1$9$k$3$H$,K>$^$7$$(B.
1.3 noro 539: \E
540: \BEG
541: This function will clear off the vector given as its argument to the
542: formal parameter @code{M} and return a 0 vector.
543:
544: Passing a vector as an argument to a function enables returning
545: multiple results by packing each result in a vector element.
546: Another alternative to return multiple results is to use a list.
547: Which to use depends on cases.
548: \E
1.1 noro 549:
1.3 noro 550: \BJP
1.1 noro 551: @node $B%3%a%s%H(B,,, $B%f!<%6Dj5AH!?t$N=q$-J}(B
552: @subsection $B%3%a%s%H(B
1.3 noro 553: \E
554: \BEG
555: @node comments,,, Writing user defined functions
556: @subsection comments
557: \E
1.1 noro 558:
559: @noindent
1.3 noro 560: \JP C $B$HF1MM(B @samp{/*} $B$H(B @samp{*/} $B$G0O$^$l$?ItJ,$O%3%a%s%H$H$7$F07$o$l$k(B.
561: \BEG
562: The text enclosed by @samp{/*} and @samp{*/} (containing @samp{/*} and
563: @samp{*/}) is treated as a comment and has no effect to the program
564: execution as in C programs.
565: \E
1.1 noro 566:
567: @example
568: /*
569: * This is a comment.
570: */
571:
572: def afo(X) @{
573: @end example
574:
575: @noindent
1.3 noro 576: \BJP
1.1 noro 577: $B%3%a%s%H$OJ#?t9T$KEO$C$F$b9=$o$J$$$,(B, $BF~$l;R$K$9$k$3$H$O$G$-$J$$(B.
578: @samp{/*} $B$,$$$/$D$"$C$F$b:G=i$N$b$N$N$_$,M-8z$H$J$j(B, $B:G=i$K8=$l$?(B
579: @samp{*/} $B$G%3%a%s%H$O=*N;$7$?$H8+$J$5$l$k(B. $B%W%m%0%i%`$J$I$G(B, $B%3%a%s%H(B
580: $B$r4^$`2DG=@-$,$"$kItJ,$r%3%a%s%H%"%&%H$7$?>l9g$K$O(B, @code{#if 0},
1.6 noro 581: @code{#endif}$B$r;H$($P$h$$(B. (@xref{$B%W%j%W%m%;%C%5(B}.)
1.3 noro 582: \E
583: \BEG
584: A comment can span to several lines, but it cannot be nested.
585: Only the first @samp{/*} is effective no matter how many @samp{/*}'s
586: in the subsequent text exist, and the comment terminates at the first
587: @samp{*/}.
588:
589: In order to comment out a program part that may contain comments in it,
1.6 noro 590: use the pair, @code{#if 0} and @code{#endif}. (@xref{preprocessor}.)
1.3 noro 591: \E
1.1 noro 592:
593: @example
594: #if 0
595: def bfo(X) @{
596: /* empty */
597: @}
598: #endif
599: @end example
600:
1.3 noro 601: \BJP
1.1 noro 602: @node $BJ8(B,,, $B%f!<%6Dj5AH!?t$N=q$-J}(B
603: @subsection $BJ8(B
1.3 noro 604: \E
605: \BEG
606: @node statements,,, Writing user defined functions
607: @subsection statements
608: \E
1.1 noro 609:
610: @noindent
1.3 noro 611: \BJP
1.1 noro 612: @b{Asir} $B$N%f!<%6H!?t$O(B,
613:
614: @example
615: def $BL>A0(B($B0z?t(B,$B0z?t(B,...,$B0z?t(B) @{
616: $BJ8(B
617: $BJ8(B
618: ...
619: $BJ8(B
620: @}
1.3 noro 621: \E
622: \BEG
623: An user function of @b{Asir} is defined in the following form.
624:
625: @example
626: def name(parameter, parameter,...,parameter) @{
627: statement
628: statement
629: ...
630: statement
631: @}
632: \E
1.1 noro 633: @end example
634:
635: @noindent
1.3 noro 636: \BJP
1.1 noro 637: $B$H$$$&7A$GDj5A$5$l$k(B. $B$3$N$h$&$K(B, $BJ8$OH!?t$N4pK\E*9=@.MWAG$G$"$j(B, $B%W%m(B
638: $B%0%i%`$r=q$/$?$a$K$O(B, $BJ8$,$I$N$h$&$J$b$N$G$"$k$+CN$i$J$1$l$P$J$i$J$$(B.
639: $B:G$bC1=c$JJ8$H$7$F(B, $BC1J8$,$"$k(B. $B$3$l$O(B,
1.3 noro 640: \E
641: \BEG
642: As you can see, the statement is a fundamental element of the
643: function.
644: Therefore, in order to write a program, you have to learn what
645: the statement is. The simplest statement is the simple statement.
646: One example is an expression with a terminator (@samp{;} or @samp{$}.)
647: \E
1.1 noro 648:
649: @example
650: S = sum(N);
651: @end example
652:
653: @noindent
1.3 noro 654: \BJP
1.1 noro 655: $B$N$h$&$K(B, $B<0$K=*C<5-9f(B (@samp{;} $B$^$?$O(B @samp{$}) $B$r$D$1$?$b$N$G$"$k(B.
656: $B$3$NC1J85Z$SN`;w$N(B @code{return} $BJ8(B, @code{break} $BJ8$J$I$,J8$N:G>.9=@.(B
1.6 noro 657: $BC10L$H$J$k(B. @code{if} $BJ8$d(B @code{for} $BJ8$NDj5A(B (@ref{$BJ8K!$N>\:Y(B}) $B$r8+$l(B
1.1 noro 658: $B$P$o$+$kDL$j(B, $B$=$l$i$NK\BN$O(B, $BC1$J$k0l$D$NJ8$H$7$FDj5A$5$l$F$$$k(B. $BDL>o(B
659: $B$O(B, $BK\BN$K$OJ#?t$NJ8$,=q$1$k$3$H$,I,MW$H$J$k(B. $B$3$N$h$&$J>l9g(B,
660: @samp{@{} $B$H(B @samp{@}} $B$GJ8$NJB$S$r3g$C$F(B, $B0l$D$NJ8$H$7$F07$&$3$H$,$G(B
661: $B$-$k(B. $B$3$l$rJ#J8$H8F$V(B.
1.3 noro 662: \E
663: \BEG
664: A `@code{return} statement' and `@code{break} statement' are also
665: primitives to construct `statements.'
666: As you can see the syntactic definition of `@code{if} statement' and
667: `@code{for} statement', each of their bodies consists of a single
668: `statement.' Usually, you need several statements in such a body.
669: To solve this contradictory requirement, you may use the `compound
670: statement.' A `compound statement' is a sequence of `statement's
671: enclosed by a left brace @samp{@{} and a right brace @samp{@}}.
672: Thus, you can use multiple statement as if it were a single statement.
673: \E
1.1 noro 674:
675: @example
676: if ( I == 0 ) @{
677: J = 1;
678: K = 2;
679: L = 3;
680: @}
681: @end example
682:
683: @noindent
1.3 noro 684: \BJP
1.1 noro 685: @samp{@}} $B$N8e$m$K$O=*C<5-9f$OI,MW$J$$(B. $B$J$<$J$i(B, @samp{@{} $BJ8JB$S(B
686: @samp{@}}$B$,4{$KJ8$H$J$C$F$$$F(B, @code{if} $BJ8$NMW@A$rK~$?$7$F$$$k$+$i$G(B
687: $B$"$k(B.
1.3 noro 688: \E
689: \BEG
690: No terminator symbol is necessary after @samp{@}},
691: because @samp{@{} statement sequence @samp{@}} already forms a statement,
692: and it satisfies the syntactical requirement of the
693: `@code{if} statement.'
694: \E
1.1 noro 695:
1.3 noro 696: \BJP
1.1 noro 697: @node return $BJ8(B,,, $B%f!<%6Dj5AH!?t$N=q$-J}(B
698: @subsection @code{return} $BJ8(B
1.3 noro 699: \E
700: \BEG
701: @node return statement,,, Writing user defined functions
702: @subsection @code{return} statement
703: \E
1.1 noro 704:
705: @noindent
1.3 noro 706: \JP @code{return} $BJ8$O(B,
707: \EG There are two forms of @code{return} statement.
1.1 noro 708:
709: @example
1.3 noro 710: \JP return $B<0(B;
711: \EG return expression;
1.1 noro 712:
713: return;
714: @end example
715:
716: @noindent
1.3 noro 717: \BJP
1.1 noro 718: $B$N(B 2 $B$D$N7A<0$,$"$k(B. $B$$$:$l$bH!?t$+$iH4$1$k$?$a$NJ8$G$"$k(B. $BA0<T$O(B
719: $BH!?t$NCM$H$7$F(B $B<0(B $B$rJV$9(B. $B8e<T$G$O(B, $BH!?t$NCM$H$7$F2?$,JV$5$l$k$+(B
720: $B$O$o$+$i$J$$(B.
1.3 noro 721: \E
722: \BEG
723: Both forms are used for exiting from a function.
724: The former returns the value of the expression as a function value.
725: The function value of the latter is not defined.
726: \E
1.1 noro 727:
1.3 noro 728: \BJP
1.1 noro 729: @node if $BJ8(B,,, $B%f!<%6Dj5AH!?t$N=q$-J}(B
730: @subsection @code{if} $BJ8(B
1.3 noro 731: \E
732: \BEG
733: @node if statement,,, Writing user defined functions
734: @subsection @code{if} statement
735: \E
1.1 noro 736:
737: @noindent
1.3 noro 738: \JP @code{if} $BJ8$K$O(B
739: \EG There are two forms of @code{if} statement.
1.1 noro 740:
741: @example
1.3 noro 742: \BJP
1.1 noro 743: if ( $B<0(B ) if ( $B<0(B )
744: $BJ8(B $B5Z$S(B $BJ8(B
745: else
746: $BJ8(B
1.3 noro 747: \E
748: \BEG
749: if ( expression ) if ( expression )
750: statement and statement
751: else
752: statement
753: \E
1.1 noro 754: @end example
755:
756: @noindent
1.3 noro 757: \BJP
1.1 noro 758: $B$N(B 2 $B<oN`$,$"$k(B. $B$3$l$i$NF0:n$OL@$i$+$G$"$k$,(B, $BJ8$N0LCV$K(B @code{if} $BJ8(B
759: $B$,Mh$?>l9g$KCm0U$rMW$9$k(B. $B<!$NNc$r9M$($F$_$h$&(B.
1.3 noro 760: \E
761: \BEG
762: The interpretation of these forms are obvious. However, be careful
763: when another @code{if} statement comes at the place for `statement'.
764: Let us examine the following example.
765: \E
1.1 noro 766:
767: @example
1.3 noro 768: \BJP
1.1 noro 769: if ( $B<0(B )
770: if ( $B<0(B ) $BJ8(B
771: else
772: $BJ8(B
1.3 noro 773: \E
774: \BEG
775: if ( expression1 )
776: if ( expression2 ) statement1
777: else
778: statement2
779: \E
1.1 noro 780: @end example
781:
782: @noindent
1.3 noro 783: \BJP
1.1 noro 784: $B$3$N>l9g(B, $B;z2<$2$+$i$O(B, @code{else} $B0J2<$O(B, $B:G=i$N(B @code{if} $B$KBP1~$9$k(B
785: $B$h$&$K8+$($k$,(B, $B%Q!<%6$O(B, $B<+F0E*$K(B 2 $BHVL\$N(B @code{if} $B$KBP1~$9$k$HH=CG$9$k(B.
786: $B$9$J$o$A(B, 2 $B<oN`$N(B @code{if} $BJ8$r5v$7$?$?$a$K(B, $BJ8K!$K[#Kf@-$,8=$l(B, $B$=$l$r(B
787: $B2r>C$9$k$?$a$K(B, @code{else} $B0J2<$O(B, $B:G$b6a$$(B @code{if} $B$KBP1~$9$k$H(B
788: $B$$$&5,B'$,E,MQ$5$l$k$N$G$"$k(B. $B=>$C$F(B, $B$3$NNc$O(B,
1.3 noro 789: \E
790: \BEG
791: One might guess @code{statement2} after @code{else} corresponds with the
792: first @code{if ( expression1 )} by its appearance of indentation.
793: But, as a matter of fact, the @code{Asir} parser decides that it
794: correspond with the second @code{if ( expression2 )}.
795: Ambiguity due to such two kinds of forms of @code{if} statement is
796: thus solved by introducing a rule that a statement preceded by an
797: @code{else} matches to the nearest preceding @code{if}.
798:
799: Therefore, rearrangement of the above example for improving readability
800: according to the actual interpretation gives the following.
801: \E
1.1 noro 802:
803: @example
1.3 noro 804: \BJP
1.1 noro 805: if ( $B<0(B ) @{
806: if ( $B<0(B ) $BJ8(B else $BJ8(B
807: @}
1.3 noro 808: \E
809: \BEG
810: if ( expression1 ) @{
811: if ( expression2 ) statement1 else statement2
812: @}
813: \E
1.1 noro 814: @end example
815:
816: @noindent
1.3 noro 817: \JP $B$H$$$&0UL#$H$J$k(B. $B;z2<$2$KBP1~$5$;$k$?$a$K$O(B,
818: \BEG
819: On the other hand, in order to reflect the indentation, it must be
820: written as the following.
821: \E
1.1 noro 822:
823: @example
1.3 noro 824: \BJP
1.1 noro 825: if ( $B<0(B ) @{
826: if ( $B<0(B ) $BJ8(B
827: @} else
828: $BJ8(B
1.3 noro 829: \E
830: \BEG
831: if ( expression1 ) @{
832: if ( expression2 ) statement1
833: @} else
834: statement2
835: \E
1.1 noro 836: @end example
837:
838: @noindent
1.3 noro 839: \JP $B$H$7$J$1$l$P$J$i$J$$(B.
1.1 noro 840:
1.3 noro 841: \BJP
1.1 noro 842: @node $B%k!<%W(B break return continue,,, $B%f!<%6Dj5AH!?t$N=q$-J}(B
843: @subsection $B%k!<%W(B, @code{break}, @code{return}, @code{continue}
1.3 noro 844: \E
845: \BEG
846: @node loop break return continue,,, Writing user defined functions
847: @subsection @code{loop}, @code{break}, @code{return}, @code{continue}
848: \E
1.1 noro 849:
850: @noindent
1.3 noro 851: \BJP
1.1 noro 852: $B%k!<%W$r9=@.$9$kJ8$O(B, @code{while} $BJ8(B, @code{for} $BJ8(B, @code{do} $BJ8(B
853: $B$N(B 3 $B<oN`$,$"$k(B.
1.3 noro 854: \E
855: \BEG
856: There are three kinds of statements for loops (repetitions):
857: the @code{while} statement, the @code{for} statement, and the
858: @code{do} statement.
859: \E
1.1 noro 860:
861: @itemize @bullet
862: @item
1.3 noro 863: \JP @code{while} $BJ8(B
864: \EG @code{while} statement
1.4 noro 865: @*
1.3 noro 866: \JP $B7A<0$O(B,
867: \EG It has the following form.
1.1 noro 868:
869: @example
1.3 noro 870: \JP while ( $B<0(B ) $BJ8(B
871: \EG while ( expression ) statement
1.1 noro 872: @end example
873:
874: @noindent
1.3 noro 875: \BJP
1.1 noro 876: $B$G(B, $B$3$l$O(B, $B<0(B $B$rI>2A$7$F(B, $B$=$NCM$,(B 0 $B$G$J$$8B$j(B $BJ8(B $B$r<B9T$9$k$H$$$&(B
877: $B0UL#$H$J$k(B. $B$?$H$($P(B $B<0(B $B$,(B 1 $B$J$i$P(B, $BC1=c$JL58B%k!<%W$H$J$k(B.
1.3 noro 878: \E
879: \BEG
880: This statement specifies that @code{statement} is repeatedly evaluated
881: as far as the @code{expression} evaluates to a non-zero value.
882: If the expression 1 is given to the @code{expression}, it forms an
883: infinite loop.
884: \E
1.1 noro 885:
886: @item
1.3 noro 887: \JP @code{for} $BJ8(B
888: \EG @code{for} statement
1.4 noro 889: @*
1.3 noro 890: \JP $B7A<0$O(B,
891: \EG It has the following form.
1.1 noro 892:
893: @example
1.3 noro 894: \JP for ( $B<0JB$S(B-1; $B<0(B; $B<0JB$S(B-2 ) $BJ8(B
1.7 noro 895: \EG for ( expr list-1; expr; expr list-2 ) statement
1.1 noro 896: @end example
897:
1.3 noro 898: \JP $B$G(B, $B$3$l$O(B
899: \EG This is equivalent to the program
1.1 noro 900:
901: @example
1.3 noro 902: \BJP
1.1 noro 903: $B<0JB$S(B-1 ($B$rC1J8JB$S$K$7$?$b$N(B)
904: while ( $B<0(B ) @{
905: $BJ8(B
906: $B<0JB$S(B-2 ($B$rC1J8JB$S$K$7$?$b$N(B)
907: @}
1.3 noro 908: \E
909: \BEG
1.7 noro 910: expr list-1 (transformed into a sequence of simple statement)
911: while ( expr ) @{
1.3 noro 912: statement
1.7 noro 913: expr list-2 (transformed into a sequence of simple statement)
1.3 noro 914: @}
915: \E
1.1 noro 916: @end example
917:
1.3 noro 918: \JP $B$HEy2A$G$"$k(B.
1.1 noro 919:
920: @item
1.3 noro 921: \JP @code{do} $BJ8(B
922: \EG @code{do} statement
1.4 noro 923: @*
1.1 noro 924: @example
1.3 noro 925: \BJP
1.1 noro 926: do @{
927: $BJ8(B
928: @} while ( $B<0(B )
1.3 noro 929: \E
930: \BEG
931: do @{
932: statement
933: @} while ( expression )
934: \E
1.1 noro 935: @end example
936:
1.3 noro 937: \BJP
1.1 noro 938: $B$O(B, $B@h$K(B $BJ8$r<B9T$7$F$+$i>r7o<0$K$h$kH=Dj$r9T$&=j$,(B @code{while} $BJ8(B
939: $B$H0[$J$C$F$$$k(B.
1.3 noro 940: \E
941: \BEG
942: This statement differs from @code{while} statement by the location of
943: the termination condition: This statement first execute the
944: @code{statement} and then check the condition, whereas @code{while}
945: statement does it in the reverse order.
946: \E
1.1 noro 947: @end itemize
948:
949: @noindent
1.3 noro 950: \BJP
1.1 noro 951: $B%k!<%W$rH4$1=P$9<jCJ$H$7$F(B,
952: @code{break} $BJ85Z$S(B @code{return} $BJ8$,$"$k(B. $B$^$?(B, $B%k!<%W$N@)8f$r(B
953: $B$"$k0LCV$K0\$9<jCJ$H$7$F(B @code{continue} $BJ8$,$"$k(B.
1.3 noro 954: \E
955: \BEG
956: As means for exiting from loops, there are @code{break} statement and
957: @code{return} statement. The @code{continue} statement allows to move
958: the control to a certain point of the loop.
959: \E
1.1 noro 960: @itemize @bullet
961:
962: @item
963: @code{break}
1.4 noro 964: @*
1.3 noro 965: \JP @code{break} $BJ8$O(B, $B$=$l$r0O$`%k!<%W$r0l$D$@$1H4$1$k(B.
966: \EG The @code{break} statement is used to exit the inner most loop.
1.1 noro 967: @item
968: @code{return}
1.4 noro 969: @*
1.3 noro 970: \BJP
1.1 noro 971: @code{return} $BJ8$O(B, $B0lHL$KH!?t$+$iH4$1$k$?$a$NJ8$G$"$j(B,
972: $B%k!<%W$NCf$+$i$G$bM-8z$G$"$k(B.
1.3 noro 973: \E
974: \BEG
975: The @code{return} statement is usually used to exit from a function call
976: and it is also effective in a loop.
977: \E
1.1 noro 978:
979: @item
980: @code{continue}
1.4 noro 981: @*
1.3 noro 982: \BJP
1.1 noro 983: @code{continue} $BJ8$O(B, $B%k!<%W$NK\BN$NJ8$NKvC<$K@)8f$r0\$9(B.
984: $BNc$($P(B @code{for} $BJ8$G$O(B, $B:G8e$N<0JB$S$N<B9T$r9T$$(B, @code{while}
985: $BJ8$G$O>r7o<0$NH=Dj$K0\$k(B.
1.3 noro 986: \E
987: \BEG
988: The @code{continue} statement is used to move the control to the end
989: point of the loop body.
990: For example, the last expression list will be evaluated in a @code{for}
991: statement, and the termination condition will be evaluated in a
992: @code{while} statement.
993: \E
1.1 noro 994: @end itemize
1.5 noro 995:
996: \BJP
997: @node $B9=B$BNDj5A(B,,, $B%f!<%6Dj5AH!?t$N=q$-J}(B
998: @subsection $B9=B$BNDj5A(B
999: \E
1000: \BEG
1001: @node structure definition,,, Writing user defined functions
1002: @subsection structure definition
1003: \E
1004:
1005: \BJP
1006: $B9=B$BN$H$O(B, $B3F@.J,$NMWAG$,L>A0$G%"%/%;%9$G$-$k8GDjD9G[Ns$H;W$C$F$h$$(B.
1007: $B3F9=B$BN$OL>A0$G6hJL$5$l$k(B. $B9=B$BN$O(B, @code{struct} $BJ8$K$h$j@k8@$5$l$k(B.
1008: $B$"$k7?$N9=B$BN$O(B, $BAH$_9~$_4X?t(B @code{newstruct} $B$K$h$j@8@.$5$l$k(B.
1009: $B9=B$BN$N3F%a%s%P$O(B, $B1i;;;R(B @code{->} $B$K$h$j%"%/%;%9$9$k(B.
1010: $B%a%s%P$,9=B$BN$N>l9g(B, @code{->} $B$K$h$k;XDj$OF~$l;R$K$G$-$k(B.
1011: \E
1012:
1013: \BEG
1014: A structure data type is a fixed length array and each component of the array
1015: is accessed by its name. Each type of structure is distinguished by its name.
1016: A structure data type is declared by @code{struct} statement.
1017: A structure object is generated by a builtin function @code{newstruct}.
1018: Each member of a structure is accessed by an operatator @code{->}.
1019: If a member of a structure is again a structure, then the specification
1020: by @code{->} can be nested.
1021: \E
1022:
1023: @example
1024: [1] struct rat @{num,denom@};
1025: 0
1026: [2] A = newstruct(rat);
1027: @{0,0@}
1028: [3] A->num = 1;
1029: 1
1030: [4] A->den = 2;
1031: 2
1032: [5] A;
1033: @{1,2@}
1034: @end example
1.1 noro 1035:
1.3 noro 1036: \BJP
1.1 noro 1037: @node $B$5$^$6$^$J<0(B,,, $B%f!<%6Dj5AH!?t$N=q$-J}(B
1038: @subsection $B$5$^$6$^$J<0(B
1.3 noro 1039: \E
1040: \BEG
1041: @node various expressions,,, Writing user defined functions
1042: @subsection various expressions
1043: \E
1.1 noro 1044:
1045: @noindent
1.3 noro 1046: \JP $B<g$J<0$N9=@.MWAG$H$7$F$O(B, $B<!$N$h$&$J$b$N$,$"$k(B.
1047: \EG Major elements to construct expressions are the following:
1.1 noro 1048:
1049: @itemize @bullet
1050: @item
1.3 noro 1051: \JP $B2C8:>h=|(B, $BQQ(B
1052: \EG addition, subtraction, multiplication, division, exponentiation
1.4 noro 1053: @*
1.3 noro 1054: \BJP
1.1 noro 1055: $BQQ$O(B, @samp{^} $B$K$h$jI=$9(B. $B=|;;(B @samp{/} $B$O(B, $BBN$H$7$F$N1i;;$KMQ$$$k(B.
1056: $BNc$($P(B, @code{2/3} $B$OM-M}?t$N(B @code{2/3} $B$rI=$9(B.
1057: $B@0?t=|;;(B, $BB?9`<0=|;;(B ($B>jM>$r4^$`1i;;(B) $B$K$OJLESAH$_9~$_H!?t$,MQ0U$5$l$F$$$k(B.
1.3 noro 1058: \E
1059: \BEG
1060: The exponentiation is denoted by @samp{^}. (This differs from C language.)
1061: Division denoted by @samp{/} is used to operate in a field, for example,
1062: @code{2/3} results in a rational number @code{2/3}.
1063: For integer division and polynomial division, both including remainder
1064: operation, built-in functions are provided.
1065: \E
1.1 noro 1066:
1067: @example
1068: x+1 A^2*B*afo X/3
1069: @end example
1070:
1071: @item
1.3 noro 1072: \JP $B%$%s%G%C%/%9$D$-$NJQ?t(B
1073: \EG programming variables with indices
1.4 noro 1074: @*
1.3 noro 1075: \BJP
1.1 noro 1076: $B%Y%/%H%k(B, $B9TNs(B, $B%j%9%H$NMWAG$O%$%s%G%C%/%9$rMQ$$$k$3$H$K$h$j<h$j=P$;$k(B.
1077: $B%$%s%G%C%/%9$O(B 0 $B$+$i;O$^$k$3$H$KCm0U$9$k(B. $B<h$j=P$7$?MWAG$,%Y%/%H%k(B,
1078: $B9TNs(B, $B%j%9%H$J$i(B, $B$5$i$K%$%s%G%C%/%9$r$D$1$k$3$H$bM-8z$G$"$k(B.
1.3 noro 1079: \E
1080: \BEG
1081: An element of a vector, a matrix or a list can be referred to by
1082: indexing.
1083: Note that the indices begin with number 0. When the referred element
1084: is again a vector, a matrix or a list, repeated indexing is also
1085: effective.
1086: \E
1.1 noro 1087:
1088: @example
1089: V[0] M[1][2]
1090: @end example
1091:
1092: @item
1.3 noro 1093: \JP $BHf3S1i;;(B
1094: \EG comparison operation
1.4 noro 1095: @*
1.3 noro 1096: \BJP
1.1 noro 1097: $BEy$7$$(B (@samp{==}), $BEy$7$/$J$$(B (@samp{!=}), $BBg>.(B (@samp{>}, @samp{<},
1098: @samp{>=}, @samp{<=}) $B$N(B 2 $B9`1i;;$,$"$k(B. $B??$J$i$PM-M}?t$N(B 1, $B56$J$i$P(B
1099: 0 $B$rCM$K;}$D(B.
1.3 noro 1100: \E
1101: \BEG
1102: There are comparison operations
1103: @samp{==} for equivalence, @samp{!=} for non-equivalence,
1104: @samp{>}, @samp{<},@samp{>=}, and @samp{<=} for larger or smaller.
1105: The results of these operations are either value 1 for the truth,
1106: or 0 for the false.
1107: \E
1.1 noro 1108:
1109: @item
1.3 noro 1110: \JP $BO@M}<0(B
1111: \EG logical expression
1.4 noro 1112: @*
1.3 noro 1113: \BJP
1.1 noro 1114: $BO@M}@Q(B (@samp{&&}), $BO@M}OB(B (@samp{||}) $B$N(B 2 $B9`1i;;$H(B, $BH]Dj(B (@samp{!})
1115: $B$,MQ0U$5$l$F$$$k(B. $BCM$O$d$O$j(B 1, 0 $B$G$"$k(B.
1.3 noro 1116: \E
1117: \BEG
1118: There are two binary logical operations
1119: @samp{&&} for logical @samp{conjunction}(and),
1120: @samp{||} for logical @samp{disjunction}(or),
1121: and one unary logical operation @samp{!} for logical @samp{negation}(not).
1122: The results of these operations are either value 1 for the truth,
1123: and 0 for the false.
1124: \E
1.1 noro 1125:
1126: @item
1.3 noro 1127: \JP $BBeF~(B
1128: \EG assignment
1.4 noro 1129: @*
1.3 noro 1130: \BJP
1.1 noro 1131: $BDL>o$NBeF~$O(B @samp{=} $B$G9T$&(B. $B$3$N$[$+(B, $B;;=Q1i;;;R$HAH$_9g$o$;$F(B
1132: $BFC<l$JBeF~$r9T$&$3$H$b$G$-$k(B.
1.3 noro 1133: \E
1134: \BEG
1135: Value assignment of a program variable is usually done by @samp{=}.
1136: There are special assignments combined with arithmetic operations.
1137: \E
1.1 noro 1138: (@samp{+=}, @samp{-=}, @samp{*=}, @samp{/=}, @samp{^=})
1139:
1140: @example
1.3 noro 1141: \JP A = 2 A *= 3 ($B$3$l$O(B A = A*3 $B$HF1$8(B; $B$=$NB>$N1i;;;R$bF1MM(B)
1.7 noro 1142: \EG A = 2 A *= 3 (the same as A = A*3; The others are alike.)
1.1 noro 1143: @end example
1144: @item
1.3 noro 1145: \JP $BH!?t8F$S=P$7(B
1146: \EG function call
1.4 noro 1147: @*
1.3 noro 1148: \JP $BH!?t8F$S=P$7$b<0$N0l<o$G$"$k(B.
1149: \EG A function call is also an expression.
1.1 noro 1150: @item
1151: @samp{++}, @samp{--}
1.4 noro 1152: @*
1.3 noro 1153: \JP $B$3$l$i$O(B, $BJQ?t$NA08e$K$D$$$F(B, $B$=$l$>$l<!$N$h$&$JA`:n(B, $BCM$rI=$9(B.
1154: \BEG
1155: These operators are attached to or before a program variable,
1156: and denote special operations and values.
1157: \E
1.1 noro 1158: @example
1.3 noro 1159: \BJP
1.1 noro 1160: A++ $BCM$O85$N(B A $B$NCM(B, A = A+1
1161: A-- $BCM$O85$N(B A $B$NCM(B, A = A-1
1162: ++A A = A+1, $BCM$OJQ2=8e$NCM(B
1163: --A A = A-1, $BCM$OJQ2=8e$NCM(B
1.3 noro 1164: \E
1165: \BEG
1166: A++ the expression value is the previous value of A, and A = A+1
1167: A-- the expression value is the previous value of A, and A = A-1
1.7 noro 1168: ++A A = A+1, and the value is the one after increment of A
1169: --A A = A-1, and the value is the one after decrement of A
1.3 noro 1170: \E
1.1 noro 1171: @end example
1172:
1173: @end itemize
1174:
1.3 noro 1175: \BJP
1.1 noro 1176: @node $B%W%j%W%m%;%C%5(B,,, $B%f!<%6Dj5AH!?t$N=q$-J}(B
1177: @subsection $B%W%j%W%m%;%C%5(B
1.3 noro 1178: \E
1179: \BEG
1180: @node preprocessor,,, Writing user defined functions
1181: @subsection preprocessor
1182: \E
1.1 noro 1183:
1184: @noindent
1.3 noro 1185: \BJP
1.1 noro 1186: @b{Asir} $B$N%f!<%68@8l$O(B C $B8@8l$rLO$7$?$b$N$G$"$k(B. C $B$NFCD'$H$7$F(B,
1187: $B%W%j%W%m%;%C%5(B @code{cpp} $B$K$h$k%^%/%mE83+(B, $B%U%!%$%k$N%$%s%/%k!<%I(B
1188: $B$,$"$k$,(B, @b{Asir} $B$K$*$$$F$b%f!<%68@8l%U%!%$%k$NFI$_9~$_$N:](B
1189: @code{cpp} $B$rDL$7$F$+$iFI$_9~$`$3$H$H$7$?(B. $B$3$l$K$h$j%f!<%68@8l(B
1190: $B%U%!%$%kCf$G(B @code{#include}, @code{#define}, @code{#if} $B$J$I$,;H$($k(B.
1.3 noro 1191: \E
1192: \BEG
1193: he @b{Asir} user language imitates C language. A typical features of
1194: C language include macro expansion and file inclusion by the
1195: preprocessor @code{cpp}. Also, @b{Asir} read in user program files
1196: through @code{cpp}. This enables @b{Asir} user to use
1197: @code{#include}, @code{#define}, @code{#if} etc. in his programs.
1198: \E
1.1 noro 1199:
1200: @itemize @bullet
1201: @item
1202: @code{#include}
1.4 noro 1203: @*
1.3 noro 1204: \BJP
1.1 noro 1205: @code{cpp} $B$KFC$K0z?t$rEO$5$J$$$?$a(B, $B%$%s%/%k!<%I%U%!%$%k$O(B,
1206: @code{#include} $B$,=q$+$l$F$$$k%U%!%$%k$HF1$8%G%#%l%/%H%j$G%5!<%A$5$l$k(B.
1.3 noro 1207: \E
1208: \BEG
1209: Include files are searched within the same directory as the file
1210: containing @code{#include} so that no arguments are passed to @code{cpp}.
1211: \E
1.1 noro 1212:
1213: @item
1214: @code{#define}
1.4 noro 1215: @*
1.3 noro 1216: \JP $B$3$l$O(B, C $B$K$*$1$k$N$HA4$/F1MM$KMQ$$$k$3$H$,$G$-$k(B.
1217: \EG This can be used just as in C language.
1.1 noro 1218:
1219: @item
1220: @code{#if}
1.4 noro 1221: @*
1.3 noro 1222: \BJP
1.1 noro 1223: @code{/*}, @code{*/} $B$K$h$k%3%a%s%H$OF~$l;R$K$G$-$J$$$N$G(B, $B%W%m%0%i%`(B
1224: $B$NBg$-$JItJ,$r%3%a%s%H%"%&%H$9$k:]$K(B, @code{#if 0}, @code{#endif}
1225: $B$r;H$&$HJXMx$G$"$k(B.
1.3 noro 1226: \E
1227: \BEG
1228: This is conveniently used to comment out a large part of a user program
1229: that may contain comments by @code{/*} and @code{*/},
1230: because such comments cannot be nested.
1231: \E
1.1 noro 1232: @end itemize
1233:
1234: @noindent
1.3 noro 1235: \JP $B<!$NNc$O(B, @samp{defs.h} $B$K$"$k%^%/%mDj5A$G$"$k(B.
1236: \EG the following are the macro definitions in @samp{defs.h}.
1.1 noro 1237:
1238: @example
1239: #define ZERO 0
1240: #define NUM 1
1241: #define POLY 2
1242: #define RAT 3
1243: #define LIST 4
1244: #define VECT 5
1245: #define MAT 6
1246: #define STR 7
1247: #define N_Q 0
1248: #define N_R 1
1249: #define N_A 2
1250: #define N_B 3
1251: #define N_C 4
1252: #define V_IND 0
1253: #define V_UC 1
1254: #define V_PF 2
1255: #define V_SR 3
1256: #define isnum(a) (type(a)==NUM)
1257: #define ispoly(a) (type(a)==POLY)
1258: #define israt(a) (type(a)==RAT)
1259: #define islist(a) (type(a)==LIST)
1260: #define isvect(a) (type(a)==VECT)
1261: #define ismat(a) (type(a)==MAT)
1262: #define isstr(a) (type(a)==STR)
1263: #define FIRST(L) (car(L))
1264: #define SECOND(L) (car(cdr(L)))
1265: #define THIRD(L) (car(cdr(cdr(L))))
1266: #define FOURTH(L) (car(cdr(cdr(cdr(L)))))
1267: #define DEG(a) deg(a,var(a))
1268: #define LCOEF(a) coef(a,deg(a,var(a)))
1269: #define LTERM(a) coef(a,deg(a,var(a)))*var(a)^deg(a,var(a))
1270: #define TT(a) car(car(a))
1271: #define TS(a) car(cdr(car(a)))
1272: #define MAX(a,b) ((a)>(b)?(a):(b))
1273: @end example
1.2 noro 1274:
1275:
1.3 noro 1276: \BJP
1.2 noro 1277: @node $B%*%W%7%g%s;XDj(B,,, $B%f!<%6Dj5AH!?t$N=q$-J}(B
1278: @subsection $B%*%W%7%g%s;XDj(B
1.3 noro 1279: \E
1280: \BEG
1281: @node option,,, Writing user defined functions
1282: @subsection option
1283: \E
1.2 noro 1284:
1.3 noro 1285: \BJP
1.2 noro 1286: $B%f!<%6Dj5A4X?t$,(B @var{N} $BJQ?t$G@k8@$5$l$?>l9g(B, $B$=$N4X?t$O(B, @var{N}
1287: $BJQ?t$G$N8F$S=P$7$N$_$,5v$5$l$k(B.
1.3 noro 1288: \E
1289: \BEG
1290: If a user defined function is declared with @var{N} arguments,
1291: then the function is callable with @var{N} arguments only.
1292: \E
1.2 noro 1293:
1294: @example
1295: [0] def factor(A) @{ return fctr(A); @}
1296: [1] factor(x^5-1,3);
1297: evalf : argument mismatch in factor()
1298: return to toplevel
1299: @end example
1300:
1.3 noro 1301: \BJP
1.2 noro 1302: $BITDj8D0z?t$N4X?t$r%f!<%68@8l$G5-=R$7$?$$>l9g(B, $B%j%9%H(B, $BG[Ns$rMQ$$$k$3$H$G(B
1303: $B2DG=$H$J$k$,(B, $B<!$N$h$&$J$h$jJ,$+$j$d$9$$J}K!$b2DG=$G$"$k(B.
1.3 noro 1304: \E
1305: \BEG
1306: A function with indefinite number of arguments can be realized by
1307: using a list or an array as its argument. Another method is available
1308: as follows:
1309: \E
1.2 noro 1310:
1311: @example
1312: % cat factor
1313: def factor(F)
1314: @{
1315: Mod = getopt(mod);
1316: ModType = type(Mod);
1317: if ( ModType == 1 ) /* 'mod' is not specified. */
1318: return fctr(F);
1319: else if ( ModType == 0 ) /* 'mod' is a number */
1320: return modfctr(F,Mod);
1321: @}
1322: @end example
1323:
1324: @example
1325: [0] load("factor")$
1326: [1] factor(x^5-1);
1327: [[1,1],[x-1,1],[x^4+x^3+x^2+x+1,1]]
1328: [2] factor(x^5-1|mod=11);
1329: [[1,1],[x+6,1],[x+2,1],[x+10,1],[x+7,1],[x+8,1]]
1330: @end example
1331:
1.3 noro 1332: \BJP
1.2 noro 1333: 2 $BHVL\$N(B @code{factor()} $B$N8F$S=P$7$K$*$$$F(B, $B4X?tDj5A$N:]$K@k8@$5$l$?0z(B
1.3 noro 1334: $B?t(B @code{x^5-1}$B$N8e$m$K(B @code{|mod=11} $B$,CV$+$l$F$$$k(B. $B$3$l$O(B, $B4X?t<B9T;~(B
1335: $B$K(B, @code{mod} $B$H$$$&(B keyword $B$KBP$7$F(B @code{11} $B$H$$$&CM$r3d$jEv$F$k$3$H(B
1.2 noro 1336: $B$r;XDj$7$F$$$k(B. $B$3$l$r%*%W%7%g%s;XDj$H8F$V$3$H$K$9$k(B. $B$3$NCM$O(B
1337: @code{getopt(mod)} $B$G<h$j=P$9$3$H$,$G$-$k(B. 1 $BHVL\$N8F$S=P$7$N$h$&$K(B
1.3 noro 1338: @code{mod} $B$KBP$9$k%*%W%7%g%s;XDj$,$J$$>l9g$K$O(B, @code{getopt(mod)} $B$O7?(B
1.2 noro 1339: $B<1JL;R(B -1 $B$N%*%V%8%'%/%H$rJV$9(B. $B$3$l$K$h$j(B, $B;XDj$,$J$$>l9g$NF0:n$r(B if $BJ8(B
1340: $B$K$h$j5-=R$G$-$k(B. @samp{|} $B$N8e$m$K$O(B, $BG$0U8D$N%*%W%7%g%s$r(B, @samp{,}
1341: $B$G6h@Z$C$F;XDj$9$k$3$H$,$G$-$k(B.
1.3 noro 1342: \E
1343: \BEG
1344: In the second call of @code{factor()}, @code{|mod=11} is placed
1345: after the argument @code{x^5-1}, which appears in the declaration of
1346: @code{factor()}. This means that the value @code{11} is assigned to
1347: the keyword @code{mod} when the function is executed. The value
1348: can be retrieved by @code{getopt(mod)}. We call such machinery
1349: @var{option}. If the option for @var{mod} is not specified,
1350: @code{getopt(mod)} returns an object whose type is -1. By this
1351: feature, one can describe the behaviour of the function when
1352: the option is not specified by @var{if} statements.
1353: After @samp{|} one can append any number of options seperated by @samp{,}.
1354: \E
1.2 noro 1355: @example
1356: [100] xxx(1,2,x^2-1,[1,2,3]|proc=1,index=5);
1357: @end example
1358:
1.1 noro 1359:
1.8 ! takayama 1360: \BJP
! 1361: @node $B%b%8%e!<%k(B,,, $B%f!<%6Dj5AH!?t$N=q$-J}(B
! 1362: @subsection $B%b%8%e!<%k(B
! 1363: \E
! 1364: \BEG
! 1365: @node module,,, Writing user defined functions
! 1366: @subsection module
! 1367: \E
! 1368:
! 1369: \BJP
! 1370: $B%i%$%V%i%j$GDj5A$5$l$F$$$k4X?t(B, $BJQ?t$r%+%W%;%k2=$9$k;EAH$_$,(B
! 1371: $B%b%8%e!<%k(B (module) $B$G$"$k(B.
! 1372: $B$O$8$a$K%b%8%e!<%k$rMQ$$$?%W%m%0%i%`$NNc$r$"$2$h$&(B.
! 1373: \E
! 1374: \BEG
! 1375: Function names and variables in a library may be
! 1376: encapsulated by module.
! 1377: Let us see an example of using module
! 1378: \E
! 1379:
! 1380: @example
! 1381: module stack;
! 1382:
! 1383: static Sp $
! 1384: Sp = 0$
! 1385: static Ssize$
! 1386: Ssize = 100$
! 1387: static Stack $
! 1388: Stack = newvect(Ssize)$
! 1389: localf push $
! 1390: localf pop $
! 1391:
! 1392: def push(A) @{
! 1393: if (Sp >= Ssize) @{print("Warning: Stack overflow\nDiscard the top"); pop();@}
! 1394: Stack[Sp] = A;
! 1395: Sp++;
! 1396: @}
! 1397: def pop() @{
! 1398: local A;
! 1399: if (Sp <= 0) @{print("Stack underflow"); return 0;@}
! 1400: Sp--;
! 1401: A = Stack[Sp];
! 1402: return A;
! 1403: @}
! 1404: endmodule;
! 1405:
! 1406: def demo() @{
! 1407: stack.push(1);
! 1408: stack.push(2);
! 1409: print(stack.pop());
! 1410: print(stack.pop());
! 1411: @}
! 1412: @end example
! 1413:
! 1414: \BJP
! 1415: $B%b%8%e!<%k$O(B @code{module} $B%b%8%e!<%kL>(B $B!A(B @code{endmodule}$B$G0O$`(B.
! 1416: $B%b%8%e!<%k$NCf$@$1$G;H$&Bg0hJQ?t$O(B @code{static} $B$G@k8@$9$k(B.
! 1417: $B$3$NJQ?t$O%b%8%e!<%k$N30$+$i$O;2>H$b$G$-$J$$$7JQ99$b$G$-$J$$(B.
! 1418: $B%b%8%e!<%k$N30$NBg0hJQ?t$O(B @code{extern} $B$G@k8@$9$k(B.
! 1419: \E
! 1420: \BEG
! 1421: Module is encapsulated by the sentences
! 1422: @code{module} module name
! 1423: and
! 1424: @code{endmodule}.
! 1425: A variable of a module is declared with the key word @code{static}.
! 1426: The static variables cannot be refered nor changed out of the module,
! 1427: but it can be refered and changed in any functions in the module.
! 1428: A global variable which can be refered and changed at any place
! 1429: is declared with the key word @code{extern}.
! 1430: \E
! 1431:
! 1432: \BJP
! 1433: $B%b%8%e!<%kFbIt$GDj5A$9$k4X?t$O(B @code{localf} $B$rMQ$$$F@k8@$7$J$$$H$$$1$J$$(B.
! 1434: $B>e$NNc$G$O(B @code{push} $B$H(B @code{pop} $B$r@k8@$7$F$$$k(B.
! 1435: $B$3$N@k8@$OI,?\$G$"$k(B.
! 1436: \E
! 1437: \BEG
! 1438: Any function defined in a module must be declared forward
! 1439: with the keyword @code{localf}.
! 1440: In the example above, @code{push} and @code{pop} are declared.
! 1441: This declaration is necessary.
! 1442: \E
! 1443:
! 1444: \BJP
! 1445: $B%b%8%e!<%k(B @code{moduleName} $B$GDj5A$5$l$?4X?t(B @code{functionName} $B$r(B
! 1446: $B%b%8%e!<%k$N30$+$i8F$V$K$O(B
! 1447: @code{moduleName.functionName($B0z?t(B1, $B0z?t(B2, ... )}
! 1448: $B$J$k7A<0$G$h$V(B.
! 1449: $B%b%8%e!<%k$NCf$+$i$O(B, $B4X?tL>$N$_$G$h$$(B.
! 1450: $B<!$NNc$G$O(B, $B%b%8%e!<%k$N30$+$i%b%8%e!<%k(B @code{stack} $B$GDj5A$5$l$?4X?t(B @code{push},
! 1451: @code{pop} $B$r8F$s$G$$$k(B.
! 1452: \E
! 1453: \BEG
! 1454: A function @code{functionName} defined in a module @code{moduleName}
! 1455: can be called by the expression
! 1456: @code{moduleName.functioName(arg1, arg2, ...)}
! 1457: out of the module.
! 1458: Inside the module, @code{moduleName.} is not necessary.
! 1459: In the example below, the functions @code{push} and @code{pop} defined
! 1460: in the module @code{stack} are called out of the module.
! 1461: \E
! 1462:
! 1463: @example
! 1464: stack.push(2);
! 1465: print( stack.pop() );
! 1466: 2
! 1467: @end example
! 1468:
! 1469: \BJP
! 1470: $B%b%8%e!<%k$GMQ$$$k4X?tL>$O6I=jE*$G$"$k(B.
! 1471: $B$D$^$j%b%8%e!<%k$N30$dJL$N%b%8%e!<%k$GDj5A$5$l$F$$$k4X?tL>$HF1$8L>A0$,(B
! 1472: $BMxMQ$G$-$k(B.
! 1473: \E
! 1474: \BEG
! 1475: Any function name defined in a module is local.
! 1476: In other words, the same function name may be used out of the module
! 1477: to define a different function.
! 1478: \E
! 1479:
! 1480: \BJP
! 1481: $B%b%8%e!<%k5!G=$OBg5,LO%i%$%V%i%j$N3+H/$rA[Dj$7$F$$$k(B.
! 1482: $B%i%$%V%i%j$rI,MW$K1~$8$FJ,3d%m!<%I$9$k$K$O(B, $B4X?t(B @code{module_definedp} $B$rMQ$$$k$N$,(B
! 1483: $BJXMx$G$"$k(B.
! 1484: $B%G%^%s%I%m!<%I$O$?$H$($P<!$N$h$&$K9T$J$($PNI$$(B.
! 1485: \E
! 1486: \BEG
! 1487: The module structure of asir is introduced to develop large libraries.
! 1488: In order to load libraries on demand, the command @code{module_definedp}
! 1489: will be useful.
! 1490: The below is an example of demand loading.
! 1491: \E
! 1492:
! 1493: @example
! 1494: if (!module_definep("stack")) load("stack.rr") $
! 1495: @end example
! 1496:
! 1497: \BJP
! 1498: asir $B$G$O6I=jJQ?t$N@k8@$OITMW$G$"$C$?(B.
! 1499: $B$7$+$7%b%8%e!<%k(B stack $B$NNc$r8+$l$PJ,$+$k$h$&$K(B, @code{local A;} $B$J$k7A<0$G(B
! 1500: $B6I=jJQ?t$r@k8@$G$-$k(B.
! 1501: $B%-!<%o!<%I(B @code{local} $B$rMQ$$$k$H(B, $B@k8@5!G=$,M-8z$H$J$k(B.
! 1502: $B@k8@5!G=$rM-8z$K$9$k$H(B, $B@k8@$5$l$F$J$$JQ?t$O%m!<%I$NCJ3,$G(B
! 1503: $B%(%i!<$r5/$3$9(B.
! 1504: $BJQ?tL>$N%?%$%W%_%9$K$h$kM=4|$7$J$$%H%i%V%k$rKI$0$K$O(B,
! 1505: $B@k8@5!G=$rM-8z$K$7$F%W%m%0%i%`$9$k$N$,$h$$(B.
! 1506: \E
! 1507: \BEG
! 1508: It is not necessary to declare local variables in asir.
! 1509: As you see in the example of the stack module,
! 1510: we may declare local variables by the key word @code{local}.
! 1511: Once this key word is used, asir requires to declare all the
! 1512: variables.
! 1513: In order to avoid some troubles to develop a large libraries,
! 1514: it is recommended to use @code{local} declarations.
! 1515: \E
! 1516:
! 1517: \BJP
! 1518: $B%b%8%e!<%kFb$N4X?t$r$=$N%b%8%e!<%k$,Dj5A$5$l$kA0$K(B
! 1519: $B8F$S=P$9$h$&$J4X?t$r=q$/$H$-$K$O(B, $B$=$N4X?t$NA0$G%b%8%e!<%k$r<!$N$h$&$K(B
! 1520: $B%W%m%H%?%$%W@k8@$7$F$*$/I,MW$,$"$k(B.
! 1521: \E
! 1522: \BEG
! 1523: When we need to call a function in a module before the module is defined,
! 1524: we must make a prototype declaration as the example below.
! 1525: \E
! 1526:
! 1527: @example
! 1528: /* Prototype declaration of the module stack */
! 1529: module stack;
! 1530: localf push $
! 1531: localf pop $
! 1532: endmodule;
! 1533:
! 1534: def demo() @{
! 1535: print("----------------");
! 1536: stack.push(1);
! 1537: print(stack.pop());
! 1538: print("---------------");
! 1539: @}
! 1540:
! 1541: module stack;
! 1542: /* The body of the module stack */
! 1543: endmodule;
! 1544: @end example
FreeBSD-CVSweb <freebsd-cvsweb@FreeBSD.org>
![[BACK]](/icons/cvsweb/back.gif){kind=icon}
Return to asir.texi CVS log ![[TXT]](/icons/cvsweb/text.gif){kind=icon}
![[DIR]](/icons/cvsweb/dir.gif){kind=icon}
Up to [local] / OpenXM / src / asir-doc / parts