forked from nicklockwood/ShapeScript
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathParser.swift
More file actions
744 lines (695 loc) · 25.3 KB
/
Parser.swift
File metadata and controls
744 lines (695 loc) · 25.3 KB
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
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
//
// Parser.swift
// ShapeScript
//
// Created by Nick Lockwood on 26/09/2018.
// Copyright © 2018 Nick Lockwood. All rights reserved.
//
import Euclid
import Foundation
// MARK: Public interface
public func parse(_ input: String, at url: URL? = nil) throws -> Program {
var tokens = try ArraySlice(tokenize(input))
let statements = try tokens.readStatements()
if let token = tokens.first, token.type != .eof {
throw ParserError(.unexpectedToken(token, expected: nil))
}
return Program(source: input, fileURL: url, statements: statements)
}
public struct Program: Equatable {
public let source: String
public let fileURL: URL?
public let statements: [Statement]
}
public enum StatementType: Equatable {
case command(Identifier, Expression?)
case define(Identifier, Definition)
case option(Identifier, Expression)
case forloop(Identifier?, in: Expression, Block)
case ifelse(Expression, Block, else: Block?)
case switchcase(Expression, [CaseStatement], else: Block?)
case expression(ExpressionType)
}
public struct Statement: Equatable {
public let type: StatementType
public let range: SourceRange
}
public enum DefinitionType: Equatable {
case block(Block)
case function([Identifier], Block)
case expression(Expression)
}
public struct Definition: Equatable {
public let type: DefinitionType
public var range: SourceRange {
switch type {
case let .block(block), let .function(_, block):
return block.range
case let .expression(expression):
return expression.range
}
}
}
public enum ExpressionType: Equatable {
case number(Double)
case string(String)
case color(Color)
case identifier(String)
case block(Identifier, Block)
case tuple([Expression])
indirect case prefix(PrefixOperator, Expression)
indirect case infix(Expression, InfixOperator, Expression)
indirect case member(Expression, Identifier)
indirect case `subscript`(Expression, Expression)
indirect case `import`(Expression)
}
public struct Expression: Equatable {
public let type: ExpressionType
public let range: SourceRange
}
public struct Block: Equatable {
public let statements: [Statement]
public let range: SourceRange
}
public struct CaseStatement: Equatable {
var pattern: Expression
var body: Block
var range: SourceRange
}
public struct Identifier: Equatable {
public let name: String
public let range: SourceRange
}
public enum ParserErrorType: Equatable {
case unexpectedToken(Token, expected: String?)
case custom(String, hint: String?, at: SourceRange?)
}
public struct ParserError: Error, Equatable {
public let type: ParserErrorType
public init(_ type: ParserErrorType) {
self.type = type
}
}
public extension ParserError {
var range: SourceRange? {
switch type {
case let .unexpectedToken(token, _):
return token.range
case let .custom(_, _, at: range):
return range
}
}
var message: String {
switch type {
case let .unexpectedToken(token, _):
return "Unexpected \(token.type.errorDescription)"
case let .custom(message, _, _):
return message
}
}
var suggestion: String? {
switch type {
case let .unexpectedToken(token, expected):
guard case let .identifier(string) = token.type else {
return nil
}
guard let expected = expected else {
let options = Keyword.allCases.map { $0.rawValue }
return string.bestMatches(in: options).first
}
switch expected {
case "if body", "operator":
let options = InfixOperator.allCases.map { $0.rawValue }
return Self.alternatives[string.lowercased()] ??
string.bestMatches(in: options).first
case "case statement":
return string == "default" ? "else" : nil
default:
return nil
}
case .custom:
return nil
}
}
var hint: String? {
switch type {
case let .unexpectedToken(_, expected: expected):
if let suggestion = suggestion {
return "Did you mean '\(suggestion)'?"
}
return expected.map { "Expected \($0)." }
case let .custom(_, hint: hint, _):
return hint
}
}
}
// MARK: Implementation
extension ParserError {
static let alternatives: [String: String] = [
"mod": "%",
"fmod": "%",
"equals": "=",
"eq": "=",
"is": "=",
]
}
private extension TokenType {
var errorDescription: String {
switch self {
case .linebreak: return "end of line"
case let .identifier(name): return "token '\(name)'"
case let .keyword(keyword): return "keyword '\(keyword)'"
case let .hexColor(string): return "color \(string)"
case let .infix(op): return "operator '\(op.rawValue)'"
case let .prefix(op): return "prefix operator '\(op.rawValue)'"
case .number: return "numeric literal"
case .string: return "text literal"
case .lbrace: return "opening brace"
case .rbrace: return "closing brace"
case .lparen, .call: return "opening paren"
case .rparen: return "closing paren"
case .lbracket, .subscript: return "opening bracket"
case .rbracket: return "closing bracket"
case .dot: return "dot"
case .eof: return "end of file"
}
}
}
private extension ArraySlice where Element == Token {
var nextToken: Token {
first!
}
mutating func readToken() -> Token {
popFirst()!
}
mutating func readToken(_ type: TokenType) -> Bool {
guard nextToken.type == type else {
return false
}
removeFirst()
return true
}
mutating func requireToken(_ type: TokenType, as expected: String?) throws {
guard readToken(type) else {
throw ParserError(.unexpectedToken(nextToken, expected: expected))
}
}
mutating func requireToken(_ type: TokenType) throws {
try requireToken(type, as: type.errorDescription)
}
func require<T>(_ result: T?, as expected: String) throws -> T {
guard let result = result else {
throw ParserError(.unexpectedToken(nextToken, expected: expected))
}
return result
}
mutating func readIdentifier() -> Identifier? {
let token = nextToken
guard case let .identifier(name) = token.type else {
return nil
}
removeFirst()
return Identifier(name: name, range: token.range)
}
mutating func readBlock() throws -> Block? {
let start = self
guard readToken(.lbrace) else {
return nil
}
let statements = try readStatements()
let end = nextToken
try requireToken(.rbrace)
let range = start.nextToken.range.lowerBound ..< end.range.upperBound
return Block(statements: statements, range: range)
}
mutating func readOption() throws -> StatementType? {
guard readToken(.identifier("option")) else {
return nil
}
let name = try require(readIdentifier(), as: "option name")
let expression = try require(readExpressions(), as: "default value")
return .option(name, expression)
}
mutating func readParameters() throws -> [Identifier]? {
let start = self
guard let expression = try readExpressions() else {
return []
}
switch expression.type {
case let .identifier(name):
return [Identifier(name: name, range: expression.range)]
case let .tuple(expressions):
var names = [Identifier]()
for expression in expressions {
guard case let .identifier(name) = expression.type else {
fallthrough
}
names.append(Identifier(name: name, range: expression.range))
}
return names
default:
self = start
return nil
}
}
mutating func readDefine() throws -> StatementType? {
guard readToken(.keyword(.define)) else {
return nil
}
let name = try require(readIdentifier(), as: "symbol name")
let start = self
// TODO: should lparen be permitted here?
guard readToken(.call) || readToken(.lparen),
let names = try readParameters(),
readToken(.rparen),
let block = try readBlock()
else {
self = start
if let block = try readBlock() {
return .define(name, Definition(type: .block(block)))
}
let expression = try require(readExpressions(), as: "value")
return .define(name, Definition(type: .expression(expression)))
}
return .define(name, Definition(type: .function(names, block)))
}
mutating func readForLoop() throws -> StatementType? {
guard readToken(.keyword(.for)), let indexToken = first else {
return nil
}
let start = self
var expression = try require(readExpression(), as: "index or range")
let body = try require(readBlock(), as: "loop body")
if case let .tuple(elements) = expression.type,
case .infix(_, .in, _)? = elements.first?.type,
elements.count == 1
{
expression = elements[0]
}
if case let .infix(lhs, .in, rhs) = expression.type {
guard case let .identifier(name) = lhs.type else {
self = start
throw ParserError(.unexpectedToken(indexToken, expected: "loop index"))
}
let identifier = Identifier(name: name, range: lhs.range)
return .forloop(identifier, in: rhs, body)
}
return .forloop(nil, in: expression, body)
}
mutating func readIfElse() throws -> StatementType? {
guard readToken(.keyword(.if)) else {
return nil
}
let condition = try require(readExpression(), as: "condition")
let body = try require(readBlock(), as: "if body")
let start = self
_ = readToken(.linebreak)
guard readToken(.keyword(.else)) else {
self = start
return .ifelse(condition, body, else: nil)
}
let lowerBound = nextToken.range.lowerBound
if let elseBody = try readBlock() {
return .ifelse(condition, body, else: elseBody)
} else if let statementType = try readIfElse() {
let end = start[start.index(before: startIndex)]
let range = lowerBound ..< end.range.upperBound
return .ifelse(condition, body, else: Block(statements: [
Statement(type: statementType, range: range),
], range: range))
}
throw ParserError(.unexpectedToken(nextToken, expected: "else body"))
}
mutating func readSwitch() throws -> StatementType? {
guard readToken(.identifier("switch")) else {
return nil
}
let condition = try require(readExpression(), as: "condition")
try requireToken(.lbrace)
var cases = [CaseStatement]()
var statements = [Statement]()
var defaultCase: Block?
func closeCase() {
if let start = statements.first, let end = statements.last {
let block = Block(
statements: statements,
range: start.range.lowerBound ..< end.range.upperBound
)
if defaultCase != nil {
defaultCase = block
} else if var caseStatement = cases.last {
caseStatement.body = block
let range = caseStatement.range.lowerBound ..< end.range.upperBound
caseStatement.range = range
cases[cases.count - 1] = caseStatement
}
}
statements.removeAll()
}
loop: while let token = first {
switch token.type {
case .rbrace:
closeCase()
break loop
case .identifier("case"):
if defaultCase != nil {
break loop
}
closeCase()
let start = removeFirst()
try cases.append(CaseStatement(
pattern: require(readExpressions(), as: "pattern"),
body: Block(statements: [], range: start.range),
range: start.range
))
case .keyword(.else):
closeCase()
let start = removeFirst()
defaultCase = Block(statements: [], range: start.range)
case .linebreak:
removeFirst()
default:
if cases.isEmpty, defaultCase == nil {
throw ParserError(.unexpectedToken(
token, expected: "case statement"
))
}
try statements.append(require(readStatement(), as: "statement"))
}
}
try requireToken(.rbrace)
return .switchcase(condition, cases, else: defaultCase)
}
mutating func readOperand() throws -> Expression? {
let start = self
let token = readToken()
var range = token.range
let type: ExpressionType
switch token.type {
// TODO: should call be permitted here?
case .lparen, .call:
_ = readToken(.linebreak)
let expression = try readExpressions(allowLinebreaks: true) ??
Expression(
type: .tuple([]),
range: range.upperBound ..< nextToken.range.lowerBound
)
range = range.lowerBound ..< nextToken.range.upperBound
try requireToken(.rparen, as: expression.type == .tuple([]) ?
"expression" : TokenType.rparen.errorDescription)
switch expression.type {
case .tuple:
type = expression.type
default:
type = .tuple([expression])
}
case let .prefix(op):
let operand = try require(readOperand(), as: "operand")
range = range.lowerBound ..< operand.range.upperBound
type = .prefix(op, operand)
case let .number(number):
type = .number(number)
case let .string(string):
type = .string(string)
case let .hexColor(string):
type = .color(Color(hexString: string) ?? .black)
case let .identifier(name):
guard readToken(.call) else {
type = .identifier(name)
break
}
let expression = try readExpressions()
let endToken = nextToken
try requireToken(.rparen, as: "expression or \(TokenType.rparen.errorDescription)")
// repackage function syntax as a lisp-style subexpression
// TODO: should we support this as a distinct construct?
var expressions = [Expression(
type: .identifier(name),
range: range
)]
if let expression = expression {
if case let .tuple(params) = expression.type {
expressions += params
} else {
expressions.append(expression)
}
}
type = .tuple(expressions)
range = range.lowerBound ..< endToken.range.upperBound
case .keyword(.import):
type = try .import(require(readExpressions(), as: "file path"))
case .dot, .linebreak, .keyword, .infix, .lbrace, .lbracket,
.subscript, .rbrace, .rparen, .rbracket, .eof:
self = start
return nil
}
var expression = Expression(type: type, range: range)
loop: while true {
switch nextToken.type {
case .dot:
removeFirst()
let rhs = try require(readIdentifier(), as: "member name")
expression = Expression(
type: .member(expression, rhs),
range: range.lowerBound ..< rhs.range.upperBound
)
case .subscript:
removeFirst()
let rhs = try require(readExpression(), as: "expression")
try requireToken(.rbracket)
expression = Expression(
type: .subscript(expression, rhs),
range: range.lowerBound ..< rhs.range.upperBound
)
default:
break loop
}
}
return expression
}
mutating func readTerm() throws -> Expression? {
guard var lhs = try readOperand() else {
return nil
}
while case let .infix(op) = nextToken.type,
[.times, .divide, .modulo].contains(op)
{
removeFirst()
let rhs = try require(readOperand(), as: "operand")
lhs = Expression(
type: .infix(lhs, op, rhs),
range: lhs.range.lowerBound ..< rhs.range.upperBound
)
}
return lhs
}
mutating func readSum() throws -> Expression? {
guard var lhs = try readTerm() else {
return nil
}
while case let .infix(op) = nextToken.type, [.plus, .minus].contains(op) {
removeFirst()
let rhs = try require(readTerm(), as: "operand")
lhs = Expression(
type: .infix(lhs, op, rhs),
range: lhs.range.lowerBound ..< rhs.range.upperBound
)
}
return lhs
}
mutating func readRange() throws -> Expression? {
guard let lhs = try readSum() else {
return nil
}
guard case .identifier("to") = nextToken.type else {
return lhs
}
removeFirst()
let rhs = try require(readSum(), as: "end value")
return Expression(
type: .infix(lhs, .to, rhs),
range: lhs.range.lowerBound ..< rhs.range.upperBound
)
}
mutating func readStep() throws -> Expression? {
guard let lhs = try readRange() else {
return nil
}
guard case .identifier("step") = nextToken.type else {
return lhs
}
let start = self
removeFirst()
guard let rhs = try readSum() else {
self = start
return lhs
}
if case .identifier("step") = nextToken.type {
// TODO: should multiple step values actually be permitted?
// TODO: or is there a better error than "unexpected token"?
throw ParserError(.unexpectedToken(nextToken, expected: nil))
}
return Expression(
type: .infix(lhs, .step, rhs),
range: lhs.range.lowerBound ..< rhs.range.upperBound
)
}
mutating func readInRange() throws -> Expression? {
guard let lhs = try readStep() else {
return nil
}
if case let .infix(_, op, _) = lhs.type, [.to, .step].contains(op) {
return lhs
}
guard case .identifier("in") = nextToken.type else {
return lhs
}
removeFirst()
let rhs = try require(readStep(), as: "range")
return Expression(
type: .infix(lhs, .in, rhs),
range: lhs.range.lowerBound ..< rhs.range.upperBound
)
}
mutating func readComparison() throws -> Expression? {
let not = nextToken.type == .identifier("not") ? readToken() : nil
guard var lhs = try readInRange() else {
return not.map {
Expression(type: .identifier("not"), range: $0.range)
}
}
if case let .infix(op) = nextToken.type, [
.lt, .lte, .gt, .gte, .equal, .unequal,
].contains(op) {
removeFirst()
// TODO: should we allow chained comparison operators?
let not = nextToken.type == .identifier("not") ? readToken() : nil
var rhs = try require(readSum(), as: "operand")
if let not = not {
rhs = Expression(type: .tuple([
Expression(type: .identifier("not"), range: not.range),
rhs,
]), range: not.range.lowerBound ..< rhs.range.upperBound)
}
lhs = Expression(
type: .infix(lhs, op, rhs),
range: lhs.range.lowerBound ..< rhs.range.upperBound
)
}
return not.map {
let not = Expression(type: .identifier("not"), range: $0.range)
return Expression(
type: .tuple([not, lhs]),
range: $0.range.lowerBound ..< lhs.range.upperBound
)
} ?? lhs
}
mutating func readExpression() throws -> Expression? {
guard var lhs = try readComparison() else {
return nil
}
while case let .identifier(name) = nextToken.type,
let op = InfixOperator(rawValue: name),
[.and, .or].contains(op)
{
removeFirst()
let rhs = try require(readComparison(), as: "operand")
lhs = Expression(
type: .infix(lhs, op, rhs),
range: lhs.range.lowerBound ..< rhs.range.upperBound
)
}
return lhs
}
mutating func readExpressions(allowLinebreaks: Bool = false) throws -> Expression? {
var expressions = [Expression]()
while var expression = try readExpression() {
if case let .identifier(name) = expression.type, let block = try readBlock() {
let range = expression.range.lowerBound ..< block.range.upperBound
let identifier = Identifier(name: name, range: expression.range)
expression = Expression(type: .block(identifier, block), range: range)
}
expressions.append(expression)
if allowLinebreaks {
_ = readToken(.linebreak)
}
}
switch expressions.count {
case 0:
return nil
case 1:
return expressions[0]
default:
let range = expressions[0].range.lowerBound ..< expressions.last!.range.upperBound
return Expression(type: .tuple(expressions), range: range)
}
}
mutating func readStatementType() throws -> StatementType? {
if let statement = try readDefine() ?? readOption() ??
readForLoop() ?? readIfElse() ?? readSwitch()
{
return statement
}
let start = self
guard let identifier = readIdentifier() else {
return try readExpressions().map { .expression($0.type) }
}
if case let .function(type, _) = Symbols.all[identifier.name],
type.parameterType != .void, type.returnType != .void
{
// Not a command or read-only property getter
self = start
return try readExpressions().map { .expression($0.type) }
}
switch nextToken.type {
case .infix, .dot, .identifier, .lbrace:
self = start
guard let expression = try readExpressions() else {
return nil
}
switch expression.type {
case var .tuple(expressions) where expressions[0].type == .identifier(identifier.name):
expressions.removeFirst()
let expression: Expression
if expressions.count > 1 {
let range = expressions[0].range.lowerBound ..< expressions.last!.range.upperBound
expression = Expression(type: .tuple(expressions), range: range)
} else {
expression = expressions[0]
}
return .command(identifier, expression)
default:
return .expression(expression.type)
}
// TODO: should call and subscript be treated differently here?
case .number, .linebreak, .keyword, .hexColor, .prefix, .string,
.rbrace, .lparen, .call, .rparen, .lbracket, .rbracket, .subscript, .eof:
return try .command(identifier, readExpressions())
}
}
mutating func readStatement() throws -> Statement? {
let start = self
guard let type = try readStatementType() else {
return nil
}
let end = start[start.index(before: startIndex)]
let range = start.nextToken.range.lowerBound ..< end.range.upperBound
return Statement(type: type, range: range)
}
mutating func readStatements() throws -> [Statement] {
_ = readToken(.linebreak)
var statements = [Statement]()
while let statement = try readStatement() {
statements.append(statement)
switch nextToken.type {
case .linebreak:
removeFirst()
case .eof, .rbrace:
break
default:
throw ParserError(.unexpectedToken(nextToken, expected: nil))
}
}
return statements
}
}