mirror of
https://github.com/cc65/cc65.git
synced 2024-12-23 19:29:37 +00:00
Applied a patch from Greg King for better layout of the operator table.
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:
parent
52d0b2b5a7
commit
cb47c4370b
@ -3,7 +3,7 @@
|
||||
<article>
|
||||
<title>ca65 Users Guide
|
||||
<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>
|
||||
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>
|
||||
|
||||
Available operators sorted by precedence:
|
||||
|
||||
<table>
|
||||
<tabular ca="llc">
|
||||
Op|Description|Precedence@<hline>
|
||||
|Builtin string functions|0@
|
||||
|Builtin pseudo variables|1@
|
||||
|Builtin pseudo functions|1@
|
||||
+|Unary plus|1@
|
||||
-|Unary minus|1@
|
||||
˜|Unary bitwise not|1@
|
||||
<tabular ca="clc">
|
||||
<bf/Operator/| <bf/Description/| <bf/Precedence/@<hline>
|
||||
| Built-in string functions| 0@
|
||||
||~@
|
||||
| Built-in pseudo-variables| 1@
|
||||
| Built-in pseudo-functions| 1@
|
||||
+| Unary positive| 1@
|
||||
-| Unary negative| 1@
|
||||
˜<newline>
|
||||
.BITNOT| Unary bitwise not| 1@
|
||||
<|Low byte operator|1@
|
||||
>|High byte operator|1@
|
||||
^|Bank byte operator|1@
|
||||
<<newline>
|
||||
.LOBYTE| Unary low-byte operator| 1@
|
||||
><newline>
|
||||
.HIBYTE| Unary high-byte operator| 1@
|
||||
^<newline>
|
||||
.BANKBYTE| Unary bank-byte operator| 1@
|
||||
||~@
|
||||
*| Multiplication| 2@
|
||||
/| Division| 2@
|
||||
.MOD|Modulo operation|2@
|
||||
&|Bitwise and|2@
|
||||
.MOD| Modulo operator| 2@
|
||||
&<newline>
|
||||
.BITAND| Bitwise and| 2@
|
||||
^|Bitwise xor|2@
|
||||
.BITXOR|Bitwise xor|2@
|
||||
<<|Shift left operator|2@
|
||||
.SHL|Shift left operator|2@
|
||||
>>|Shift right operato|r@
|
||||
.SHR|Shift right operator|2@
|
||||
+|Binary plus|3@
|
||||
-|Binary minus|3@
|
||||
||Binary or|3@
|
||||
.BITOR|Binary or|3@
|
||||
=|Compare operation (equal)|4@
|
||||
<>|Compare operation (not equal)|4@
|
||||
<|Compare operation (less)|4@
|
||||
>|Compare operation (greater)|4@
|
||||
<=|Compare operation (less or equal)|4@
|
||||
>=|Compare operation (greater or equal)|4@
|
||||
&&|Boolean and|5@
|
||||
^<newline>
|
||||
.BITXOR| Binary bitwise xor| 2@
|
||||
<<<newline>
|
||||
.SHL| Shift-left operator| 2@
|
||||
>><newline>
|
||||
.SHR| Shift-right operator| 2@
|
||||
||~@
|
||||
+| Binary addition| 3@
|
||||
-| Binary subtraction| 3@
|
||||
|<newline>
|
||||
.BITOR| Bitwise or| 3@
|
||||
||~@
|
||||
= | Compare operator (equal)| 4@
|
||||
<>| Compare operator (not equal)| 4@
|
||||
<| Compare operator (less)| 4@
|
||||
>| Compare operator (greater)| 4@
|
||||
<=| Compare operator (less or equal)| 4@
|
||||
>=| Compare operator (greater or equal)| 4@
|
||||
||~@
|
||||
&&<newline>
|
||||
.AND| Boolean and| 5@
|
||||
.XOR| Boolean xor| 5@
|
||||
|||Boolean or|6@
|
||||
||~@
|
||||
||<newline>
|
||||
.OR| Boolean or| 6@
|
||||
!|Boolean not|7@
|
||||
.NOT|Boolean not|7@
|
||||
||~@
|
||||
!<newline>
|
||||
.NOT| Boolean not| 7@<hline>
|
||||
</tabular>
|
||||
<caption>Available operators sorted by precedence
|
||||
<caption>Available operators, sorted by precedence
|
||||
</table>
|
||||
|
||||
To force a specific order of evaluation, braces may be used as usual.
|
||||
<p>
|
||||
To force a specific order of evaluation, parentheses may be used, as usual.
|
||||
|
||||
|
||||
|
||||
|
Loading…
Reference in New Issue
Block a user