FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
sh/syntax/parser_arithm.go at master · jgraichen/sh · GitHub
jgraichen
/
sh
Public
forked from
mvdan/sh
Notifications
You must be signed in to change notification settings
Fork
0
Star
0
Code
Pull requests
0
Actions
Projects
Security and quality
0
Insights
Additional navigation options
Code
Pull requests
Actions
Projects
Security and quality
Insights
Expand file tree
Breadcrumbs
sh
/
syntax
/
parser_arithm.go
Copy path
More file actions
More file actions
Latest commit
History
History
History
353 lines (316 loc) · 8.16 KB
Breadcrumbs
sh
/
syntax
/
parser_arithm.go
Copy path
File metadata and controls
353 lines (316 loc) · 8.16 KB
Raw
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
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
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
package
syntax
// compact specifies whether we allow spaces between expressions.
// This is true for let
func
(
p
*
Parser
)
arithmExpr
(
compact
bool
)
ArithmExpr
{
return
p
.
arithmExprComma
(
compact
)
}
// These function names are inspired by Bash's expr.c
func
(
p
*
Parser
)
arithmExprComma
(
compact
bool
)
ArithmExpr
{
return
p
.
arithmExprBinary
(
compact
,
p
.
arithmExprAssign
,
Comma
)
}
func
(
p
*
Parser
)
arithmExprAssign
(
compact
bool
)
ArithmExpr
{
// Assign is different from the other binary operators because it's
// right-associative and needs to check that it's placed after a name
value
:=
p
.
arithmExprTernary
(
compact
)
switch
BinAritOperator
(
p
.
tok
) {
case
AddAssgn
,
SubAssgn
,
MulAssgn
,
QuoAssgn
,
RemAssgn
,
AndAssgn
,
OrAssgn
,
XorAssgn
,
ShlAssgn
,
ShrAssgn
,
Assgn
:
if
compact
&&
p
.
spaced
{
return
value
}
if
!
isArithName
(
value
) {
p
.
posErr
(
p
.
pos
,
"%s must follow a name"
,
p
.
tok
.
String
())
}
pos
:=
p
.
pos
tok
:=
p
.
tok
p
.
nextArithOp
(
compact
)
y
:=
p
.
arithmExprAssign
(
compact
)
if
y
==
nil
{
p
.
followErrExp
(
pos
,
tok
.
String
())
}
return
&
BinaryArithm
{
OpPos
:
pos
,
Op
:
BinAritOperator
(
tok
),
X
:
value
,
Y
:
y
,
}
}
return
value
}
func
(
p
*
Parser
)
arithmExprTernary
(
compact
bool
)
ArithmExpr
{
value
:=
p
.
arithmExprLor
(
compact
)
if
BinAritOperator
(
p
.
tok
)
!=
TernQuest
||
(
compact
&&
p
.
spaced
) {
return
value
}
if
value
==
nil
{
p
.
curErr
(
"%s must follow an expression"
,
p
.
tok
.
String
())
}
questPos
:=
p
.
pos
p
.
nextArithOp
(
compact
)
if
BinAritOperator
(
p
.
tok
)
==
TernColon
{
p
.
followErrExp
(
questPos
,
TernQuest
.
String
())
}
trueExpr
:=
p
.
arithmExpr
(
compact
)
if
trueExpr
==
nil
{
p
.
followErrExp
(
questPos
,
TernQuest
.
String
())
}
if
BinAritOperator
(
p
.
tok
)
!=
TernColon
{
p
.
posErr
(
questPos
,
"ternary operator missing : after ?"
)
}
colonPos
:=
p
.
pos
p
.
nextArithOp
(
compact
)
falseExpr
:=
p
.
arithmExprTernary
(
compact
)
if
falseExpr
==
nil
{
p
.
followErrExp
(
colonPos
,
TernColon
.
String
())
}
return
&
BinaryArithm
{
OpPos
:
questPos
,
Op
:
TernQuest
,
X
:
value
,
Y
:
&
BinaryArithm
{
OpPos
:
colonPos
,
Op
:
TernColon
,
X
:
trueExpr
,
Y
:
falseExpr
,
},
}
}
func
(
p
*
Parser
)
arithmExprLor
(
compact
bool
)
ArithmExpr
{
return
p
.
arithmExprBinary
(
compact
,
p
.
arithmExprLand
,
OrArit
)
}
func
(
p
*
Parser
)
arithmExprLand
(
compact
bool
)
ArithmExpr
{
return
p
.
arithmExprBinary
(
compact
,
p
.
arithmExprBor
,
AndArit
)
}
func
(
p
*
Parser
)
arithmExprBor
(
compact
bool
)
ArithmExpr
{
return
p
.
arithmExprBinary
(
compact
,
p
.
arithmExprBxor
,
Or
)
}
func
(
p
*
Parser
)
arithmExprBxor
(
compact
bool
)
ArithmExpr
{
return
p
.
arithmExprBinary
(
compact
,
p
.
arithmExprBand
,
Xor
)
}
func
(
p
*
Parser
)
arithmExprBand
(
compact
bool
)
ArithmExpr
{
return
p
.
arithmExprBinary
(
compact
,
p
.
arithmExprEquality
,
And
)
}
func
(
p
*
Parser
)
arithmExprEquality
(
compact
bool
)
ArithmExpr
{
return
p
.
arithmExprBinary
(
compact
,
p
.
arithmExprComparison
,
Eql
,
Neq
)
}
func
(
p
*
Parser
)
arithmExprComparison
(
compact
bool
)
ArithmExpr
{
return
p
.
arithmExprBinary
(
compact
,
p
.
arithmExprShift
,
Lss
,
Gtr
,
Leq
,
Geq
)
}
func
(
p
*
Parser
)
arithmExprShift
(
compact
bool
)
ArithmExpr
{
return
p
.
arithmExprBinary
(
compact
,
p
.
arithmExprAddition
,
Shl
,
Shr
)
}
func
(
p
*
Parser
)
arithmExprAddition
(
compact
bool
)
ArithmExpr
{
return
p
.
arithmExprBinary
(
compact
,
p
.
arithmExprMultiplication
,
Add
,
Sub
)
}
func
(
p
*
Parser
)
arithmExprMultiplication
(
compact
bool
)
ArithmExpr
{
return
p
.
arithmExprBinary
(
compact
,
p
.
arithmExprPower
,
Mul
,
Quo
,
Rem
)
}
func
(
p
*
Parser
)
arithmExprPower
(
compact
bool
)
ArithmExpr
{
// Power is different from the other binary operators because it's right-associative
value
:=
p
.
arithmExprUnary
(
compact
)
if
BinAritOperator
(
p
.
tok
)
!=
Pow
||
(
compact
&&
p
.
spaced
) {
return
value
}
if
value
==
nil
{
p
.
curErr
(
"%s must follow an expression"
,
p
.
tok
.
String
())
}
op
:=
p
.
tok
pos
:=
p
.
pos
p
.
nextArithOp
(
compact
)
y
:=
p
.
arithmExprPower
(
compact
)
if
y
==
nil
{
p
.
followErrExp
(
pos
,
op
.
String
())
}
return
&
BinaryArithm
{
OpPos
:
pos
,
Op
:
BinAritOperator
(
op
),
X
:
value
,
Y
:
y
,
}
}
func
(
p
*
Parser
)
arithmExprUnary
(
compact
bool
)
ArithmExpr
{
if
!
compact
{
p
.
got
(
_Newl
)
}
switch
UnAritOperator
(
p
.
tok
) {
case
Not
,
BitNegation
,
Plus
,
Minus
:
ue
:=
&
UnaryArithm
{
OpPos
:
p
.
pos
,
Op
:
UnAritOperator
(
p
.
tok
)}
p
.
nextArithOp
(
compact
)
if
ue
.
X
=
p
.
arithmExprUnary
(
compact
);
ue
.
X
==
nil
{
p
.
followErrExp
(
ue
.
OpPos
,
ue
.
Op
.
String
())
}
return
ue
}
return
p
.
arithmExprValue
(
compact
)
}
func
(
p
*
Parser
)
arithmExprValue
(
compact
bool
)
ArithmExpr
{
var
x
ArithmExpr
switch
p
.
tok
{
case
addAdd
,
subSub
:
ue
:=
&
UnaryArithm
{
OpPos
:
p
.
pos
,
Op
:
UnAritOperator
(
p
.
tok
)}
p
.
nextArith
(
compact
)
if
p
.
tok
!=
_LitWord
{
p
.
followErr
(
ue
.
OpPos
,
token
(
ue
.
Op
).
String
(),
"a literal"
)
}
ue
.
X
=
p
.
arithmExprValue
(
compact
)
return
ue
case
leftParen
:
pe
:=
&
ParenArithm
{
Lparen
:
p
.
pos
}
p
.
nextArithOp
(
compact
)
pe
.
X
=
p
.
followArithm
(
leftParen
,
pe
.
Lparen
)
pe
.
Rparen
=
p
.
matched
(
pe
.
Lparen
,
leftParen
,
rightParen
)
x
=
pe
case
leftBrack
:
p
.
curErr
(
"[ must follow a name"
)
case
colon
:
p
.
curErr
(
"ternary operator missing ? before :"
)
case
_LitWord
:
l
:=
p
.
getLit
()
if
p
.
tok
!=
leftBrack
{
x
=
p
.
wordOne
(
l
)
break
}
pe
:=
&
ParamExp
{
Dollar
:
l
.
ValuePos
,
Short
:
true
,
Param
:
l
}
pe
.
Index
=
p
.
eitherIndex
()
x
=
p
.
wordOne
(
pe
)
case
bckQuote
:
if
p
.
quote
==
arithmExprLet
&&
p
.
openBquotes
>
0
{
return
nil
}
fallthrough
default
:
if
w
:=
p
.
getWord
();
w
!=
nil
{
x
=
w
}
else
{
return
nil
}
}
if
compact
&&
p
.
spaced
{
return
x
}
if
!
compact
{
p
.
got
(
_Newl
)
}
// we want real nil, not (*Word)(nil) as that
// sets the type to non-nil and then x != nil
if
p
.
tok
==
addAdd
||
p
.
tok
==
subSub
{
if
!
isArithName
(
x
) {
p
.
curErr
(
"%s must follow a name"
,
p
.
tok
.
String
())
}
u
:=
&
UnaryArithm
{
Post
:
true
,
OpPos
:
p
.
pos
,
Op
:
UnAritOperator
(
p
.
tok
),
X
:
x
,
}
p
.
nextArith
(
compact
)
return
u
}
return
x
}
// nextArith consumes a token.
// It returns true if compact and the token was followed by spaces
func
(
p
*
Parser
)
nextArith
(
compact
bool
)
bool
{
p
.
next
()
if
compact
&&
p
.
spaced
{
return
true
}
if
!
compact
{
p
.
got
(
_Newl
)
}
return
false
}
func
(
p
*
Parser
)
nextArithOp
(
compact
bool
) {
pos
:=
p
.
pos
tok
:=
p
.
tok
if
p
.
nextArith
(
compact
) {
p
.
followErrExp
(
pos
,
tok
.
String
())
}
}
// arithmExprBinary is used for all left-associative binary operators
func
(
p
*
Parser
)
arithmExprBinary
(
compact
bool
,
nextOp
func
(
bool
)
ArithmExpr
,
operators
...
BinAritOperator
)
ArithmExpr
{
value
:=
nextOp
(
compact
)
for
{
var
foundOp
BinAritOperator
for
_
,
op
:=
range
operators
{
if
p
.
tok
==
token
(
op
) {
foundOp
=
op
break
}
}
if
token
(
foundOp
)
==
illegalTok
||
(
compact
&&
p
.
spaced
) {
return
value
}
if
value
==
nil
{
p
.
curErr
(
"%s must follow an expression"
,
p
.
tok
.
String
())
}
pos
:=
p
.
pos
p
.
nextArithOp
(
compact
)
y
:=
nextOp
(
compact
)
if
y
==
nil
{
p
.
followErrExp
(
pos
,
foundOp
.
String
())
}
value
=
&
BinaryArithm
{
OpPos
:
pos
,
Op
:
foundOp
,
X
:
value
,
Y
:
y
,
}
}
}
func
isArithName
(
left
ArithmExpr
)
bool
{
w
,
ok
:=
left
.(
*
Word
)
if
!
ok
||
len
(
w
.
Parts
)
!=
1
{
return
false
}
switch
x
:=
w
.
Parts
[
0
].(
type
) {
case
*
Lit
:
return
ValidName
(
x
.
Value
)
case
*
ParamExp
:
return
x
.
nakedIndex
()
default
:
return
false
}
}
func
(
p
*
Parser
)
followArithm
(
ftok
token
,
fpos
Pos
)
ArithmExpr
{
x
:=
p
.
arithmExpr
(
false
)
if
x
==
nil
{
p
.
followErrExp
(
fpos
,
ftok
.
String
())
}
return
x
}
func
(
p
*
Parser
)
peekArithmEnd
()
bool
{
return
p
.
tok
==
rightParen
&&
p
.
r
==
')'
}
func
(
p
*
Parser
)
arithmMatchingErr
(
pos
Pos
,
left
,
right
token
) {
switch
p
.
tok
{
case
_Lit
,
_LitWord
:
p
.
curErr
(
"not a valid arithmetic operator: %s"
,
p
.
val
)
case
leftBrack
:
p
.
curErr
(
"[ must follow a name"
)
case
colon
:
p
.
curErr
(
"ternary operator missing ? before :"
)
case
rightParen
,
_EOF
:
p
.
matchingErr
(
pos
,
left
,
right
)
default
:
if
p
.
quote
==
arithmExpr
{
p
.
curErr
(
"not a valid arithmetic operator: %v"
,
p
.
tok
)
}
p
.
matchingErr
(
pos
,
left
,
right
)
}
}
func
(
p
*
Parser
)
matchedArithm
(
lpos
Pos
,
left
,
right
token
) {
if
!
p
.
got
(
right
) {
p
.
arithmMatchingErr
(
lpos
,
left
,
right
)
}
}
func
(
p
*
Parser
)
arithmEnd
(
ltok
token
,
lpos
Pos
,
old
saveState
)
Pos
{
if
!
p
.
peekArithmEnd
() {
p
.
arithmMatchingErr
(
lpos
,
ltok
,
dblRightParen
)
}
p
.
rune
()
p
.
postNested
(
old
)
pos
:=
p
.
pos
p
.
next
()
return
pos
}
Back
|
FazBrowse Home
|
New Git URL