rakudo / rakudo
watch download tarball
public
Forks62Right
Watchers211Right
Description: Rakudo Perl -- Perl 6 on Parrot
Homepage: http://rakudo.org/
Clone URL: git://github.com/rakudo/rakudo.git
rakudo / src / parser / grammar-oper.pg
100644 197 lines (174 sloc) 6.938 kb
raw blame history 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197

# Copyright (C) 2007, The Perl Foundation.
# $Id$
 
## autoincrement
proto postfix:<++> is precedence('x=') is lvalue(1) { ... }
proto postfix:<--> is equiv(postfix:<++>) is lvalue(1) { ... }
proto prefix:<++> is equiv(postfix:<++>) is lvalue(1) { ... }
proto prefix:<--> is equiv(postfix:<++>) is lvalue(1) { ... }
proto postfix:<i> is equiv(postfix:<++>) { ... }
 
## exponentiation
proto infix:<**> is precedence('w=') is assoc('right') { ... }
 
## symbolic unary
proto prefix:<+> is precedence('v=') { ... }
proto prefix:<-> is equiv(prefix:<+>) { ... }
proto prefix:<~> is equiv(prefix:<+>) { ... }
proto prefix:<?> is equiv(prefix:<+>) { ... }
proto prefix:<!> is equiv(prefix:<+>) { ... }
proto prefix:<+^> is equiv(prefix:<+>)
    is pirop('bnot')
    { ... }
proto prefix:<=> is equiv(prefix:<+>) { ... }
proto prefix:<^> is equiv(prefix:<+>) { ... }
proto prefix:<\> is equiv(prefix:<+>) { ... }
proto prefix:<|> is equiv(prefix:<+>) { ... }
 
## multiplicative operators
proto infix:<*> is precedence('u=') { ... }
proto infix:</> is equiv(infix:<*>) { ... }
proto infix:<%> is equiv(infix:<*>) { ... }
proto infix:<+&> is equiv(infix:<*>) { ... }
proto infix:<+^> is equiv(infix:<*>) { ... }
proto infix:«+<» is equiv(infix:<*>) { ... }
proto infix:«+>» is equiv(infix:<*>) { ... }
proto infix:<~&> is equiv(infix:<*>) { ... }
proto infix:«~<» is equiv(infix:<*>) { ... }
proto infix:«~>» is equiv(infix:<*>) { ... }
proto infix:<?&> is equiv(infix:<*>) { ... }
proto infix:<div> is equiv(infix:<*>) { ... }
proto infix:<mod> is equiv(infix:<*>) { ... }
 
## additive operators
proto infix:<+> is precedence('t=') { ... }
proto infix:<-> is equiv(infix:<+>) { ... }
proto infix:<+|> is equiv(infix:<+>) { ... }
proto infix:<+^> is equiv(infix:<+>) { ... }
proto infix:<~|> is equiv(infix:<+>) { ... }
proto infix:<~^> is equiv(infix:<+>) { ... }
proto infix:<?|> is equiv(infix:<+>) { ... }
proto infix:<?^> is equiv(infix:<+>) { ... }
 
## replication
proto infix:<x> is precedence('s=') { ... }
proto infix:<xx> is equiv(infix:<x>) { ... }
 
## concatenation
proto infix:<~> is precedence('r=') { ... }
 
## junctive and
proto infix:<&> is precedence('q=')
    is assoc('list')
    { ... }
 
## junctive or
proto infix:<|> is precedence('p=')
    is assoc('list')
    { ... }
proto infix:<^> is equiv(infix:<|>)
    is assoc('list')
    { ... }
 
## named unary
proto prefix:<abs> is precedence('o=') is subname('abs') { ... }
proto prefix:<HOW> is equiv(prefix:<abs>) is subname('HOW') { ... }
proto prefix:<WHAT> is equiv(prefix:<abs>) is subname('WHAT') { ... }
proto prefix:<pop> is equiv(prefix:<abs>) is subname('pop') { ... }
proto prefix:<shift> is equiv(prefix:<abs>) is subname('shift') { ... }
proto prefix:<defined> is equiv(prefix:<abs>) is subname('defined') { ... }
 
## nonchaining
proto infix:<..> is precedence('n=') { ... }
proto infix:<..^> is equiv(infix:<..>) { ... }
proto infix:<^..> is equiv(infix:<..>) { ... }
proto infix:<^..^> is equiv(infix:<..>) { ... }
proto infix:«<=>» is equiv(infix:<..>) { ... }
proto infix:<cmp> is equiv(infix:<..>) { ... }
proto infix:<leg> is equiv(infix:<..>) { ... }
proto infix:<=:=> is equiv(infix:<..>) { ... }
proto infix:<!=:=> is equiv(infix:<..>) { ... }
proto infix:<does> is equiv(infix:<..>) { ... }
proto infix:<but> is equiv(infix:<..>) { ... }
 
## chaining
proto infix:<==>  is precedence('m=') is pasttype('chain') { ... }
proto infix:<!=>  is equiv(infix:<==>) is pasttype('chain') { ... }
proto infix:<!==>  is equiv(infix:<==>) is pasttype('chain') { ... }
proto infix:«<»   is equiv(infix:<==>) is pasttype('chain') { ... }
proto infix:«<=»  is equiv(infix:<==>) is pasttype('chain') { ... }
proto infix:«>»   is equiv(infix:<==>) is pasttype('chain') { ... }
proto infix:«>=»  is equiv(infix:<==>) is pasttype('chain') { ... }
proto infix:<eq>  is equiv(infix:<==>) is pasttype('chain') { ... }
proto infix:<!eq>  is equiv(infix:<==>) is pasttype('chain') { ... }
proto infix:<ne>  is equiv(infix:<==>) is pasttype('chain') { ... }
proto infix:<lt>  is equiv(infix:<==>) is pasttype('chain') { ... }
proto infix:<le>  is equiv(infix:<==>) is pasttype('chain') { ... }
proto infix:<gt>  is equiv(infix:<==>) is pasttype('chain') { ... }
proto infix:<ge>  is equiv(infix:<==>) is pasttype('chain') { ... }
proto infix:<~~>  is equiv(infix:<==>) is pasttype('chain') { ... }
proto infix:<!~~>  is equiv(infix:<==>) is pasttype('chain') { ... }
proto infix:<===> is equiv(infix:<==>) is pasttype('chain') { ... }
proto infix:<!===> is equiv(infix:<==>) is pasttype('chain') { ... }
proto infix:<eqv> is equiv(infix:<==>) is pasttype('chain') { ... }
proto infix:<!eqv> is equiv(infix:<==>) is pasttype('chain') { ... }
 
## tight and
proto infix:<&&> is precedence('l=')
    is pasttype('if')
    { ... }
 
## tight or
proto infix:<||> is precedence('k=')
    is pasttype('unless')
    { ... }
proto infix:<^^> is equiv(infix:<||>)
    is pasttype('xor')
    { ... }
proto infix:<//> is equiv(infix:<||>)
    is pasttype('def_or')
    { ... }
proto infix:<min> is equiv(infix:<||>) 
    is assoc('list')
    { ... }
proto infix:<max> is equiv(infix:<||>)
    is assoc('list')
    { ... }
 
## conditional
proto ternary:<?? !!> is precedence('j=') is pasttype('if') is assoc('right') { ... }
 
## item assignment
proto infix:<:=> is precedence('i=') is pasttype('bind') { ... }
proto infix:<::=> is equiv(infix:<:=>) { ... }
proto infix:<.=> is equiv(infix:<:=>) { ... }
proto infix:«=>» is equiv(infix:<:=>) { ... }
proto infix:<//=> is equiv(infix:<:=>) { ... }
proto infix:<&&=> is equiv(infix:<:=>) { ... }
proto infix:<||=> is equiv(infix:<:=>) { ... }
 
## loose unary
proto prefix:<true> is precedence('h=') is subname('true') { ... }
proto prefix:<not> is equiv(prefix:<true>) is subname('not') { ... }
 
## comma
proto infix:<,> is precedence('g=')
    is assoc('list')
    is nullterm
    { ... }
proto infix:«p5=>» is equiv(infix:<,>) is subname('infix:,') { ... }
 
## list infix
proto infix:<X> is precedence('f=')
    is assoc('list')
    { ... }
proto infix:<X,X> is equiv(infix:<X>)
    is assoc('list')
    is subname('infix:X')
    { ... }
proto infix:<Z> is equiv(infix:<X>)
    is assoc('list')
    { ... }
 
## list assignment
proto infix:<=> is precedence('e=')
    is assoc('right')
    is lvalue(1)
    { ... }
proto prefix:<[,]> is precedence('e=') is subname('list') {...}
proto prefix:<[&]> is equiv(prefix:<[,]>) is subname('all') {...}
proto prefix:<[|]> is equiv(prefix:<[,]>) is subname('any') {...}
proto prefix:<[^]> is equiv(prefix:<[,]>) is subname('one') {...}
 
## loose and
proto infix:<and> is precedence('d=')
    is pasttype('if')
    { ... }
proto infix:<andthen> is equiv(infix:<and>) { ... }
 
## loose or
proto infix:<or> is precedence('c=')
    is pasttype('unless')
    { ... }
proto infix:<xor> is equiv(infix:<or>)
    is pasttype('xor')
    { ... }
proto infix:<orelse> is equiv(infix:<or>) { ... }