Artifact 49e0564d26a0c89fbdba39500c456cc4d1f1599483f33ffb97d341eadf6adc14:

• Executable file r37/lisp/csl/html/r37_0035.html — part of check-in [f2fda60abd] at 2011-09-02 18:13:33 on branch master — Some historical releases purely for archival purposes

  git-svn-id: https://svn.code.sf.net/p/reduce-algebra/code/trunk/historical@1375 2bfe0521-f11c-4a00-b80e-6202646ff360 (user: arthurcnorman@users.sourceforge.net, size: 1094) [annotate] [blame] [check-ins using] [more...]

<A NAME=leqsign>

<TITLE>leqsign</TITLE></A>
<b><a href=r37_idx.html>INDEX</a></b><p><p>



<B><=</B> _ _ _ <B>LEQSIGN</B> _ _ _  _ _ _  _ _ _  _ _ _ <B>operator</B><P>
<P>
 
<em>&lt;=</em> is an infix binary comparison operator that returns 
 true if its first argument is less than or equal to its second argument. 
<P>
<P>
 <P> <H3> 
syntax: </H3>
&lt;expression&gt; <em>&lt;=</em> &lt;expression&gt; 
<P>
<P>
<P>
&lt;expression&gt; must evaluate to a number, e.g., integer, rational or 
floating point number. 
<P>
<P>
 <P> <H3> 
examples: </H3>
<P><PRE><TT>
a := 10; 

  A := 10 


if a &lt;= 10 then true; 

  true

</TT></PRE><P>The binary comparison operators can only be used for comparisons b
etween 
numbers or variables that evaluate to numbers. The truth values returned 
by such a comparison can only be used inside programming constructs, such 
as 
<A HREF=r37_0052.html>if</A>...<em>then</em>...<em>else</em> or 

<A HREF=r37_0056.html>repeat</A>...<em>until</em> or 
<A HREF=r37_0228.html>while</A>...<em>do</em>. 
<P>
<P>
<P>