Sie sind auf Seite 1von 1

!

e"o#c $able of % &pera'or(


Being a comprehensive an) complete enumeration of the Symbolic Elements of the
Produced in the
Perl 6 Language. Assemble) an) )rawn with )e)ication an) )iligence by
Provence of Perl 6
M. Lentczner as a service to the Community an) the Republic in hopes of increasing

True Operators Knowle)ge an) Un)erstan)ing amongst practitioners in the art of Software.

Secon) E)ition, May Twenty-Eighth, Two Thousan) Four

Comparitins
Noble Gas
Bi,C 9 Bi,C 9 M Quasi Operators

s
< lt

oid
numeric string
»op«
hyper
less less

lic
Qm
_

ltip
Bi,C 9 Bi,C 9
Contextegens > gt
magical
whitespace
Magics

Mu
numeric string modifier

ids

e
greater greater

ltit
Qj Qj Qj Qj

no
Pr,R 4 Pr,R 4 Bi,L 6 Bi,C 9 Bi,C 9 Bi,L 16.5
none one any all Junctors

fau
de
* \ xx <= le : junctive junctive junctive junctive

e
De
list list numeric string

Ad

tiv
reference adverbial
flatten repetition less or eq. less or eq.

ite
Qan Qan Qan
ve

mo
Pr,R 4 Pr,R 4 Bi,L 6 Bi,L 7 Bi,C 9 Bi,C 9 Bi,L 12.2 Bi,L 16.4 Bi,L 18

Or
{…} […] (…) Anonymizers
cti

Sc Sc
llic

dit
- ! x ~ >= ge // err

co
¦ anon. hash anon. array list
Jun
c

numeric boolean string string numeric string logical logical

An
Ca

zip

Lo
mi

negate negate repetition concatenate greater or eq greater or eq err error


Qdr Qdr Qdr Qdr Qdr

ids
ic
nu

Bi,L 1.2 Bi,L 2.2 Pr,R 4 Pr,R 4 Bi,L 6 Bi,C 9 Bi,C 9 Bi,L 10 Bi,L 11 Bi,L 11 Bi,L 12.2 Bi,L 13.2 Bi,R 15 Bi,L 16.3 Bi,L 18 ::(…) &(…) %(…) @(…) $(…)
Contextegens
tch

ifto
^ + +^ == eq +& +| +^ ^^ ==> ::= ; xor package sub hash array scalar
to

. % context context context context context


Ma
Au

juctive numeric bitwise numeric string bitwise bitwise bitwise logical pipe compile-time greater logical

Sh
method call modulus
xor context complement equal equal and or xor xor right binding list comma xor
Qal Qal Qal

Pr 1.1 Pr 2 Bi,L 2.2 Pr,R 4 Pr,R 4 Bi,L 5 Bi,L 6 Bi,L 7 Bi,L 8 Pr,R 8½ Bi,C 9 Bi,C 9 Bi,L 10 Bi,L 11 Bi,L 11 Bi,L 12.2 Bi,R 13.2 Bi,R 15 Bi,L 16.2 Bi,L 18 -
Sc Sc tr/// s/// m// Alterations
. -- | ~ ~^ !~ / - +>> != ne ~& ~| ~^ || <== := , or translate substitute match
method call pre- juctive string charwise smart
divide subtract
bitwise -x numeric string charwise charwise charwise logical pipe run-time
list comma
logical
on current decrement or context complement non-match shift right not equal not equal and or xor or left binding or
Qq Qq Qq Qq Qq

Pr 1.1 Pr 2 Bi,L 2.1 Bi,L 3 Pr,R 4 Pr,R 4 Bi,L 5 Bi,L 6 Bi,L 7 Bi,L 8 Pr 8½ Bi 9 Bi 9 Bi,L 10 Bi,L 11 Bi,L 11 Bi,L 12.1 Bi 13 Tr,Sc 14 Bi,R 15 Bi,L 16.1 Pr,R 17.1 Bi,L 17.2 «…» /…/ `…` "…" '…'
.= ++ & ** ? ?^ ~~ +<< <=> cmp ?& ?| ?^
Sc
&& ??:: not
Sc
and word regular system interpolating non-interp
method call
pre- juctive exponen- boolean boolean smart
* + bitwise text numeric string boolean boolean boolean logical
.. logical
= => logical logical
list expression command string string
on current,
replace
increment and tiation context invert match
multiply add
shift left compare compare and or xor and
range
if/else
assignment pair
not and
Qq Qq Qq Qq Qq Quotables
Po 2 Bi,R 15 Bi,R 15 Po,L 4 Bi,R 15 Bi,R 15 Bi,R 15 Bi 9 Bi,R 15 Bi,R 15 Bi,R 15 Bi,R
Sc
15 Po,L 4 qw/…/ rx/…/ qx/…/ qq/…/ q/…/
++ &= **= (…) *= += +<<= =:= ?&= ?|= ?^= &&= ... word regular system interpolating non-interp

ns

s
De Orite
e)
tic
list expression command string string

en

ite
post- junctive exponen- method bitwise boolean boolean boolean logical semi-infinite

ltit
identity

ge
multiply add

p
increment and tiation call shift left and or xor and range

teg

(An sser -
Qb Qb

Try

fau
ne
Po 2 Bi,R 15 Po,L 4 Bi,R 15 Bi,R 15 Bi,R 15 Bi,R 15 Bi,R 15 Bi,R 15 Bi,R 15

,
<<end <…> Bazaars

Lis

e
Sc

sig
-- |= […] +>>= ~&= ~|= ~^= ||=

dit
/= -= here-doc iteration

Le
post- junctive array bitwise charwise charwise charwise logical

As
divide subtract
decrement or access shift right and or xor or

&
Qt Qt Qt Qt

Bi,R 15 Po,L 4 Bi,R 15 Bi,R 15 Bi,R 15 Bi,R 15 Bi,R 15


undef NaN Inf ...
^= {…} %= +&= +|= +^= ^^= undefined not a number infinity
yada yada
yada
Termplars
junctive hash bitwise bitwise bitwise logical
modulus
xor access and or xor xor
Qdc Qdc Qdc

Bi,R 15 Bi,R 15 Bi,R 15 hash -> is


x= ~=
Sc
//= force hash like 'sub' var Declars
ids

context properties
rie

string string logical


repetition concatenate err
no

sso

Bi,R 15
pa

ce

xx=
Ex

Ac

list
repetition

Synematic Operators
Binary = Bi
Prefix Unary = Pr Pr,R 8½ Pr,R 8½ Pr,R 8½ Pr,R 8½ Pr,R 8½ Pr,R 8½ Pr,R 8½ Pr,R 8½ Pr,R 8½ Pr,R 8½ Pr,R 8½ Pr,R 8½ Pr,R 8½
Postfix Unary = Po
Bi,L 12.1 Precedence (lower = tighter) Filinis -r -w -x -o -e -z -s -u -g -k -M -A -C
Trinary = Tr readable writable executable owned mod time access time change time
Sc eff. uid/gid eff. uid/gid eff. uid/gid effective uid
exists zero size size setuid setgid sticky
before script before script before script
Meta-operator = Me && Symbol Pr,R 8½ Pr,R 8½ Pr,R 8½ Pr,R 8½ Pr,R 8½ Pr,R 8½ Pr,R 8½ Pr,R 8½ Pr,R 8½ Pr,R 8½ Pr,R 8½ Pr,R 8½ Pr,R 8½ Pr,R 8½

logical -R -W -X -O -f -d -l -p -S -b -c -t -T -B
Left associative = L Name readable writable executable owned

Right associative = R and real uid/gid real uid/gid real uid/gid real uid
plain file directory symbolic link named pipe special file block special char special tty text binary Copyright 2004, Mark Lentczner.
http://www.ozonehouse.com/mark/
Chaining = C This work is licensed under the Creative
Pr 8½ Pr 8½ Pr 8½ Pr 8½ Pr 8½ Pr 8½ Pr 8½ Pr 8½ Commons Attribution-NonCommercial-
ShareAlike License. To view a copy of this
Short-Circuit = Sc Textaveries ref exists delete defined undef temp let but license, visit http://creativecommons.org/
licenses/by-nc-sa/2.0/ or send a letter to
Creative Commons, 559 Nathan Abbott
Way, Stanford, California 94305, USA.

Das könnte Ihnen auch gefallen