bslathi19/cc65
1
0
Fork 0
Code Issues Pull Requests Actions 1 Packages Projects Releases Wiki Activity

Applied a patch from Greg King for better layout of the operator table.

Browse Source 
Minor changes by me (date format).


git-svn-id: svn://svn.cc65.org/cc65/trunk@3658 b7a2c559-68d2-44c3-8de9-860c34a00d81
This commit is contained in:
cuz
2005-11-20 17:22:43 +00:00
parent 52d0b2b5a7
commit cb47c4370b
1 changed files with 58 additions and 51 deletions
Download Patch File Download Diff File Expand all files Collapse all files

99
doc/ca65.sgml
View File

@@ -3,7 +3,7 @@
<article> <article>
<title>ca65 Users Guide <title>ca65 Users Guide
<author>Ullrich von Bassewitz, <htmlurl url="mailto:uz@cc65.org" name="uz@cc65.org"> <author>Ullrich von Bassewitz, <htmlurl url="mailto:uz@cc65.org" name="uz@cc65.org">
<date>19.07.2000, 29.11.2000, 02.10.2001 <date>2000-07-19, 2000-11-29, 2001-10-02, 2005-09-08
<abstract> <abstract>
ca65 is a powerful macro assembler for the 6502, 65C02 and 65816 CPUs. It is ca65 is a powerful macro assembler for the 6502, 65C02 and 65816 CPUs. It is
@@ -513,55 +513,62 @@ problem in most cases.
<sect1>Available operators<label id="operators"><p> <sect1>Available operators<label id="operators"><p>
Available operators sorted by precedence:
<table> <table>
<tabular ca="llc"> <tabular ca="clc">
Op|Description|Precedence@<hline> <bf/Operator/| <bf/Description/| <bf/Precedence/@<hline>
&nbsp;|Builtin string functions|0@ | Built-in string functions| 0@
&nbsp;|Builtin pseudo variables|1@ ||~@
&nbsp;|Builtin pseudo functions|1@ | Built-in pseudo-variables| 1@
+|Unary plus|1@ | Built-in pseudo-functions| 1@
-|Unary minus|1@ +| Unary positive| 1@
&tilde;|Unary bitwise not|1@ -| Unary negative| 1@
.BITNOT|Unary bitwise not|1@ &tilde;<newline>
&lt;|Low byte operator|1@ .BITNOT| Unary bitwise not| 1@
&gt;|High byte operator|1@ &lt;<newline>
^|Bank byte operator|1@ .LOBYTE| Unary low-byte operator| 1@
*|Multiplication|2@ &gt;<newline>
/|Division|2@ .HIBYTE| Unary high-byte operator| 1@
.MOD|Modulo operation|2@ ^<newline>
&amp;|Bitwise and|2@ .BANKBYTE| Unary bank-byte operator| 1@
.BITAND|Bitwise and|2@ ||~@
^|Bitwise xor|2@ *| Multiplication| 2@
.BITXOR|Bitwise xor|2@ /| Division| 2@
&lt;&lt;|Shift left operator|2@ .MOD| Modulo operator| 2@
.SHL|Shift left operator|2@ &amp;<newline>
&gt;&gt;|Shift right operato|r@ .BITAND| Bitwise and| 2@
.SHR|Shift right operator|2@ ^<newline>
+|Binary plus|3@ .BITXOR| Binary bitwise xor| 2@
-|Binary minus|3@ &lt;&lt;<newline>
&verbar;|Binary or|3@ .SHL| Shift-left operator| 2@
.BITOR|Binary or|3@ &gt;&gt;<newline>
=|Compare operation (equal)|4@ .SHR| Shift-right operator| 2@
&lt;&gt;|Compare operation (not equal)|4@ ||~@
&lt;|Compare operation (less)|4@ +| Binary addition| 3@
&gt;|Compare operation (greater)|4@ -| Binary subtraction| 3@
&lt;=|Compare operation (less or equal)|4@ &verbar;<newline>
&gt;=|Compare operation (greater or equal)|4@ .BITOR| Bitwise or| 3@
&amp;&amp;|Boolean and|5@ ||~@
.AND|Boolean and|5@ = | Compare operator (equal)| 4@
.XOR|Boolean xor|5@ &lt;&gt;| Compare operator (not equal)| 4@
&verbar;&verbar;|Boolean or|6@ &lt;| Compare operator (less)| 4@
.OR|Boolean or|6@ &gt;| Compare operator (greater)| 4@
!|Boolean not|7@ &lt;=| Compare operator (less or equal)| 4@
.NOT|Boolean not|7@ &gt;=| Compare operator (greater or equal)| 4@
||~@
&amp;&amp;<newline>
.AND| Boolean and| 5@
.XOR| Boolean xor| 5@
||~@
&verbar;&verbar;<newline>
.OR| Boolean or| 6@
||~@
!<newline>
.NOT| Boolean not| 7@<hline>
</tabular> </tabular>
<caption>Available operators sorted by precedence <caption>Available operators, sorted by precedence
</table> </table>
To force a specific order of evaluation, braces may be used as usual. To force a specific order of evaluation, parentheses may be used, as usual.
<p>