From: <bi...@us...> - 2009-01-02 18:13:59
|
Revision: 3848 http://oorexx.svn.sourceforge.net/oorexx/?rev=3848&view=rev Author: bigrixx Date: 2009-01-02 18:13:54 +0000 (Fri, 02 Jan 2009) Log Message: ----------- Add a section describing the general whitespace concept Modified Paths: -------------- docs/trunk/rexxref/intro.sgml Modified: docs/trunk/rexxref/intro.sgml =================================================================== --- docs/trunk/rexxref/intro.sgml 2009-01-02 15:53:52 UTC (rev 3847) +++ docs/trunk/rexxref/intro.sgml 2009-01-02 18:13:54 UTC (rev 3848) @@ -520,6 +520,28 @@ </itemizedlist></para> </section> +<section id="whitespace"><title>Whitespace</title> +<indexterm><primary>whitespace</primary></indexterm> +<para>A whitespace character is one that the interpreter recognizes as a "blank" +or "space" character. There are two characters used by Rexx as whitespace that +can be used interchangably: +</para> +<variablelist> +<varlistentry><term><emphasis role="bold">(blank)</emphasis></term> +<listitem><para>A "blank" or "space" character. This is represented by '20'X in +ASCII implementations. +</para></listitem></varlistentry> +<varlistentry><term><emphasis role="bold">(horizontal tab)</emphasis></term> +<listitem><para>A "tab". This is represented by '09'X in ASCII implementations. +</para></listitem></varlistentry> +<variablelist> +<para>Horizontal tabs encountered in Rexx program source are converted into +blanks, allowing tab characters and blanks to be use interchangeably in source. +Additionally, Rexx operations such as the PARSE instruction or the SUBWORD() +built-in function will also accept either blank or tab characters as word +delimiters.</para> +</section> + <section id="cmts"><title>Comments</title> <indexterm><primary>comments</primary></indexterm> <para>A comment is a sequence of characters delimited by specific characters. This was sent by the SourceForge.net collaborative development platform, the world's largest Open Source development site. |
From: <bi...@us...> - 2009-01-02 18:20:13
|
Revision: 3849 http://oorexx.svn.sourceforge.net/oorexx/?rev=3849&view=rev Author: bigrixx Date: 2009-01-02 18:20:06 +0000 (Fri, 02 Jan 2009) Log Message: ----------- Fix end tag syntax error Modified Paths: -------------- docs/trunk/rexxref/intro.sgml Modified: docs/trunk/rexxref/intro.sgml =================================================================== --- docs/trunk/rexxref/intro.sgml 2009-01-02 18:13:54 UTC (rev 3848) +++ docs/trunk/rexxref/intro.sgml 2009-01-02 18:20:06 UTC (rev 3849) @@ -534,7 +534,7 @@ <varlistentry><term><emphasis role="bold">(horizontal tab)</emphasis></term> <listitem><para>A "tab". This is represented by '09'X in ASCII implementations. </para></listitem></varlistentry> -<variablelist> +</variablelist> <para>Horizontal tabs encountered in Rexx program source are converted into blanks, allowing tab characters and blanks to be use interchangeably in source. Additionally, Rexx operations such as the PARSE instruction or the SUBWORD() This was sent by the SourceForge.net collaborative development platform, the world's largest Open Source development site. |
From: <bi...@us...> - 2009-01-02 22:20:29
|
Revision: 3851 http://oorexx.svn.sourceforge.net/oorexx/?rev=3851&view=rev Author: bigrixx Date: 2009-01-02 21:47:36 +0000 (Fri, 02 Jan 2009) Log Message: ----------- [ 2178822 ] 1.11.2.4. Logical Operator description Modified Paths: -------------- docs/trunk/rexxref/intro.sgml Modified: docs/trunk/rexxref/intro.sgml =================================================================== --- docs/trunk/rexxref/intro.sgml 2009-01-02 21:41:21 UTC (rev 3850) +++ docs/trunk/rexxref/intro.sgml 2009-01-02 21:47:36 UTC (rev 3851) @@ -1653,9 +1653,13 @@ <secondary>logical</secondary></indexterm> <para>A character string has the value false if it is <computeroutput>0</computeroutput>, and true -if it is <computeroutput>1</computeroutput>. A logical operator can take at -least two values and return <computeroutput>0</computeroutput> or -<computeroutput>1</computeroutput> as appropriate: </para> +if it is <computeroutput>1</computeroutput>. The logical operators take one or +two such values and return +<computeroutput>0</computeroutput> or +<computeroutput>1</computeroutput> as appropriate. Values other than +<computeroutput>0</computeroutput> or +<computeroutput>1</computeroutput> are not permitted. +</para> <variablelist> <varlistentry><term>&</term> <listitem><para>AND -- returns <computeroutput>1</computeroutput> if both This was sent by the SourceForge.net collaborative development platform, the world's largest Open Source development site. |
From: <bi...@us...> - 2009-01-02 22:20:34
|
Revision: 3850 http://oorexx.svn.sourceforge.net/oorexx/?rev=3850&view=rev Author: bigrixx Date: 2009-01-02 21:41:21 +0000 (Fri, 02 Jan 2009) Log Message: ----------- [ 2139078 ] Document 0xAC as an alternate not char Modified Paths: -------------- docs/trunk/rexxref/intro.sgml Modified: docs/trunk/rexxref/intro.sgml =================================================================== --- docs/trunk/rexxref/intro.sgml 2009-01-02 18:20:06 UTC (rev 3849) +++ docs/trunk/rexxref/intro.sgml 2009-01-02 21:41:21 UTC (rev 3850) @@ -1031,10 +1031,11 @@ <computeroutput>Invalid character in program</computeroutput>, on an instruction including a vertical bar character, make sure this character is ASCII 124.</para></note> -<para>The Rexx -interpreter uses ASCII character 170 for the logical NOT operator. Depending -on your country, the ¬ might not appear on your keyboard. If the character -is not available, you can use the backslash (\) in place of ¬.</para> +<para>The Rexx interpreter recognizes both ASCII character 170 ('AA'X) and ASCII +character 172 ('AC'X) for the logical NOT operator. Depending on your country, +the ¬ might not appear on your keyboard. If the character is not available, +you can use the backslash (\) in place of ¬. +</para> </section> <section id="specchar"><title>Special Characters</title> This was sent by the SourceForge.net collaborative development platform, the world's largest Open Source development site. |
From: <bi...@us...> - 2009-02-07 00:19:44
|
Revision: 4088 http://oorexx.svn.sourceforge.net/oorexx/?rev=4088&view=rev Author: bigrixx Date: 2009-02-07 00:19:42 +0000 (Sat, 07 Feb 2009) Log Message: ----------- Some editorial updates Modified Paths: -------------- docs/trunk/rexxref/intro.sgml Modified: docs/trunk/rexxref/intro.sgml =================================================================== --- docs/trunk/rexxref/intro.sgml 2009-02-06 03:11:42 UTC (rev 4087) +++ docs/trunk/rexxref/intro.sgml 2009-02-07 00:19:42 UTC (rev 4088) @@ -125,7 +125,7 @@ And each data module includes its own operations for performing actions directly related to its data.</para> -<figure><title>Modular Data--a Report Object</title> +<figure><title>Modular Data—a Report Object</title> <mediaobject> <imageobject> <!-- Note! - if we include a /imagedata tag we get an error for DSSSL! --> @@ -136,8 +136,8 @@ <para>In the case of report, the report object would contain its own built-in PRINT, SEND, ERASE, and FILE operations.</para> -<para>Object-oriented programming lets you model real-world objects--even -very complex ones--precisely and elegantly. As a result, object manipulation +<para>Object-oriented programming lets you model real-world objects—even +very complex ones—precisely and elegantly. As a result, object manipulation becomes easier and computer instructions become simpler and can be modified later with minimal effort.</para> <para>Object-oriented programming <emphasis>hides</emphasis> any information @@ -150,8 +150,8 @@ <para>In object-oriented programming, objects are modeled to real-world objects. A real-world object has actions related to it and characteristics of its own. </para> -<para>Take a ball, for example. A ball can be acted on--rolled, tossed, -thrown, bounced, caught. But it also has its own physical characteristics--size, +<para>Take a ball, for example. A ball can be acted on—rolled, tossed, +thrown, bounced, caught. But it also has its own physical characteristics—size, shape, composition, weight, color, speed, position. An accurate data model of a real ball would define not only the physical characteristics but <emphasis>all</emphasis> related actions and characteristics in one package: @@ -167,14 +167,14 @@ </figure> <para>In object-oriented programming, -objects are the basic building blocks--the fundamental units of data.</para> +objects are the basic building blocks—the fundamental units of data.</para> <indexterm><primary>object</primary> <secondary>definition</secondary></indexterm> <indexterm><primary>object</primary> <secondary>kinds of</secondary></indexterm> <para>There are many kinds of objects; for example, character -strings, collections, and input and output streams. An object--such as -a character string--always consists of two parts: the possible actions +strings, collections, and input and output streams. An object—such as +a character string—always consists of two parts: the possible actions or operations related to it, and its characteristics or variables. A variable has a variable <emphasis>name</emphasis>, and an associated data value that can change over time. These actions and characteristics are so closely @@ -357,7 +357,7 @@ information icon <emphasis>acquire</emphasis> the methods and variables of that class. Instances behave as if they each had their own methods and variables of the same name. All instances, however, have their own unique -properties--the <emphasis>data</emphasis> associated with the variables. +properties—the <emphasis>data</emphasis> associated with the variables. Everything else can be stored at the class level.</para> <figure><title>Instances of the Icon Class</title> @@ -712,10 +712,9 @@ <secondary>literal strings</secondary></indexterm> <indexterm><primary>literal</primary> <secondary>implementation maximum</secondary></indexterm> -A literal string can contain an unlimited number of characters. The length -of the evaluated result of an expression, however, is limited only by the -available virtual storage of your computer, with an additional limit of 512MB -maximum per process.</para> +A literal string has no upper bound on the number of characters, limited on +by available memory. +</para> <para>Note that a string immediately followed by a right bracket is considered to be the name of a function. If immediately followed by the symbol <varname>X</varname> or <varname>x</varname>, it is considered to be a @@ -858,14 +857,12 @@ <listitem><para>English alphabetic characters (<computeroutput>A</computeroutput>-<computeroutput>Z</computeroutput> and <computeroutput>a</computeroutput>-<computeroutput>z</computeroutput>). -Note that some code pages do not include lowercase -English characters a-z.</para></listitem> +</para></listitem> <listitem><para>Numeric characters (<computeroutput>0</computeroutput>-<computeroutput>9</computeroutput>) </para></listitem> <listitem><para>Characters <computeroutput>. ! ?</computeroutput> and underscore (<computeroutput>_</computeroutput>). -Note that the encoding of the exclamation mark depends on the code page used. </para></listitem></itemizedlist> <indexterm><primary>uppercase translation</primary> <secondary>of symbols</secondary></indexterm> @@ -951,12 +948,15 @@ (without quotation marks) in an expression is not simply a number. It is a minus operator (which can be prefix minus if no term is to the left of it) followed by a positive number. The result -of the operation is a number.</para> +of the operation is a number, which might be rounded or reformatted into +exponential form depending on the size of the number and the current +NUMERIC DIGITS setting. +</para> <para>A <emphasis>whole number</emphasis> is a number that has a no decimal part and that the language processor would not usually express in exponential notation. That is, it has no more digits before the decimal point than the current setting of NUMERIC -DIGITS (the default is nine).</para> +DIGITS (the default is nine for 32-bit systems and 18 for 64-bit systems).</para> <para><emphasis role="bold">Implementation maximum:</emphasis> <indexterm><primary>numbers</primary> <secondary>implementation maximum</secondary></indexterm> @@ -965,7 +965,7 @@ <indexterm><primary>whole numbers</primary> <secondary>description</secondary></indexterm> The exponent of a number expressed in exponential notation can have -up to nine digits.</para> +up to nine digits on 32-bit systems and 18 digits on 64-bit systems.</para> </section> <section id="operatorchar"><title>Operator Characters</title> @@ -979,14 +979,12 @@ <indexterm><primary>tokens</primary> <secondary>operator characters</secondary></indexterm> <para>The characters -<computeroutput>+ - \ / % * | | & = ¬ > <</computeroutput> +<computeroutput>+ - \ / % * | & = ¬ > <</computeroutput> and the sequences <computeroutput>>= <= \> \< \= >< <> == \== // && || ** ¬> ¬< ¬= ¬== >> << >>= \<< ¬<< \>> ¬>> <<=</computeroutput> indicate operations (see <link linkend="opera">Operators</link>). -(The <computeroutput>||</computeroutput> can also be used as the -concatenation symbol.) A few of these are also used in parsing templates, and the equal sign <indexterm><primary>equal</primary> <secondary>sign</secondary> @@ -1002,21 +1000,12 @@ 345 >= 123 345 > = 123 </programlisting> -<para>Some of these characters (and some special characters--see the next +<para>Some of these characters (and some special characters—see the next section) might not be available in all character sets. In this case, appropriate translations can be used. <indexterm><primary>logical OR operator</primary></indexterm> In particular, the vertical bar (|) is often shown as a split vertical bar (¦).</para> -<para>Throughout the language, the NOT (¬) -<indexterm><primary>logical NOT character</primary></indexterm> -<indexterm><primary>NOT operator</primary></indexterm> -character is synonymous with the backslash -<indexterm><primary>backslash, use of</primary></indexterm> -(<computeroutput>\</computeroutput>). You can -use the two characters interchangeably according to availability and personal -preference.</para> - <note><title>Note</title> <para>The Rexx interpreter uses ASCII character 124 in the concatenation operator and as the logical OR operator. Depending @@ -1027,6 +1016,15 @@ <computeroutput>Invalid character in program</computeroutput>, on an instruction including a vertical bar character, make sure this character is ASCII 124.</para></note> +<para>Throughout the language, the NOT (¬) +<indexterm><primary>logical NOT character</primary></indexterm> +<indexterm><primary>NOT operator</primary></indexterm> +character is synonymous with the backslash +<indexterm><primary>backslash, use of</primary></indexterm> +(<computeroutput>\</computeroutput>). You can +use the two characters interchangeably according to availability and personal +preference.</para> + <para>The Rexx interpreter recognizes both ASCII character 170 ('AA'X) and ASCII character 172 ('AC'X) for the logical NOT operator. Depending on your country, the ¬ might not appear on your keyboard. If the character is not available, @@ -1120,8 +1118,8 @@ (Note that a comment is not a token.)</para></listitem> </itemizedlist></para> <para>Rexx automatically implies semicolons after colons (when following a single -symbol, a label) and after certain keywords when they are in the correct context. - The keywords that have this effect are ELSE, OTHERWISE, and THEN. These +symbol or literal string, a label) and after certain keywords when they are in the correct context. +The keywords that have this effect are ELSE, OTHERWISE, and THEN. These special cases reduce typographical errors significantly. </para> <note><title>Note</title> @@ -1130,9 +1128,8 @@ <computeroutput>*/</computeroutput>, must not be split by a line end (that is, <computeroutput>/</computeroutput> and <computeroutput>*</computeroutput> should not appear on different lines) because they could not then -be recognized correctly; an implied semicolon would be added. The two consecutive -characters forming a literal quotation mark within a string are also subject -to this line-end ruling.</para></note> +be recognized correctly; an implied semicolon would be added. +</para></note> </section> <section id="contin"><title>Continuations</title> @@ -1180,7 +1177,7 @@ <indexterm><primary>data</primary> <secondary>objects</secondary></indexterm> Rexx provides some objects, which are described in later sections. You can -also define and create objects that are useful in particular applications--for +also define and create objects that are useful in particular applications—for example, a menu object for user interaction. See <link linkend="objects">Modeling Objects</link> for more information.</para> @@ -1281,7 +1278,7 @@ is changed to a <computeroutput>\</computeroutput>. That is, the operators ¬= and \= both send the message \= to the target object.</para> <para>For an operator that works on a single term (for example, the -prefix - and prefix + operators), Rexx sends a message to the operand, +prefix - and prefix + operators), Rexx sends a message to the term, with no arguments. This means <computeroutput>-z</computeroutput> has the same effect as <computeroutput>z~"-"</computeroutput>.</para> <para>See <link linkend="mthObjectOperators">Operator Methods</link> for operator methods of @@ -1404,7 +1401,7 @@ <varlistentry><term>// <indexterm><primary>remainder operator</primary></indexterm> </term> -<listitem><para>Remainder (divide and return the remainder--not modulo, because +<listitem><para>Remainder (divide and return the remainder—not modulo, because the result can be negative) </para></listitem></varlistentry> <varlistentry><term>** @@ -1658,7 +1655,7 @@ </para> <variablelist> <varlistentry><term>&</term> -<listitem><para>AND -- returns <computeroutput>1</computeroutput> if both +<listitem><para>AND — returns <computeroutput>1</computeroutput> if both terms are true. <indexterm><primary>& (AND logical operator) operator</primary></indexterm> <indexterm><primary>AND, logical operator</primary></indexterm> @@ -1667,7 +1664,7 @@ <indexterm><primary>inclusive OR operator</primary></indexterm> <indexterm><primary>OR, logical</primary></indexterm> </term> -<listitem><para>Inclusive OR -- returns <computeroutput>1</computeroutput> +<listitem><para>Inclusive OR — returns <computeroutput>1</computeroutput> if either term or both terms are true. <indexterm><primary>| inclusive OR operator</primary></indexterm> </para></listitem></varlistentry> @@ -1675,7 +1672,7 @@ <indexterm><primary>exclusive OR operator</primary></indexterm> <indexterm><primary>XOR, logical</primary></indexterm> </term> -<listitem><para>Exclusive OR -- returns <computeroutput>1</computeroutput> +<listitem><para>Exclusive OR — returns <computeroutput>1</computeroutput> if either term, but not both terms, is true. <indexterm><primary>&& (exclusive OR operator)</primary></indexterm> </para></listitem></varlistentry> @@ -1684,7 +1681,7 @@ <indexterm><primary>negation</primary> <secondary>of logical values</secondary></indexterm> </term> -<listitem><para>Logical NOT-- negates; <computeroutput>1</computeroutput> +<listitem><para>Logical NOT— negates; <computeroutput>1</computeroutput> becomes <computeroutput>0</computeroutput>, and <computeroutput>0</computeroutput> becomes <computeroutput>1</computeroutput>. </para></listitem></varlistentry> @@ -1703,9 +1700,9 @@ evaluation is from left to right; parentheses and operator precedence modify this: <itemizedlist> -<listitem><para>When parentheses are encountered--other than those that +<listitem><para>When parentheses are encountered—other than those that identify the arguments on messages (see -<link linkend="mssg">Message Terms</link>) and function calls--the +<link linkend="mssg">Message Terms</link>) and function calls—the entire subexpression between the parentheses is evaluated immediately when the term is required.</para></listitem> <listitem><para>When the sequence </para> @@ -2440,7 +2437,7 @@ <link linkend="bifVar">VAR</link>) to test whether a symbol has been assigned a value. In addition, you can set SIGNAL ON NOVALUE to trap the use of any uninitialized variables (except when they are tails -in compound variables--see +in compound variables—see <link linkend="uninit">UNINIT</link>-or stems).</para></listitem> </orderedlist> </section> @@ -2711,8 +2708,8 @@ on Windows systems and "bash" on Linux systems. If called from an editor that accepts subcommands from the language processor, the default environment can be that editor.</para> -<para>A Rexx program can issue commands--called -<emphasis>subcommands</emphasis>--to other application programs. +<para>A Rexx program can issue commands—called +<emphasis>subcommands</emphasis>—to other application programs. For example, a Rexx program written for a text editor can inspect a file being edited, issue subcommands to make changes, test return codes to check that the subcommands have been processed @@ -2740,7 +2737,7 @@ expression; </programlisting> <para>The expression (which must not be an expression that forms a valid message -instruction--see <link linkend="msgi">Message Instructions</link>) +instruction—see <link linkend="msgi">Message Instructions</link>) is evaluated, resulting in a character string value (which can be the null string), which is then prepared as appropriate and submitted to the underlying system. Any part of the expression not to @@ -2785,7 +2782,7 @@ or <computeroutput>TRACE F</computeroutput> is set. <computeroutput>TRACE Normal</computeroutput> is the same as <computeroutput>TRACE F</computeroutput> and is the -default--see <link linkend="keyTrace">TRACE</link>.</para> +default—see <link linkend="keyTrace">TRACE</link>.</para> <para>The .RS environment symbol can also be used to detect command failures and errors. When the command environment indicates that a command failure has occurred, the Rexx environment symbol .RS has the value This was sent by the SourceForge.net collaborative development platform, the world's largest Open Source development site. |
From: <bi...@us...> - 2009-02-07 00:43:30
|
Revision: 4089 http://oorexx.svn.sourceforge.net/oorexx/?rev=4089&view=rev Author: bigrixx Date: 2009-02-07 00:43:26 +0000 (Sat, 07 Feb 2009) Log Message: ----------- An experiment in list spacing Modified Paths: -------------- docs/trunk/rexxref/intro.sgml Modified: docs/trunk/rexxref/intro.sgml =================================================================== --- docs/trunk/rexxref/intro.sgml 2009-02-07 00:19:42 UTC (rev 4088) +++ docs/trunk/rexxref/intro.sgml 2009-02-07 00:43:26 UTC (rev 4089) @@ -1733,62 +1733,33 @@ <computeroutput>-9</computeroutput>) because the prefix minus operator has a higher priority than the power operator.</para> <para>The order of precedence of the operators is (highest at the top):</para> -<variablelist> -<varlistentry><term>+ - ¬ \</term> -<listitem><para>(prefix operators) -</para></listitem></varlistentry> -<varlistentry><term>**</term> -<listitem><para>(power) -</para></listitem></varlistentry> -<varlistentry><term>* / % //</term> -<listitem><para>(multiply and divide) -</para></listitem></varlistentry> -<varlistentry><term>+ -</term> -<listitem><para>(add and subtract) -</para></listitem></varlistentry> -<varlistentry><term>(blank) || (abuttal)</term> -<listitem><para>(concatenation with or without blank) -</para></listitem></varlistentry> -<varlistentry><term>= > <</term> -<listitem><para>(comparison operators) -</para></listitem></varlistentry> -<varlistentry><term>== >> <<</term> -<listitem><para> -</para></listitem></varlistentry> -<varlistentry><term>\= ¬=</term> -<listitem><para> -</para></listitem></varlistentry> -<varlistentry><term>>< <></term> -<listitem><para> -</para></listitem></varlistentry> -<varlistentry><term>\> ¬></term> -<listitem><para> -</para></listitem></varlistentry> -<varlistentry><term>\< ¬<</term> -<listitem><para> -</para></listitem></varlistentry> -<varlistentry><term>\== ¬==</term> -<listitem><para> -</para></listitem></varlistentry> -<varlistentry><term>\>> ¬>></term> -<listitem><para> -</para></listitem></varlistentry> -<varlistentry><term>\<< ¬<<</term> -<listitem><para> -</para></listitem></varlistentry> -<varlistentry><term>>= >>=</term> -<listitem><para> -</para></listitem></varlistentry> -<varlistentry><term><= <<=</term> -<listitem><para> -</para></listitem></varlistentry> -<varlistentry><term>&</term> -<listitem><para>(and) -</para></listitem></varlistentry> -<varlistentry><term>| &&</term> -<listitem><para>(or, exclusive or) -</para></listitem></varlistentry> -</variablelist> +<informaltable frame="none" colsep="0" cowsep="0"> +<tgroup cols="2"> +<colspec colnum="1" colwidth="1*"> +<colspec colnum="2" colwidth="5*"> +<tbody> +<row><entry>Thread</entry><entry>Yes</entry></row> +<row><entry>+ - ¬ \</entry><entry>(prefix operators)</entry></row> +<row><entry>**</entry><entry>(power)</entry></row> +<row><entry>* / % //</entry><entry>(multiply and divide)</entry></row> +<row><entry>+ -</entry><entry>(add and subtract)</entry></row> +<row><entry>(blank) || (abuttal)</entry><entry>(concatenation with or without blank)</entry></row> +<row><entry>= > <</entry><entry>(comparison operators)</entry></row> +<row><entry>== >> <<</entry> </entry></row> +<row><entry>\= ¬=</entry> </entry></row> +<row><entry>>< <></entry> </entry></row> +<row><entry>\> ¬></entry> </entry></row> +<row><entry>\< ¬<</entry> </entry></row> +<row><entry>\== ¬==</entry> </entry></row> +<row><entry>\>> ¬>></entry> </entry></row> +<row><entry>\<< ¬<<</entry> </entry></row> +<row><entry>>= >>=</entry> </entry></row> +<row><entry><= <<=</entry> </entry></row> +<row><entry>&</entry>(and)</entry></row> +<row><entry>| &&</entry>(or, exclusive or)</entry></row> +</tbody> +</tgroup> +</informaltable> <para><emphasis role="bold">Examples:</emphasis></para> <para>Suppose the symbol <computeroutput>A</computeroutput> is a variable whose value is <computeroutput>3</computeroutput>, This was sent by the SourceForge.net collaborative development platform, the world's largest Open Source development site. |
From: <bi...@us...> - 2009-02-07 01:14:51
|
Revision: 4090 http://oorexx.svn.sourceforge.net/oorexx/?rev=4090&view=rev Author: bigrixx Date: 2009-02-07 01:14:47 +0000 (Sat, 07 Feb 2009) Log Message: ----------- fix syntax errors Modified Paths: -------------- docs/trunk/rexxref/intro.sgml Modified: docs/trunk/rexxref/intro.sgml =================================================================== --- docs/trunk/rexxref/intro.sgml 2009-02-07 00:43:26 UTC (rev 4089) +++ docs/trunk/rexxref/intro.sgml 2009-02-07 01:14:47 UTC (rev 4090) @@ -1733,30 +1733,29 @@ <computeroutput>-9</computeroutput>) because the prefix minus operator has a higher priority than the power operator.</para> <para>The order of precedence of the operators is (highest at the top):</para> -<informaltable frame="none" colsep="0" cowsep="0"> +<informaltable frame="none" colsep="0" rowsep="0"> <tgroup cols="2"> <colspec colnum="1" colwidth="1*"> -<colspec colnum="2" colwidth="5*"> +<colspec colnum="2" colwidth="4*"> <tbody> -<row><entry>Thread</entry><entry>Yes</entry></row> <row><entry>+ - ¬ \</entry><entry>(prefix operators)</entry></row> <row><entry>**</entry><entry>(power)</entry></row> <row><entry>* / % //</entry><entry>(multiply and divide)</entry></row> <row><entry>+ -</entry><entry>(add and subtract)</entry></row> <row><entry>(blank) || (abuttal)</entry><entry>(concatenation with or without blank)</entry></row> <row><entry>= > <</entry><entry>(comparison operators)</entry></row> -<row><entry>== >> <<</entry> </entry></row> -<row><entry>\= ¬=</entry> </entry></row> -<row><entry>>< <></entry> </entry></row> -<row><entry>\> ¬></entry> </entry></row> -<row><entry>\< ¬<</entry> </entry></row> -<row><entry>\== ¬==</entry> </entry></row> -<row><entry>\>> ¬>></entry> </entry></row> -<row><entry>\<< ¬<<</entry> </entry></row> -<row><entry>>= >>=</entry> </entry></row> -<row><entry><= <<=</entry> </entry></row> -<row><entry>&</entry>(and)</entry></row> -<row><entry>| &&</entry>(or, exclusive or)</entry></row> +<row><entry>== >> <<</entry><entry> </entry></row> +<row><entry>\= ¬=</entry><entry> </entry></row> +<row><entry>>< <></entry><entry> </entry></row> +<row><entry>\> ¬></entry><entry> </entry></row> +<row><entry>\< ¬<</entry><entry> </entry></row> +<row><entry>\== ¬==</entry><entry> </entry></row> +<row><entry>\>> ¬>></entry><entry> </entry></row> +<row><entry>\<< ¬<<</entry><entry> </entry></row> +<row><entry>>= >>=</entry><entry> </entry></row> +<row><entry><= <<=</entry><entry> </entry></row> +<row><entry>&</entry><entry>(and)</entry></row> +<row><entry>| &&</entry><entry>(or, exclusive or)</entry></row> </tbody> </tgroup> </informaltable> This was sent by the SourceForge.net collaborative development platform, the world's largest Open Source development site. |
From: <bi...@us...> - 2009-02-07 01:27:50
|
Revision: 4091 http://oorexx.svn.sourceforge.net/oorexx/?rev=4091&view=rev Author: bigrixx Date: 2009-02-07 01:27:41 +0000 (Sat, 07 Feb 2009) Log Message: ----------- adjust horizontal spacing a bit Modified Paths: -------------- docs/trunk/rexxref/intro.sgml Modified: docs/trunk/rexxref/intro.sgml =================================================================== --- docs/trunk/rexxref/intro.sgml 2009-02-07 01:14:47 UTC (rev 4090) +++ docs/trunk/rexxref/intro.sgml 2009-02-07 01:27:41 UTC (rev 4091) @@ -1736,26 +1736,26 @@ <informaltable frame="none" colsep="0" rowsep="0"> <tgroup cols="2"> <colspec colnum="1" colwidth="1*"> -<colspec colnum="2" colwidth="4*"> +<colspec colnum="2" colwidth="3*"> <tbody> -<row><entry>+ - ¬ \</entry><entry>(prefix operators)</entry></row> +<row><entry>+ - ¬ \</entry><entry>(prefix operators)</entry></row> <row><entry>**</entry><entry>(power)</entry></row> -<row><entry>* / % //</entry><entry>(multiply and divide)</entry></row> -<row><entry>+ -</entry><entry>(add and subtract)</entry></row> -<row><entry>(blank) || (abuttal)</entry><entry>(concatenation with or without blank)</entry></row> -<row><entry>= > <</entry><entry>(comparison operators)</entry></row> -<row><entry>== >> <<</entry><entry> </entry></row> -<row><entry>\= ¬=</entry><entry> </entry></row> -<row><entry>>< <></entry><entry> </entry></row> -<row><entry>\> ¬></entry><entry> </entry></row> -<row><entry>\< ¬<</entry><entry> </entry></row> -<row><entry>\== ¬==</entry><entry> </entry></row> -<row><entry>\>> ¬>></entry><entry> </entry></row> -<row><entry>\<< ¬<<</entry><entry> </entry></row> -<row><entry>>= >>=</entry><entry> </entry></row> -<row><entry><= <<=</entry><entry> </entry></row> +<row><entry>* / % //</entry><entry>(multiply and divide)</entry></row> +<row><entry>+ -</entry><entry>(add and subtract)</entry></row> +<row><entry>(blank) || (abuttal)</entry><entry>(concatenation with or without blank)</entry></row> +<row><entry>= > <</entry><entry>(comparison operators)</entry></row> +<row><entry>== >> <<</entry><entry> </entry></row> +<row><entry>\= ¬=</entry><entry> </entry></row> +<row><entry>>< <></entry><entry> </entry></row> +<row><entry>\> ¬></entry><entry> </entry></row> +<row><entry>\< ¬<</entry><entry> </entry></row> +<row><entry>\== ¬==</entry><entry> </entry></row> +<row><entry>\>> ¬>></entry><entry> </entry></row> +<row><entry>\<< ¬<<</entry><entry> </entry></row> +<row><entry>>= >>=</entry><entry> </entry></row> +<row><entry><= <<=</entry><entry> </entry></row> <row><entry>&</entry><entry>(and)</entry></row> -<row><entry>| &&</entry><entry>(or, exclusive or)</entry></row> +<row><entry>| &&</entry><entry>(or, exclusive or)</entry></row> </tbody> </tgroup> </informaltable> This was sent by the SourceForge.net collaborative development platform, the world's largest Open Source development site. |
From: <bi...@us...> - 2009-02-07 12:48:01
|
Revision: 4092 http://oorexx.svn.sourceforge.net/oorexx/?rev=4092&view=rev Author: bigrixx Date: 2009-02-07 12:47:53 +0000 (Sat, 07 Feb 2009) Log Message: ----------- more list reformatting Modified Paths: -------------- docs/trunk/rexxref/intro.sgml Modified: docs/trunk/rexxref/intro.sgml =================================================================== --- docs/trunk/rexxref/intro.sgml 2009-02-07 01:27:41 UTC (rev 4091) +++ docs/trunk/rexxref/intro.sgml 2009-02-07 12:47:53 UTC (rev 4092) @@ -1302,29 +1302,47 @@ appending the second string to the right-hand end of the first string. The concatenation may occur with or without an intervening blank. The concatenation operators are: </para> -<variablelist> -<varlistentry><term><emphasis role="bold">(blank)</emphasis></term> -<listitem><para>Concatenate terms with one blank in between +<informaltable frame="none" colsep="0" rowsep="0"> +<tgroup cols="2"> +<colspec colnum="1" colwidth="1*"> +<colspec colnum="2" colwidth="4*"> +<tbody> +<row> +<entry>(blank)</entry> +<entry> +<para>Concatenate terms with one blank in between <indexterm><primary>blanks</primary></indexterm> <indexterm><primary>concatenation</primary> <secondary>as concatenation operator</secondary></indexterm> <indexterm><primary>concatenation</primary> <secondary>blank</secondary></indexterm> -</para></listitem></varlistentry> -<varlistentry><term><emphasis role="bold">||</emphasis></term> -<listitem><para>Concatenate without an intervening blank +</para> +</entry> +</row> +<row> +<entry>||</entry> +<entry> +<para>Concatenate without an intervening blank <indexterm><primary>|| concatenation operator</primary></indexterm> <indexterm><primary>concatenation</primary> <secondary>operator</secondary> <tertiary>||</tertiary></indexterm> -</para></listitem></varlistentry> -<varlistentry><term><emphasis role="bold">(abuttal)</emphasis></term> -<listitem><para>Concatenate without an intervening blank +</para> +</entry> +</row> +<row> +<entry>(abuttal)</entry> +<entry> +<para>Concatenate without an intervening blank <indexterm><primary>concatenation</primary> <secondary>abuttal</secondary></indexterm> <indexterm><primary>abuttal</primary></indexterm> -</para></listitem></varlistentry> -</variablelist> +</para> +</entry> +</row> +</tbody> +</tgroup> +</informaltable> <para>You can force concatenation without a blank by using the <computeroutput>||</computeroutput> operator.</para> <para>The abuttal operator is assumed between two terms that are not separated @@ -1367,66 +1385,98 @@ <para>You can combine character strings that are valid numbers (see <link linkend="numbrs">Numbers</link>) using the following arithmetic operators: </para> -<variablelist> -<varlistentry><term>+ +<informaltable frame="none" colsep="0" rowsep="0"> +<tgroup cols="2"> +<colspec colnum="1" colwidth="1*"> +<colspec colnum="2" colwidth="4*"> +<tbody> +<row> +<entry>+</entry> +<entry> +<para>Add <indexterm><primary>+ (addition operator)</primary></indexterm> <indexterm><primary>addition operator</primary></indexterm> -</term> -<listitem><para>Add -</para></listitem></varlistentry> -<varlistentry><term>- +</para> +</entry> +</row> +<row> +<entry>-</entry> +<entry> +<para>Subtract <indexterm><primary>- (subtraction operator)</primary></indexterm> <indexterm><primary>subtraction operator</primary></indexterm> -</term> -<listitem><para>Subtract -</para></listitem></varlistentry> -<varlistentry><term>* +</para> +</entry> +</row> +<row> +<entry>*</entry> +<entry> +<para>Multiply <indexterm><primary>* (multiplication operator)</primary></indexterm> <indexterm><primary>multiplication operator</primary></indexterm> -</term> -<listitem><para>Multiply -</para></listitem></varlistentry> -<varlistentry><term>/ +</para> +</entry> +</row> +<row> +<entry>/</entry> +<entry> +<para>Divide <indexterm><primary>/ (division operator)</primary></indexterm> <indexterm><primary>division operator</primary></indexterm> -</term> -<listitem><para>Divide -</para></listitem></varlistentry> -<varlistentry><term>% +</para> +</entry> +</row> +<row> +<entry>%</entry> +<entry> +<para>Integer divide (divide and return the integer part of the +result) <indexterm><primary>% (integer division operator)</primary></indexterm> <indexterm><primary>integer division operator</primary></indexterm> -</term> -<listitem><para>Integer divide (divide and return the integer part of the -result) </para></listitem></varlistentry> -<varlistentry><term>// +</para> +</entry> +</row> +<row> +<entry>//</entry> +<entry> +<para>Remainder (divide and return the remainder—not modulo, because +the result can be negative) <indexterm><primary>remainder operator</primary></indexterm> -</term> -<listitem><para>Remainder (divide and return the remainder—not modulo, because -the result can be negative) -</para></listitem></varlistentry> -<varlistentry><term>** +</para> +</entry> +</row> +<row> +<entry>**</entry> +<entry> +<para>Power (raise a number to a whole-number power) <indexterm><primary>exponentiation</primary> <secondary>operator</secondary></indexterm> -</term> -<listitem><para>Power (raise a number to a whole-number power) <indexterm><primary>power operator</primary></indexterm> -</para></listitem></varlistentry> -<varlistentry><term> -<emphasis role="bold">Prefix -</emphasis> +</para> +</entry> +</row> +<row> +<entry>Prefix -</entry> +<entry> +<para>Same as the subtraction: +<computeroutput>0 - number</computeroutput> <indexterm><primary>prefix - operator</primary></indexterm> -<indexterm><primary>negation</primary> -<secondary>of logical values</secondary></indexterm> -</term> -<listitem><para>Same as the subtraction: -<computeroutput>0 - number</computeroutput> -</para></listitem></varlistentry> -<varlistentry><term><emphasis role="bold">Prefix +</emphasis> -<indexterm><primary>prefix + operator</primary></indexterm> -</term> +</para> +</entry> +</row> +<row> +<entry>Prefix +</entry> +<entry> <listitem><para>Same as the addition: <computeroutput>0 + number</computeroutput> +<indexterm><primary>prefix + operator</primary></indexterm> </para></listitem></varlistentry> -</variablelist><para> See <link linkend="numarit">Numbers and Arithmetic</link> +</entry> +</row> +</tbody> +</tgroup> +</informaltable> +<para>See <link linkend="numarit">Numbers and Arithmetic</link> for details about precision, the format of valid numbers, and the operation rules for arithmetic. Note that if an arithmetic result is shown in exponential notation, it is likely that rounding has occurred.</para> This was sent by the SourceForge.net collaborative development platform, the world's largest Open Source development site. |
From: <bi...@us...> - 2009-02-07 12:49:48
|
Revision: 4093 http://oorexx.svn.sourceforge.net/oorexx/?rev=4093&view=rev Author: bigrixx Date: 2009-02-07 12:49:36 +0000 (Sat, 07 Feb 2009) Log Message: ----------- fix syntax errors Modified Paths: -------------- docs/trunk/rexxref/intro.sgml Modified: docs/trunk/rexxref/intro.sgml =================================================================== --- docs/trunk/rexxref/intro.sgml 2009-02-07 12:47:53 UTC (rev 4092) +++ docs/trunk/rexxref/intro.sgml 2009-02-07 12:49:36 UTC (rev 4093) @@ -1467,10 +1467,10 @@ <row> <entry>Prefix +</entry> <entry> -<listitem><para>Same as the addition: +<para>Same as the addition: <computeroutput>0 + number</computeroutput> <indexterm><primary>prefix + operator</primary></indexterm> -</para></listitem></varlistentry> +</para> </entry> </row> </tbody> This was sent by the SourceForge.net collaborative development platform, the world's largest Open Source development site. |
From: <bi...@us...> - 2009-02-07 13:03:37
|
Revision: 4094 http://oorexx.svn.sourceforge.net/oorexx/?rev=4094&view=rev Author: bigrixx Date: 2009-02-07 13:03:32 +0000 (Sat, 07 Feb 2009) Log Message: ----------- more list reformatting Modified Paths: -------------- docs/trunk/rexxref/intro.sgml Modified: docs/trunk/rexxref/intro.sgml =================================================================== --- docs/trunk/rexxref/intro.sgml 2009-02-07 12:49:36 UTC (rev 4093) +++ docs/trunk/rexxref/intro.sgml 2009-02-07 13:03:32 UTC (rev 4094) @@ -1546,128 +1546,138 @@ and that of lowercase alphabetic characters is higher than that of uppercase alphabetic characters.</para> <para>The comparison operators and operations are: </para> -<variablelist> -<varlistentry><term>=</term> -<listitem><para>True if the terms are equal (numerically or when padded) +<informaltable frame="none" colsep="0" rowsep="0"> +<tgroup cols="2"> +<colspec colnum="1" colwidth="1*"> +<colspec colnum="2" colwidth="4*"> +<tbody> +<row> +<entry>=</entry> +<entry> +<para>True if the terms are equal (numerically or when padded) <indexterm><primary>= (equal sign)</primary> <secondary>equal operator</secondary></indexterm> <indexterm><primary>equal</primary> <secondary>operator</secondary></indexterm> -</para></listitem></varlistentry> -<varlistentry><term>\=, ¬=</term> -<listitem><para>True if the terms are not equal (inverse of =) +</para> +</entry> +</row> +<row><entry>\=, ¬=</entry> +<entry><para>True if the terms are not equal (inverse of =) <indexterm><primary>\= (not equal operator)</primary></indexterm> <indexterm><primary>¬= (not equal operator)</primary></indexterm> <indexterm><primary>not equal operator</primary></indexterm> -</para></listitem></varlistentry> -<varlistentry><term>> +</para></entry></row> +<row><entry>> <indexterm><primary>greater than operator (>)</primary></indexterm> -</term> -<listitem><para>Greater than +</entry> +<entry><para>Greater than <indexterm><primary>> (greater than operator)</primary></indexterm> <indexterm><primary>greater than operator</primary></indexterm> -</para></listitem></varlistentry> -<varlistentry><term>< +</para></entry></row> +<row><entry>< <indexterm><primary>less than operator (<)</primary></indexterm> -</term> -<listitem><para>Less than +</entry> +<entry><para>Less than <indexterm><primary>< (less than operator)</primary></indexterm> -</para></listitem></varlistentry> -<varlistentry><term>>< +</para></entry></row> +<row><entry>>< <indexterm><primary>greater than or less than operator (><)</primary> </indexterm> -</term> -<listitem><para>Greater than or less than (same as not equal) +</entry> +<entry><para>Greater than or less than (same as not equal) <indexterm><primary>>< (greater than or less than operator)</primary> </indexterm> <indexterm><primary>greater than or less than operator</primary></indexterm> -</para></listitem></varlistentry> -<varlistentry><term><> +</para></entry></row> +<row><entry><> <indexterm><primary>less than or greater than operator (<>)</primary> </indexterm> -</term> -<listitem><para>Greater than or less than (same as not equal) +</entry> +<entry><para>Greater than or less than (same as not equal) <indexterm><primary><> (less than or greater than operator)</primary> </indexterm> -</para></listitem></varlistentry> -<varlistentry><term>>= +</para></entry></row> +<row><entry>>= <indexterm><primary>greater than or equal to operator (>=)</primary> </indexterm> -</term> -<listitem><para>Greater than or equal to +</entry> +<entry><para>Greater than or equal to <indexterm><primary>>= (greater than or equal operator)</primary> </indexterm> <indexterm><primary>greater than or equal operator</primary></indexterm> -</para></listitem></varlistentry> -<varlistentry><term>\<, ¬<</term> -<listitem><para>Not less than +</para></entry></row> +<row><entry>\<, ¬<</entry> +<entry><para>Not less than <indexterm><primary>\< (not less than operator)</primary></indexterm> <indexterm><primary>¬< (not less than operator)</primary></indexterm> <indexterm><primary>not less than operator</primary></indexterm> -</para></listitem></varlistentry> -<varlistentry><term><= +</para></entry></row> +<row><entry><= <indexterm><primary>less than or equal to operator (>=)</primary></indexterm> -</term> -<listitem><para>Less than or equal to +</entry> +<entry><para>Less than or equal to <indexterm><primary><= (less than or equal operator(<=)</primary> </indexterm> -</para></listitem></varlistentry> -<varlistentry><term>\>, ¬></term> -<listitem><para>Not greater than +</para></entry></row> +<row><entry>\>, ¬></entry> +<entry><para>Not greater than <indexterm><primary>\> (not greater than operator)</primary></indexterm> <indexterm><primary>¬> (not greater than operator)</primary></indexterm> <indexterm><primary>not greater than operator</primary></indexterm> -</para></listitem></varlistentry> -<varlistentry><term>==</term> -<listitem><para>True if terms are strictly equal (identical) +</para></entry></row> +<row><entry>==</entry> +<entry><para>True if terms are strictly equal (identical) <indexterm><primary>== (strictly equal operator)</primary></indexterm> <indexterm><primary>strictly equal operator</primary></indexterm> -</para></listitem></varlistentry> -<varlistentry><term>\==, ¬==</term> -<listitem><para>True if the terms are not strictly equal (inverse of ==) +</para></entry></row> +<row><entry>\==, ¬==</entry> +<entry><para>True if the terms are not strictly equal (inverse of ==) <indexterm><primary>\== (not strictly equal operator)</primary></indexterm> <indexterm><primary>¬== (not strictly equal operator)</primary></indexterm> <indexterm><primary>strictly not equal operator</primary></indexterm> -</para></listitem></varlistentry> -<varlistentry><term>>></term> -<listitem><para>Strictly greater than +</para></entry></row> +<row><entry>>></entry> +<entry><para>Strictly greater than <indexterm><primary>>> (strictly greater than operator)</primary> </indexterm> <indexterm><primary>strictly greater than operator</primary></indexterm> -</para></listitem></varlistentry> -<varlistentry><term><<</term> -<listitem><para>Strictly less than +</para></entry></row> +<row><entry><<</entry> +<entry><para>Strictly less than <indexterm><primary><< (strictly less than operator)</primary></indexterm> <indexterm><primary>strictly less than operator</primary></indexterm> -</para></listitem></varlistentry> -<varlistentry><term>>>=</term> -<listitem><para>Strictly greater than or equal to +</para></entry></row> +<row><entry>>>=</entry> +<entry><para>Strictly greater than or equal to <indexterm><primary>>>= (strictly greater than or equal operator)</primary> </indexterm> <indexterm><primary>strictly greater than or equal operator</primary></indexterm> -</para></listitem></varlistentry> -<varlistentry><term>\<<, ¬<<</term> -<listitem><para>Strictly not less than +</para></entry></row> +<row><entry>\<<, ¬<<</entry> +<entry><para>Strictly not less than <indexterm><primary>\<< (strictly not less than operator)</primary> </indexterm> <indexterm><primary>¬<< (strictly not less than operator)</primary> </indexterm> <indexterm><primary>strictly not less than operator</primary></indexterm> -</para></listitem></varlistentry> -<varlistentry><term><<=</term> -<listitem><para>Strictly less than or equal to +</para></entry></row> +<row><entry><<=</entry> +<entry><para>Strictly less than or equal to <indexterm><primary><<= (strictly less than or equal operator)</primary> </indexterm> -</para></listitem></varlistentry> -<varlistentry><term>\>>, ¬>></term> -<listitem><para>Strictly not greater than +</para></entry></row> +<row><entry>\>>, ¬>></entry> +<entry><para>Strictly not greater than <indexterm><primary>\>> (strictly not greater than operator)</primary> </indexterm> <indexterm><primary>¬>> (strictly not greater than operator)</primary> </indexterm> <indexterm><primary>strictly not greater than operator</primary></indexterm> -</para></listitem></varlistentry> -</variablelist> +</para></entry></row> +</tbody> +</tgroup> +</informaltable> <note><title>Note</title> <para>Throughout the language, the NOT (¬) This was sent by the SourceForge.net collaborative development platform, the world's largest Open Source development site. |
From: <bi...@us...> - 2009-02-07 13:29:37
|
Revision: 4095 http://oorexx.svn.sourceforge.net/oorexx/?rev=4095&view=rev Author: bigrixx Date: 2009-02-07 13:29:35 +0000 (Sat, 07 Feb 2009) Log Message: ----------- more list reformatting Modified Paths: -------------- docs/trunk/rexxref/intro.sgml Modified: docs/trunk/rexxref/intro.sgml =================================================================== --- docs/trunk/rexxref/intro.sgml 2009-02-07 13:03:32 UTC (rev 4094) +++ docs/trunk/rexxref/intro.sgml 2009-02-07 13:29:35 UTC (rev 4095) @@ -1713,39 +1713,45 @@ <computeroutput>0</computeroutput> or <computeroutput>1</computeroutput> are not permitted. </para> -<variablelist> -<varlistentry><term>&</term> -<listitem><para>AND — returns <computeroutput>1</computeroutput> if both +<informaltable frame="none" colsep="0" rowsep="0"> +<tgroup cols="2"> +<colspec colnum="1" colwidth="1*"> +<colspec colnum="2" colwidth="4*"> +<tbody> +<row><entry>&</entry> +<entry><para>AND — returns <computeroutput>1</computeroutput> if both terms are true. <indexterm><primary>& (AND logical operator) operator</primary></indexterm> <indexterm><primary>AND, logical operator</primary></indexterm> -</para></listitem></varlistentry> -<varlistentry><term>| +</para></entry></row> +<row><entry>| <indexterm><primary>inclusive OR operator</primary></indexterm> <indexterm><primary>OR, logical</primary></indexterm> -</term> -<listitem><para>Inclusive OR — returns <computeroutput>1</computeroutput> +</entry> +<entry><para>Inclusive OR — returns <computeroutput>1</computeroutput> if either term or both terms are true. <indexterm><primary>| inclusive OR operator</primary></indexterm> -</para></listitem></varlistentry> -<varlistentry><term>&& +</para></entry></row> +<row><entry>&& <indexterm><primary>exclusive OR operator</primary></indexterm> <indexterm><primary>XOR, logical</primary></indexterm> -</term> -<listitem><para>Exclusive OR — returns <computeroutput>1</computeroutput> +</entry> +<entry><para>Exclusive OR — returns <computeroutput>1</computeroutput> if either term, but not both terms, is true. <indexterm><primary>&& (exclusive OR operator)</primary></indexterm> -</para></listitem></varlistentry> -<varlistentry><term><emphasis role="bold">Prefix</emphasis> \, ¬ +</para></entry></row> +<row><entry><emphasis role="bold">Prefix</emphasis> \, ¬ <indexterm><primary>NOT operator</primary></indexterm> <indexterm><primary>negation</primary> <secondary>of logical values</secondary></indexterm> -</term> -<listitem><para>Logical NOT— negates; <computeroutput>1</computeroutput> +</entry> +<entry><para>Logical NOT— negates; <computeroutput>1</computeroutput> becomes <computeroutput>0</computeroutput>, and <computeroutput>0</computeroutput> becomes <computeroutput>1</computeroutput>. -</para></listitem></varlistentry> -</variablelist> +</para></entry></row> +</tbody> +</tgroup> +</informaltable> </section> </section> This was sent by the SourceForge.net collaborative development platform, the world's largest Open Source development site. |
From: <bi...@us...> - 2009-02-07 15:38:16
|
Revision: 4096 http://oorexx.svn.sourceforge.net/oorexx/?rev=4096&view=rev Author: bigrixx Date: 2009-02-07 15:38:12 +0000 (Sat, 07 Feb 2009) Log Message: ----------- Some editorial updates Modified Paths: -------------- docs/trunk/rexxref/intro.sgml Modified: docs/trunk/rexxref/intro.sgml =================================================================== --- docs/trunk/rexxref/intro.sgml 2009-02-07 13:29:35 UTC (rev 4095) +++ docs/trunk/rexxref/intro.sgml 2009-02-07 15:38:12 UTC (rev 4096) @@ -1925,13 +1925,13 @@ parenthesis.</para> <para>You can use any number of <emphasis role="italic">expressions</emphasis>, separated by commas. The <emphasis role="italic">expressions</emphasis> -are evaluated from left to right and form the argument during -the execution of the routine. Any ARG, PARSE ARG, or USE ARG instruction or -ARG built-in function in the called routine accesses these objects while the -called routine is running. You can omit +are evaluated from left to right and form the arguments during +the execution of the called method. Any ARG, PARSE ARG, or USE ARG instruction or +ARG() built-in function in the called method accesses these objects while the +called method is running. You can omit <emphasis role="italic">expressions</emphasis>, if appropriate, by including extra commas.</para> -<para>The <emphasis role="italic">receiver</emphasis> is evaluated, followed +<para>The <emphasis role="italic">receiver</emphasis> object is evaluated, followed by one or more <emphasis role="italic">expression</emphasis> arguments. The message name (in uppercase) and the resulting argument objects are then sent to the receiver object. The receiver object selects @@ -1939,7 +1939,7 @@ (see <link linkend="meths1">Classes and Inheritance</link>), and runs the selected method with the specified argument objects. The receiver eventually returns, allowing processing to continue.</para> -<para>If the message term uses ~, the receiver must return a result object. +<para>If the message term uses ~, the receiver method must return a result object. This object is included in the original expression as if the entire message term had been replaced by the name of a variable whose value is the returned object.</para> @@ -1950,7 +1950,7 @@ a="Position of 'e' is:" c~pos("e",3) /* would set A to "Position of 'e' is: 6" */ </programlisting> -<para>If the message term uses ~~, the receiver needs not return +<para>If the message term uses ~~, the receiver method need not return a result object. Any result object is discarded, and the receiver object is included in the original expression in place of the message term.</para> <para>For example, the messages INHERIT and SUBCLASS are valid for classes @@ -2022,8 +2022,9 @@ say "First on the team is:" team~firstitem /* Bob */ say "Last on the team is:" team~lastitem /* Steve */ </programlisting> -<para>Thus, you would use ~ when you want the returned result to incorporate -the methods included in each stage of the message.</para> +<para>Thus, you would use ~ when you want the returned result to be the +receiver of the next message in the sequence. +</para> </section> </section> @@ -2062,7 +2063,7 @@ Directives are nonexecutable code and can start in any column. They divide a program into separate executable units (methods and routines) and supply information about the program or its executable units. Directives perform -various functions, such as associating methods with a particular class (::CLASS +various functions, such as creating new Rexx classes (::CLASS directive) or defining a method (::METHOD directive). See <link linkend="dire">Directives</link> for more information about directives.</para> @@ -2092,11 +2093,15 @@ and internal function calls. Label searches for CALL, SIGNAL, and internal function calls are case-sensitive. Label-search targets specified as symbols cannot match labels with lowercase characters. Literal-string or computed-label -searches can locate labels with lowercase characters. More than one label -can precede an instruction. Labels are treated as null clauses and can be -traced selectively to aid debugging.</para> +searches can locate labels with lowercase characters. +</para> <para>Labels can be any number of successive clauses. Several labels can precede -other clauses. Duplicate labels are permitted, but control is only passed +other clauses. +Labels are treated as null clauses and can be +traced selectively to aid debugging. +</para> +<para> +Duplicate labels are permitted, but control is only passed to the first of any duplicates in a program. The duplicate labels occurring later can be traced but cannot be used as a target of a CALL, SIGNAL, or function invocation.</para> @@ -2211,9 +2216,7 @@ <para>You can assign a new value to a variable with the ARG, PARSE, PULL, or USE instructions, the VALUE built-in function, or the -<indexterm><primary>variable</primary> -<secondary>pool interface</secondary></indexterm> -variable pool interface, but the most +but the most common way of changing the value of a variable is the assignment instruction itself. Any clause in the form</para> <para><emphasis role="italic">symbol</emphasis>=<emphasis role="italic"> @@ -2283,8 +2286,10 @@ <indexterm><primary>variable</primary> <secondary>setting a new value</secondary></indexterm> <para>The character sequences <computeroutput>+=, -=, *= /=, %=, //=, ||=, &=, |=, and &&=</computeroutput> -can be used to create extended assignment instructions. An extended assignment combines an binary operation with -an assignment where the term on the left side of the assignment is also used as the left term of the operator. For +can be used to create extended assignment instructions. +An extended assignment combines a non-prefix operator with +an assignment where the term on the left side of the assignment +is also used as the left term of the operator. For example,</para> <programlisting> a += 1 @@ -2314,7 +2319,11 @@ 17E-3 </programlisting> <para>Symbols where the first character is a period and the second character -is alphabetic are environment symbols.</para> +is alphabetic are environment symbols. +<link linkend="ensym">Environment symbols</link>). +may have a +value other other than the symbol name. +</para> </section> <section id="simpsym"><title>Simple Symbols</title> @@ -2342,29 +2351,52 @@ <indexterm><primary>array</primary> <secondary>initialization</secondary></indexterm> <para>A <emphasis role="italic">stem</emphasis> is -a symbol that contains a period as the last character. It cannot start with -a digit or a period.</para> +a symbol that contains a single period as the last character of the name. It cannot start with +a digit.</para> <para>These are stems: </para> <programlisting> FRED. A. -</programlisting><para>By default, the value of a stem is a Stem object. (See +</programlisting><para>The value of a stem is always a Stem object. (See <link linkend="clsStem">The Stem Class</link>.) The stem variable's Stem object is automatically created the first time -you use the stem variable or a compound variable -(see <link linkend="compsym">Compound Symbols</link>) -containing the stem variable name. The Stem object's assigned name is +you use the stem variable or a +<link linkend="compsym">compound variable</link>) +containing the stem variable name. +The Stem object's assigned name is the name of the stem variable (with the characters translated to uppercase). If the stem variable has been assigned a value, or the Stem object has been -given a default value, a reference to the stem variable returns the assigned -default value.</para> +given a default value, the assigned name override the default stem name. +A reference to a stem variable will return the associate Stem object. +</para> <indexterm><primary>compound</primary> <secondary>variable</secondary> <tertiary>setting new value</tertiary></indexterm> <indexterm><primary>stem of a variable</primary> <secondary>assignment to</secondary></indexterm> -<para>Further, when a stem is the target of an assignment, a new Stem object -is created and assigned to the stem variable. The new value assigned to the +<para>When a stem is the target of an assignment, the action taken +depends on the value being assigned. If the new value is a Stem object, +the new Stem object will replace the the Stem object that is currently associated +with the stem variable. This can result in multiple stem variables referring to +a the same Stem object, effectively creating a variable alias.</para> +<para><emphasis role="bold">Example:</emphasis></para> +<programlisting> +hole. = "empty" +hole.19 = "full" +say hole.1 hole.mouse hole.19 +/* Says "empty empty full" */ + +hole2. = hole. /* copies reference to hole. stem to hole2. */ + +say hole2.1 hole2.mouse hole2.19 + +/* Also says "empty empty full" */ +</programlisting> +<para>If the new value is not a Stem object, +a new Stem object is created and assigned to the stem variable, replacing the +Stem object currently associated with the stem variable.</para> +<para> +The new value assigned to the stem variable is given to the new Stem object as a default value. Following the assignment, a reference to any compound symbol with that stem variable returns the new value until another value is assigned to the stem, the Stem @@ -2380,23 +2412,7 @@ <secondary>of arrays</secondary></indexterm> <indexterm><primary>initialization</primary> <secondary>of compound variables</secondary></indexterm> -<para>Thus, you can give a whole collection of variables the same value.</para> -<para>If the object assigned to a stem variable is already a Stem object, then -a new Stem object is not created. The assignment updates the stem variable -to refer to the existing Stem object.</para> -<para><emphasis role="bold">Example:</emphasis></para> -<programlisting> -hole. = "empty" -hole.19 = "full" -say hole.1 hole.mouse hole.19 -/* Says "empty empty full" */ - -hole2. = hole. /* copies reference to hole. stem to hole2. */ - -say hole2.1 hole2.mouse hole2.19 - -/* Also says "empty empty full" */ -</programlisting> +<para>Thus, you can initialize an entire collection of compound variables to the same value.</para> <para>You can pass stem collections as function, subroutine, or method arguments.</para> <para><emphasis role="bold">Example:</emphasis></para> @@ -2408,11 +2424,16 @@ end return </programlisting> - +<para>The USE ARG instruction functions as an assignment instruction. The variable +STEM. in the example above is functionally equivalent to:</para> +<programlisting> +stem. = arg(2) +</programlisting> <note><title>Note</title> <para>USE ARG must be used to access the stem variable as a collection. -PARSE and PARSE ARG force the stem to be a string value.</para></note> +PARSE and PARSE ARG will force the stem to be a string value.</para></note> <para>Stems can also be returned as function, subroutine, or method results. +The resulting return value is the Stem object associated with the stem variable. </para> <para><emphasis role="bold">Example:</emphasis></para> <programlisting> @@ -2423,18 +2444,24 @@ end return stem. </programlisting> - -<note><title>Note</title> -<para>The value that has been assigned to the -whole collection of variables can always be obtained by using the stem. However, +<para>When a stem. variable is used in an expression context, the stem variable +reference returns the associated Stem object. The Stem object will forward +many object messages to it's default value. For example, the STRING method +will return the Stem object's default value's string representation:</para> +<programlisting> +total. = 0 +say total. /* says "0" */ +</programlisting> +<para>The [] method with no arguments will return the currently associated +default value. + variables can always be obtained by using the stem. However, this is not the same as using a compound variable whose derived name is the -null string.</para></note> -<para><emphasis role="bold">Example:</emphasis></para> +null string.</para> <programlisting> total. = 0 null = "" total.null = total.null + 5 -say total. total.null /* says "0 5" */ +say total.[] total.null /* says "0 5" */ </programlisting> <para>You can use the DROP, EXPOSE, and PROCEDURE instructions to manipulate collections of variables, referred to by their stems. @@ -2453,14 +2480,14 @@ <orderedlist> <listitem><para>When the ARG, PARSE, PULL, or USE instruction, the VALUE built-in function, or the variable pool interface changes a variable, the -effect is identical with an assignment. Wherever a value can be assigned, -using a stem sets an entire collection of variables.</para></listitem> +effect is identical with an assignment. +</para></listitem> <listitem><para>Any clause that starts with a symbol and whose second token is (or starts with) an equal sign (<computeroutput>=</computeroutput>) is an assignment, rather than an expression (or a keyword instruction). This is not a restriction, because you can ensure that the clause is processed as a command, such as by putting a null string -before the first name, or by enclosing the first part of the expression in +before the first name, or by enclosing the expression in parentheses. </para> <para>If you unintentionally use a Rexx keyword as the variable name in an assignment, this should not cause confusion. For example, the @@ -2471,10 +2498,12 @@ </listitem> <listitem><para>You can use the VAR function (see <link linkend="bifVar">VAR</link>) to test whether -a symbol has been assigned a value. In addition, you can set SIGNAL ON NOVALUE +a symbol has been assigned a value. In addition, you can set +<link linkend="uninit">SIGNAL ON NOVALUE</link> to trap the use of any uninitialized variables (except when they are tails -in compound variables—see -<link linkend="uninit">UNINIT</link>-or stems).</para></listitem> +in compound variables or stem variables, which are always initialized with a Stem object +when first used. +</para></listitem> </orderedlist> </section> This was sent by the SourceForge.net collaborative development platform, the world's largest Open Source development site. |
From: <bi...@us...> - 2009-02-07 21:19:11
|
Revision: 4097 http://oorexx.svn.sourceforge.net/oorexx/?rev=4097&view=rev Author: bigrixx Date: 2009-02-07 21:19:05 +0000 (Sat, 07 Feb 2009) Log Message: ----------- Some editorial updates Modified Paths: -------------- docs/trunk/rexxref/intro.sgml Modified: docs/trunk/rexxref/intro.sgml =================================================================== --- docs/trunk/rexxref/intro.sgml 2009-02-07 15:38:12 UTC (rev 4096) +++ docs/trunk/rexxref/intro.sgml 2009-02-07 21:19:05 UTC (rev 4097) @@ -2556,10 +2556,12 @@ symbols in the tail (<computeroutput>I</computeroutput>, <computeroutput>J</computeroutput>, and <computeroutput>One</computeroutput> in the -examples), thus generating a new, derived name. The value of a compound symbol -is, by default, its derived name (used exactly as is) or, if it has been used -as the target of an assignment, the value of the variable named by the derived -name.</para> +examples), thus generating a new, derived tail. The value of a compound symbol +is, by default, its the name of the Stem object associated with the stem variable +concatenated to the +derived tail or, if it has been used +as the target of an assignment, the value of Stem element named by the derived +tail.</para> <para>The substitution in the symbol permits arbitrary indexing (subscripting) of collections of variables that have a common stem. Note that the values substituted can contain <emphasis>any</emphasis> characters (including @@ -2581,7 +2583,7 @@ Any of the symbols <computeroutput>s1</computeroutput> to <computeroutput>sn</computeroutput> can be null. The values <computeroutput>v1</computeroutput> to <computeroutput>vn</computeroutput> -can also be null and can contain <emphasis>any</emphasis> characters. +can also be null and can contain <emphasis>any</emphasis> characters (including periods). Lowercase characters are not translated to uppercase, blanks are not removed, and periods have no special significance. There is no limit on the length of the evaluated name.</para> @@ -2610,7 +2612,7 @@ <para>The value of a stem variable is always a Stem object (see <link linkend="clsStem">The Stem Class</link> for details). A Stem object is a type of collection that supports the [] -and []= methods used by other collection classes. The [] +and []= methods used by other collection classes. The [] method provides an alternate means of accessing compound variables that also allows embedded subexpressions.</para> <para><emphasis role="bold">Examples:</emphasis></para> @@ -2639,12 +2641,14 @@ This character must not be a digit. By default the value of an environment symbol is the string consisting of the characters of the symbol (translated to uppercase). If the symbol identifies an object in the current environment, -its value is that object.</para> +its value is the mapped object.</para> <para>These are environment symbols: </para> <programlisting> -.method /* Same as .METHOD */ +.method // A reference to the Rexx Method class -.true +.true // The Rexx "true" object. Has the value "1" + +.xyz // Normally the value .XYZ </programlisting> <para>When you use an environment symbol, the language processor performs a series of searches to see if the environment symbol has an assigned value. The @@ -2652,10 +2656,14 @@ <orderedlist> <listitem><para>The directory of classes declared on ::CLASS directives (see <link linkend="clasdi">::CLASS</link>) -within the current program file.</para></listitem> +within the current program package or added to the current package using +the <link linkend="mthPackageAddClass">addClass() method</link>.</para></listitem> <listitem><para>The directory of PUBLIC classes declared on ::CLASS directives -of other files included with a ::REQUIRES directive.</para></listitem> -<listitem><para>The local environment directory. The local +of other files included with a ::REQUIRES directive or added to the current +Package instance using the <link linkend="mthPackageAddClass">addPackage() method</link>. +</para></listitem> +<listitem><para>The local environment directory specific to the current +interpreter instance. The local environment includes process-specific objects such as the .INPUT and .OUTPUT objects. You can directly access the local environment directory by using the .LOCAL environment symbol. (See @@ -2666,17 +2674,19 @@ permanent Rexx objects such as the Rexx supplied classes (.ARRAY and so on) and constants such as .TRUE and .FALSE. You can directly access the global environment by using the .ENVIRONMENT environment symbol (see -<link linkend="envo">The Environment Object</link>) -or the VALUE built-in function (see <link linkend="bifValue">VALUE</link>) -with a null string for the +<link linkend="envo">The Environment Object</link>). +Entries in the global environment directory can also be accessed via the VALUE +built-in function (see <link linkend="bifValue">VALUE</link>) +by using a null string for the <emphasis role="italic">selector</emphasis> argument.</para></listitem> <listitem><para>Rexx defined symbols. Other simple environment symbols are -reserved for use by Rexx built-in objects. The currently defined built-in -objects are .RS, .LINE, and .METHODS.</para></listitem> +reserved for use by <link linkend="builtinenvobj">Rexx built-in environment objects</link>. +The currently defined built-in +objects are .RS, .LINE, .METHODS, .ROUTINES, and .CONTEXT.</para></listitem> </orderedlist> </para> <para>If an entry is not found for an environment symbol, then the default -character string value is used. </para> +character string value is used.</para> <note><title>Note</title> <para>You can place entries in both the .LOCAL @@ -2805,8 +2815,8 @@ instruction—see <link linkend="msgi">Message Instructions</link>) is evaluated, resulting in a character string value (which can be the null string), which is then prepared as appropriate -and submitted to the underlying system. Any part of the expression not to -be evaluated must be enclosed in quotation marks.</para> +and submitted to the environment specified by the current ADDRESS setting. +</para> <para>The environment then processes the command and returns control to the language processor after setting a return code. A <emphasis>return code</emphasis> is a string, typically a number, @@ -2865,8 +2875,7 @@ </programlisting> <para>would result in passing the string <computeroutput>TYPE CHESHIRE.CAT</computeroutput> to -the command processor. On Windows 95, this is COMMAND.COM. On -<trademark class="registered">Windows NT</trademark>, this is CMD.EXE. +the command processor, CMD.EXE. The simpler expression:</para> <programlisting> "TYPE CHESHIRE.CAT" @@ -2878,8 +2887,8 @@ <note><title>Note</title> <para>Remember that the expression is evaluated before -it is passed to the environment. Enclose in quotation marks any part of the -expression that is not to be evaluated.</para></note> +it is passed to the environment. Constant portions of the command should be +specified as literal strings.</para></note> <para><emphasis role="bold">Windows Example:</emphasis></para> <programlisting> delete "*".lst /* not "multiplied by" */ @@ -2899,14 +2908,20 @@ ls "/w" /* not "divided by ANY" */ </programlisting> -<para>Enclosing an entire message instruction in parentheses causes +<para> +Enclosing an entire message instruction in parentheses causes the message result to be used as a command. Any clause that is a message instruction is not treated as a command. Thus, for example, the clause </para> <programlisting> myfile~linein </programlisting> <para>causes the returned line to be assigned to the variable RESULT, not to -be used as a command to an external environment.</para> +be used as a command to an external environment, while</para> +<programlisting> +(myfile~linein) +</programlisting> +<para>would submit the return value from the linein method as a command to the external +environment.</para> </section> </section> This was sent by the SourceForge.net collaborative development platform, the world's largest Open Source development site. |
From: <bi...@us...> - 2009-02-07 21:21:38
|
Revision: 4098 http://oorexx.svn.sourceforge.net/oorexx/?rev=4098&view=rev Author: bigrixx Date: 2009-02-07 21:21:35 +0000 (Sat, 07 Feb 2009) Log Message: ----------- Fix syntax error Modified Paths: -------------- docs/trunk/rexxref/intro.sgml Modified: docs/trunk/rexxref/intro.sgml =================================================================== --- docs/trunk/rexxref/intro.sgml 2009-02-07 21:19:05 UTC (rev 4097) +++ docs/trunk/rexxref/intro.sgml 2009-02-07 21:21:35 UTC (rev 4098) @@ -2680,7 +2680,7 @@ by using a null string for the <emphasis role="italic">selector</emphasis> argument.</para></listitem> <listitem><para>Rexx defined symbols. Other simple environment symbols are -reserved for use by <link linkend="builtinenvobj">Rexx built-in environment objects</link>. +reserved for use by <link linkend="oneof">Rexx built-in environment objects</link>. The currently defined built-in objects are .RS, .LINE, .METHODS, .ROUTINES, and .CONTEXT.</para></listitem> </orderedlist> This was sent by the SourceForge.net collaborative development platform, the world's largest Open Source development site. |
From: <bi...@us...> - 2009-02-24 23:04:03
|
Revision: 4220 http://oorexx.svn.sourceforge.net/oorexx/?rev=4220&view=rev Author: bigrixx Date: 2009-02-24 22:36:36 +0000 (Tue, 24 Feb 2009) Log Message: ----------- editorial updates Modified Paths: -------------- docs/trunk/rexxref/intro.sgml Modified: docs/trunk/rexxref/intro.sgml =================================================================== --- docs/trunk/rexxref/intro.sgml 2009-02-24 01:37:33 UTC (rev 4219) +++ docs/trunk/rexxref/intro.sgml 2009-02-24 22:36:36 UTC (rev 4220) @@ -109,8 +109,8 @@ are often isolated from the data by placing them in subroutines or modules. A module typically contains an operation for implementing one simple action. You might have a PRINT module, a SEND module, an ERASE module. The data these -modules operate on must be constructed by the programmer and passed in to the -modules. +modules operate on must be constructed by the programmer and passed to the +modules to perform an action. </para> <mediaobject> @@ -180,7 +180,7 @@ has a <emphasis>name</emphasis>, and an associated data value that can change over time. The variables represent the internal state of the object, and can be directly -accessed only by the code that implementes the object's actions. +accessed only by the code that implements the object's actions. </para> <figure><title>Ball Object with Variable Names and Values</title> @@ -221,7 +221,7 @@ <section id="interac"><title>How Objects Interact</title> <indexterm><primary>messages</primary></indexterm> -<para>The actions within an object +<para>The actions defined by an object are its only interface to other objects. Actions form a kind of "wall" that encapsulates the object, and shields its internal information from outside objects. This shielding is called @@ -245,7 +245,7 @@ <indexterm><primary>message-send operator (~)</primary></indexterm> </para></listitem> <listitem><para>The action and, optionally in parentheses, any parameters -required</para></listitem> +required by the action</para></listitem> </itemizedlist></para> <para>So the message format looks like this: </para> <programlisting> @@ -264,11 +264,11 @@ <indexterm><primary>method</primary> <secondary>definition</secondary></indexterm> <para>Sending a message to -an object results in performing some action; that is, it results in running +an object results in performing some action; that is, it executes some underlying code. The action-generating code is called a <emphasis>method</emphasis>. When you send a message to an object, -you specify its method -name in the message. Method names are character strings like REVERSE. In the +the message is the name of the target method. +Method names are character strings like REVERSE. In the preceding example, sending the <computeroutput>reverse</computeroutput> message to the <computeroutput>!iH</computeroutput> object causes it to run the REVERSE method. Most objects are capable This was sent by the SourceForge.net collaborative development platform, the world's largest Open Source development site. |
From: <bi...@us...> - 2009-04-06 20:25:47
|
Revision: 4341 http://oorexx.svn.sourceforge.net/oorexx/?rev=4341&view=rev Author: bigrixx Date: 2009-04-06 20:25:41 +0000 (Mon, 06 Apr 2009) Log Message: ----------- [ oorexx-Support Requests-2737764 ] precedence table should include ~ and ~~ Modified Paths: -------------- docs/trunk/rexxref/intro.sgml Modified: docs/trunk/rexxref/intro.sgml =================================================================== --- docs/trunk/rexxref/intro.sgml 2009-04-06 00:12:34 UTC (rev 4340) +++ docs/trunk/rexxref/intro.sgml 2009-04-06 20:25:41 UTC (rev 4341) @@ -1803,6 +1803,7 @@ <colspec colnum="1" colwidth="1*"> <colspec colnum="2" colwidth="3*"> <tbody> +<row><entry>~ ~~\</entry><entry>(message send)</entry></row> <row><entry>+ - ¬ \</entry><entry>(prefix operators)</entry></row> <row><entry>**</entry><entry>(power)</entry></row> <row><entry>* / % //</entry><entry>(multiply and divide)</entry></row> This was sent by the SourceForge.net collaborative development platform, the world's largest Open Source development site. |
From: <mie...@us...> - 2009-07-16 17:13:35
|
Revision: 4932 http://oorexx.svn.sourceforge.net/oorexx/?rev=4932&view=rev Author: miesfeld Date: 2009-07-16 17:13:31 +0000 (Thu, 16 Jul 2009) Log Message: ----------- Fix 2822267, 2822268, 2822269 proof-reading by Craig Harris. Thanks Craig. Modified Paths: -------------- docs/trunk/rexxref/intro.sgml Modified: docs/trunk/rexxref/intro.sgml =================================================================== --- docs/trunk/rexxref/intro.sgml 2009-07-16 17:11:14 UTC (rev 4931) +++ docs/trunk/rexxref/intro.sgml 2009-07-16 17:13:31 UTC (rev 4932) @@ -721,7 +721,7 @@ A literal string has no upper bound on the number of characters, limited on by available memory. </para> -<para>Note that a string immediately followed by a right parenthesis is +<para>Note that a string immediately followed by a left parenthesis is considered to be the name of a function. If immediately followed by the symbol <varname>X</varname> or <varname>x</varname>, it is considered to be a hexadecimal string. If followed immediately by the symbol <varname>B</varname> This was sent by the SourceForge.net collaborative development platform, the world's largest Open Source development site. |