-
Notifications
You must be signed in to change notification settings - Fork 54
/
gamma.cljc
2143 lines (1833 loc) · 70.9 KB
/
gamma.cljc
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
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
(ns meander.match.gamma
(:refer-clojure :exclude [compile find])
#?(:cljs (:require-macros [meander.match.gamma]))
(:require [#?(:clj clojure.core :cljs cljs.core) :as clojure]
[#?(:clj clojure.pprint :cljs cljs.pprint) :as pprint]
[clojure.set :as set]
[clojure.spec.alpha :as s]
[clojure.walk :as walk]
[clojure.zip :as zip]
[meander.matrix.gamma :as r.matrix]
[meander.syntax.gamma :as r.syntax]
[meander.util.gamma :as r.util])
#?(:clj
(:import (cljs.tagged_literals JSValue))
:cljs
(:import (goog.object))))
(def
^{:dynamic true
:doc ""}
*negating* false)
(defn negating?
"true if currently compiling a matrix dervied from a not pattern,
false otherwise."
[]
(true? *negating*))
(def
^{:dynamic true
:doc "The current collection context e.g. :vector, :seq, etc."}
*collection-context*)
(defn vector-context?
"true if the current value of *collect-context* is :vector."
[]
(= *collection-context* :vector))
(defn js-array-context?
"true if the current value of *collect-context* is :js-array."
[]
(= *collection-context* :js-array))
(defn take-form
"Form for taking n elements from target with respect to the current
value of *collection-context*."
[n target]
(cond
(vector-context?)
`(subvec ~target 0 (min (count ~target) ~n))
(js-array-context?)
`(.slice ~target 0 (min (.-length ~target) ~n))
:else
`(take ~n ~target)))
(defn drop-form
"Form for dropping n elements from target with respect to the
current value of *collection-context*."
[n target]
(cond
(vector-context?)
`(subvec ~target (min (count ~target) ~n))
(js-array-context?)
`(.slice ~target (min (.-length ~target) ~n))
:else
`(drop ~n ~target)))
(defn js-array-equals-form
"Form used to test if two arrays a and b are equal in
ClojureScript."
[a b]
`(goog.array/equals ~a ~b
(fn f# [a# b#]
(if (cljs.core/array? a#)
(goog.array/equals a# b# f#)
(= a# b#)))))
(defn gensym*
"Like gensym but adds additional meta data which can be used by the
match compiler."
{:private true}
([]
(with-meta (gensym) {::gensym? true}))
([prefix-string]
(with-meta (gensym prefix-string) {::gensym? true})))
(defn gensym?
"true if x is an internally generate gensym, false otherwise."
{:private true}
([x]
(and (symbol? x) (::gensym? (meta x)))))
(declare compile)
(s/def :meander.match.gamma.tree/action-node
(s/tuple #{:action} any?))
(s/def :meander.match.gamma.tree/bind-node
(s/tuple #{:bind} vector? :meander.match.gamma/tree))
(s/def :meander.match.gamma.tree/branch-node
(s/tuple #{:branch}
(s/coll-of :meander.match.gamma/tree
:kind vector?
:into [])))
(s/def :meander.match.gamma.tree/fail-node
(s/tuple #{:fail}))
(s/def :meander.match.gamma.tree/identitifer
simple-symbol?)
(s/def :meander.match.gamma.tree/loop-node
(s/tuple #{:loop}
:meander.match.gamma.tree/identitifer
(s/coll-of simple-symbol? :kind vector? :into [])
:meander.match.gamma/tree))
(s/def :meander.match.gamma.tree/save-node
(s/tuple #{:save}
:meander.match.gamma.tree/identitifer
:meander.match.gamma/tree
:meander.match.gamma/tree))
(s/def :meander.match.gamma.tree/load-node
(s/tuple #{:load}
:meander.match.gamma.tree/identitifer))
(s/def :meander.match.gamma.tree/pass-node
(s/tuple #{:pass} :meander.match.gamma/tree))
(s/def :meander.match.gamma.tree/recur-node
(s/tuple #{:recur}
:meander.match.gamma.tree/identitifer
(s/coll-of simple-symbol? :kind vector? :into [])))
(s/def :meander.match.gamma.tree/test-node
(s/tuple #{:test} any? :meander.match.gamma/tree))
(s/def :meander.match.gamma.tree/search-node
(s/tuple #{:search}
(s/tuple simple-symbol? any?)
:meander.match.gamma/tree))
(s/def :meander.match.gamma.tree/find-node
(s/tuple #{:find}
(s/tuple simple-symbol? any?)
:meander.match.gamma/tree))
(s/def :meander.match.gamma/tree
(s/or :action :meander.match.gamma.tree/action-node
:bind :meander.match.gamma.tree/bind-node
:branch :meander.match.gamma.tree/branch-node
:fail :meander.match.gamma.tree/fail-node
:find :meander.match.gamma.tree/find-node
:pass :meander.match.gamma.tree/pass-node
:load :meander.match.gamma.tree/load-node
:loop :meander.match.gamma.tree/loop-node
:recur :meander.match.gamma.tree/recur-node
:save :meander.match.gamma.tree/save-node
:search :meander.match.gamma.tree/search-node
:test :meander.match.gamma.tree/test-node))
(defn literal?
"true if node is ground and does not contain :map or :set subnodes,
false otherwise.
The constraint that node may not contain :map or :set subnodes is
due to the semantics of map and set patterns: they express submap
and subsets respectively. Compiling these patterns to literals as
part of an equality check would result in false negative matches.
See also: compile-ground"
[node]
(and (r.syntax/ground? node)
(not-any? (comp #{:map :set} r.syntax/tag)
(r.syntax/subnodes node))))
(defn solved?
"true if all logic variables occuring in node are bound in env and
node is free of memory variables, false otherwise."
[node env]
(if (r.syntax/ground? node)
true
(let [vars (r.syntax/variables node)]
(if (some r.syntax/mvr-node? vars)
false
(every? env vars)))))
(defn compile-ground
"Compile node as a literal if possible."
[node]
(case (r.syntax/tag node)
:cat
(map compile-ground (:elements node))
:jsa
#?(:clj
(JSValue. (vec (compile-ground (:prt node))))
:cljs
(into-array (compile-ground (:prt node))))
:lit
(r.syntax/unparse node)
:map
(into {}
(map (fn [[k v]]
[(compile-ground k)
(compile-ground v)]))
(:map node))
:prt
(concat (compile-ground (:left node))
(compile-ground (:right node)))
:unq
(:expr node)
:quo
(list 'quote (:form node))
:vec
(into [] (compile-ground (:prt node)))
:seq
(if-some [l (seq (compile-ground (:prt node)))]
(cons `list l)
())
:set
(into #{} (map compile-ground (:elements node)))))
(defn compile-with-memory-variables-initialized
{:private true}
[targets matrix]
(let [last-row (last matrix)]
(reduce
(fn [[matrix* all-mvrs] row]
(let [mvrs (r.syntax/memory-variables (first (:cols row)))
row* (assoc row :env mvrs)
all-mvrs* (set/union all-mvrs mvrs)
matrix** (conj matrix* row*)]
(if (= row last-row)
(reduce
(fn [tree mvr-node]
[:bind [(:symbol mvr-node) []]
tree])
(compile targets matrix**)
all-mvrs*)
[matrix** all-mvrs*])))
[[] #{}]
matrix)))
(defn specialize-matrix
"Retains rows of the matrix whose tag is tag or :any."
[tag matrix]
(into []
(keep-indexed
(fn [i node]
(let [other-tag (r.syntax/tag node)]
(when (or (= other-tag tag)
(= other-tag :any))
(nth matrix i)))))
(r.matrix/first-column matrix)))
(defmulti compile-specialized-matrix
"Compile the matrix specialized for tag with respect to targets to a
sequence of decision trees."
{:arglists '([tag targets matrix])}
(fn [tag targets matrix]
tag))
(s/fdef compile-specialized-matrix
:args (s/cat :tag keyword?
:targets (s/coll-of simple-symbol? :kind vector? :into [])
:matrix :meander.matrix.gamma/matrix)
:ret (s/coll-of :meander.match.gamma/tree))
(defmethod compile-specialized-matrix :app
[_ [target & targets*] matrix]
(let [app-target (gensym* "app_target__")]
(mapv
(fn [node row]
(case (r.syntax/tag node)
:any
[:pass (compile targets* [row])]
:app
[:bind [app-target `(~(:fn-expr node) ~target)]
(compile `[~app-target ~@targets*]
[(assoc row :cols `[~{:tag :cnj
:arguments (:arguments node)}
~@(:cols row)])])]))
(r.matrix/first-column matrix)
(r.matrix/drop-column matrix))))
(defmethod compile-specialized-matrix :cat
[_ [target & targets*] matrix]
(let [targets* (vec targets*)
max-size (reduce
(fn [n node]
(case (r.syntax/tag node)
:any n
:cat (max n (count (:elements node)))))
0
(r.matrix/first-column matrix))
nth-syms (mapv
(fn [i]
(gensym* (str "nth_" i "__")))
(range max-size))]
(mapv
(fn [node row]
(case (r.syntax/tag node)
:any
[:pass (compile targets* [row])]
:cat
(if (literal? node)
[:test (if (js-array-context?)
(js-array-equals-form target (compile-ground
{:tag :jsa
:prt {:tag :prt
:left node
:right {:tag :cat
:elements []}}}))
`(= ~target ~(vec (compile-ground node))))
(compile targets* [row])]
(let [elements (:elements node)
nth-syms (take (count elements) nth-syms)
targets* `[~@nth-syms ~@targets*]]
(reduce
(fn [tree [i nth-sym]]
[:bind [nth-sym `(nth ~target ~i)]
tree])
(compile targets* [(assoc row :cols `[~@elements ~@(:cols row)])])
(reverse (map-indexed vector nth-syms)))))))
(r.matrix/first-column matrix)
(r.matrix/drop-column matrix))))
(defmethod compile-specialized-matrix :cnj
[_ [target & targets*] matrix]
(let [max-args (reduce
(fn [n node]
(case (r.syntax/tag node)
:any n
:cnj (max n (count (:arguments node)))))
0
(r.matrix/first-column matrix))
targets* `[~@(repeat max-args target) ~@targets*]
matrix* (mapv
(fn [node row]
(case (r.syntax/tag node)
:any
(assoc row :cols `[~@(repeat max-args node) ~@(:cols row)])
:cnj
(let [arguments (:arguments node)]
(assoc row :cols `[~@arguments
~@(repeat (- max-args (count arguments))
{:tag :any, :symbol '_})
~@(:cols row)]))))
(r.matrix/first-column matrix)
(r.matrix/drop-column matrix))]
[(compile targets* matrix*)]))
(defmethod compile-specialized-matrix :ctn
[_ [target & targets*] matrix]
(mapv
(fn [node row]
(case (r.syntax/tag node)
:any
[:pass (compile targets* [row])]
:ctn
(let [context (:context node)
pattern (:pattern node)
;; Bound zipper location if :context supplied.
loc-sym (gensym* "loc__")
;; Bound to zipper node and tested against :pattern.
node-sym (gensym* "node__")
matrix* (as-> [row] %matrix
(if (some? context)
(r.matrix/prepend-column %matrix
[{:tag :let
:bindings
[{:binding context
:expr `(fn [x#]
(zip/root (zip/replace ~loc-sym x#)))}]}])
%matrix)
(r.matrix/prepend-column %matrix
[{:tag :let
:bindings [{:binding pattern
:expr node-sym}]}]))
targets* (as-> [node-sym] %targets
(if (some? context)
(conj %targets loc-sym))
(into %targets targets*))]
(if (some? context)
[:search [loc-sym `(r.util/zip-next-seq (r.util/coll-zip ~target))]
[:bind [node-sym `(zip/node ~loc-sym)]
(compile targets* matrix*)]]
[:search [node-sym `(tree-seq coll? seq ~target)]
(compile targets* matrix*)]))))
(r.matrix/first-column matrix)
(r.matrix/drop-column matrix)))
(defmethod compile-specialized-matrix :drp
[_ [target & targets*] matrix]
[(compile (vec targets*) (r.matrix/drop-column matrix))])
(defmethod compile-specialized-matrix :dsj
[_ targets matrix]
(let [matrix* (into []
(mapcat
(fn [node row]
(case (r.syntax/tag node)
:any
[(assoc row :cols `[~node ~@(:cols row)])]
:dsj
(map
(fn [argument]
(assoc row :cols `[~argument ~@(:cols row)]))
(:arguments node))))
(r.matrix/first-column matrix)
(r.matrix/drop-column matrix)))]
[(compile targets matrix*)]))
(defmethod compile-specialized-matrix :grd
[_ [target & targets*] matrix]
(let [targets* (vec targets*)]
(mapv
(fn [node row]
(case (r.syntax/tag node)
:any
[:pass
(compile targets* [row])]
:grd
[:test (:expr node)
(compile targets* [row])]))
(r.matrix/first-column matrix)
(r.matrix/drop-column matrix))))
(defmethod compile-specialized-matrix :jsa
[_ [target & targets* :as targets] matrix]
(mapv
(fn [node row]
(case (r.syntax/tag node)
:any
[:pass (compile targets [row])]
:jsa
(if (literal? node)
[:test (js-array-equals-form target (compile-ground node))
(compile targets* [row])]
[:test `(cljs.core/array? ~target)
(let [;; prt needs to be compiled within a :js-array
;; collection-context separately from the targets*
;; to the right. The targets* on the right need to
;; be compiled in an environment including variables
;; bound by compiling prt.
prt (:prt node)
rhs*-env (into (get row :env) (r.syntax/variables prt))
rhs*-row (assoc row :env rhs*-env)
rhs* (compile targets* [rhs*-row])
row* (assoc row :cols [prt] :rhs rhs*)]
(binding [*collection-context* :js-array]
(compile [target] [row*])))])))
(r.matrix/first-column matrix)
(r.matrix/drop-column matrix)))
(defn jso-matrix-all-keys
"Return a sequence of all :jso keys in matrix."
{:private true}
[matrix]
(mapcat
(fn [node]
(case (r.syntax/tag node)
:jso
(keys (:object node))
()))
(r.matrix/first-column matrix)))
(defn rank
"Returns a sorted sequence of values in xs by frequency of
occurence."
{:private true}
[xs]
(map first (sort-by (comp - val) (frequencies xs))))
(defmethod compile-specialized-matrix :jso
[_ [target & targets*] matrix]
(let [ranked-keys (rank (jso-matrix-all-keys matrix))]
;; Recompile with object keys aligned. For example if the pattern
;; conditions were
;;
;; #js {:x ?1, :y ?2, :z ?3}
;; #js {:x ?1}
;; #js {:w ?2, :z ?3}
;;
;; then we would organize the matrix as
;;
;; [:x ?1] [:z ?3] [:y ?2] [:w __]
;; [:x ?1] [:z __] [:y __] [:w __]
;; [:x __] [:z ?3] [:y __] [:w ?2]
[[:test `(some? ~target) ;; This may be a bit liberal.
(compile `[~@(repeat (count ranked-keys) target) ~@targets*]
(mapv
(fn [row]
(let [[node & rest-nodes] (get row :cols)]
(case (r.syntax/tag node)
:jso
(let [object (:object node)
prefix (mapv
(fn [key-node]
(if-some [entry (clojure/find object key-node)]
{:tag :okv
:entry entry}
{:tag :okv
:entry [key-node {:tag :any
:symbol '_}]}))
ranked-keys)]
(assoc row :cols `[~@prefix ~@rest-nodes]))
row)))
matrix))]]))
(defmethod compile-specialized-matrix :okv
[_ [target & targets* :as targets] matrix]
(let [targets* (vec targets*)]
(mapv
(fn [node row]
(case (r.syntax/tag node)
:any
[:pass (compile targets* [row])]
:okv
(let [entry (:entry node)
[key-node val-node] entry]
(if (r.syntax/ground? key-node)
(let [row* (assoc row :cols `[~{:tag :let*
:binding val-node
:expr (list 'js* "(~{}[~{}])" target (compile-ground key-node))}
~@(:cols row)])]
(compile targets [row*]))
;; The #js {} reader only allows keys that are strings or
;; unqualified keywords. Without and alternative notation
;; this branch should never be entered.
(let [row* (assoc row :cols `[~{:tag :cat
:elements [key-node val-node]}
~@(:cols row)])
search-target (gensym* "okv__")]
[:search [search-target `(map (fn [k#]
[k# (goog.object/get ~target k#)])
(goog.object/getKeys ~target))]
(compile `[~search-target ~@targets*] [row*])])))))
(r.matrix/first-column matrix)
(r.matrix/drop-column matrix))))
(defmethod compile-specialized-matrix :let*
[_ [target & targets* :as targets] matrix]
(let [targets* (vec targets*)]
(mapv
(fn [node row]
(case (r.syntax/tag node)
:any
[:pass (compile targets* [row])]
:let*
(let [xsym (gensym* "x__")
targets* `[~xsym ~@targets*]
matrix* [(assoc row :cols `[~(:binding node) ~@(:cols row)])]]
[:bind [xsym (:expr node)]
(compile targets* matrix*)])))
(r.matrix/first-column matrix)
(r.matrix/drop-column matrix))))
(defmethod compile-specialized-matrix :let
[_ targets matrix]
[(compile targets
(r.matrix/prepend-column
(r.matrix/drop-column matrix)
(mapv
(fn [node]
(case (r.syntax/tag node)
:let
{:tag :cnj
:arguments (map
(fn [binding]
{:tag :let*
:binding (:binding binding)
:expr (:expr binding)})
(:bindings node))}
node))
(r.matrix/first-column matrix))))])
(defmethod compile-specialized-matrix :lit
[_ [target & targets*] matrix]
(let [targets* (vec targets*)]
(mapv
(fn [node row]
(case (r.syntax/tag node)
:any
[:pass (compile targets* [row])]
:lit
[:test `(= ~target ~(r.syntax/unparse node))
(compile targets* [row])]))
(r.matrix/first-column matrix)
(r.matrix/drop-column matrix))))
(defmethod compile-specialized-matrix :lvr
[_ [target & targets*] matrix]
(let [targets* (vec targets*)]
(mapv
(fn [node row]
(case (r.syntax/tag node)
:any
[:pass (compile targets* [row])]
:lvr
(if (r.matrix/get-var row node)
[:test `(= ~target ~(:symbol node))
(compile targets* [row])]
[:bind [(:symbol node) target]
(compile targets* [(r.matrix/add-var row node)])])))
(r.matrix/first-column matrix)
(r.matrix/drop-column matrix))))
(defmethod compile-specialized-matrix :map
[_ [target & targets*] matrix]
(let [all-keys (mapcat
(fn [node]
(when (= (r.syntax/tag node) :map)
(keys (:map node))))
(r.matrix/first-column matrix))
key-sort (sort-by
(comp - (frequencies all-keys))
(distinct all-keys))
num-keys (count key-sort)
matrix* (mapv
(fn [node row]
(case (r.syntax/tag node)
:any
(assoc row :cols `[~@(repeat num-keys node) ~@(:cols row)])
:map
(let [the-map (:map node)]
(if (and (r.syntax/search? node)
(some r.syntax/variable-node? (keys the-map)))
(let [set-node {:tag :set
:elements (map
(fn [[k-node v-node]]
{:tag :cat
:elements [k-node v-node]})
the-map)}
let-node {:tag :let*
:binding set-node
:expr `(set ~target)}]
(assoc row :cols `[~let-node
~@(repeat (dec num-keys)
'{:tag :any
:symbol _})
~@(:cols row)]))
(let [new-cols (sort-by
(fn [node]
(if (= (r.syntax/tag node) :mkv)
0
1))
(map
(fn [key]
(if-some [entry (clojure/find the-map key)]
{:tag :mkv
:entry entry}
{:tag :any
:symbol '_}))
key-sort))]
(assoc row :cols `[~@new-cols ~@(:cols row)]))))))
(r.matrix/first-column matrix)
(r.matrix/drop-column matrix))]
[[:test `(map? ~target)
(compile `[~@(repeat num-keys target) ~@targets*] matrix*)]]))
(defmethod compile-specialized-matrix :mkv
[_ [target & targets* :as targets] matrix]
(let [targets* (vec targets*)]
(mapv
(fn [node row]
(case (r.syntax/tag node)
:any
[:pass (compile targets* [row])]
:mkv
(let [[key-node val-node] (:entry node)
row* (assoc row :cols `[~{:tag :let*
:binding val-node
:expr `(get ~target ~(compile-ground key-node))}
~@(:cols row)])]
(compile targets [row*]))))
(r.matrix/first-column matrix)
(r.matrix/drop-column matrix))))
(defmethod compile-specialized-matrix :mvr
[_ [target & targets*] matrix]
(let [targets* (vec targets*)]
(mapv
(fn [node row]
(case (r.syntax/tag node)
:any
[:pass (compile targets* [row])]
:mvr
(let [sym (:symbol node)]
(if (r.matrix/get-var row node)
(let [save-id (gensym "save__")]
;; :save/:load is necessary here since it is possible
;; for the state of a memory variable to persist
;; even after a match failure.
[:save save-id
[:bind [sym `(conj ~sym ~target)]
(compile targets* [row])]
[:load save-id]])
[:bind [sym [target]]
(compile targets* [(r.matrix/add-var row node)])]))))
(r.matrix/first-column matrix)
(r.matrix/drop-column matrix))))
(defmethod compile-specialized-matrix :not
[_ [target & targets*] matrix]
(let [targets* (vec targets*)]
(mapv
(fn [node row]
(case (r.syntax/tag node)
:any
[:pass (compile targets* [row])]
:not
(let [save-id (gensym "save__")
not-matrix [{:cols [(:argument node)]
:env (:env row),
:rhs [:load save-id]}]]
[:save save-id
(binding [*negating* true]
(compile [target] not-matrix))
(compile targets* [row])])))
(r.matrix/first-column matrix)
(r.matrix/drop-column matrix))))
(defmethod compile-specialized-matrix :prt
[_ [target & targets* :as targets] matrix]
(let [targets* (vec targets*)]
(mapv
(fn [node row]
(case (r.syntax/tag node)
:any
[:pass (compile targets* [row])]
:prt
(let [{:keys [left right]} node
right (if (some? right)
right
{:tag :cat
:elements []})
;; Left tree symbol
lsym (gensym* "l__")
;; Left min length
llen (r.syntax/min-length left)
;; Right tree symbol
rsym (gensym* "r__")
;; Right min length
rlen (r.syntax/min-length right)
;; Target length symbol
nsym (gensym "n__")
;; Target length symbol minus either the left or right min length
msym (gensym* "m__")]
(case [(r.syntax/variable-length? left) (r.syntax/variable-length? right)]
;; Invariable length.
[false false]
(cond
(and (zero? llen)
(zero? rlen))
[:test `(not (seq ~target))
(compile targets [row])]
(zero? llen)
[:test `(= (bounded-count ~(inc rlen) ~target) ~rlen)
(compile targets [(assoc row :cols `[~right ~@(:cols row)])])]
(zero? rlen)
[:test `(= (bounded-count ~(inc llen) ~target) ~llen)
(compile targets [(assoc row :cols `[~left ~@(:cols row)])])]
:else
[:bind [lsym (take-form llen target)]
[:test `(= (count ~lsym) ~llen)
[:bind [rsym (drop-form llen target)]
[:test `(= (count ~rsym) ~rlen)
(compile `[~lsym ~rsym ~@targets*]
[(assoc row :cols `[~left ~right ~@(:cols row)])])]]]])
;; Variable length on the right.
[false true]
[:bind [lsym (take-form llen target)]
[:test (if (zero? llen)
`(not (seq ~lsym))
`(= (count ~lsym) ~llen))
[:bind [rsym (drop-form llen target)]
(compile `[~lsym ~rsym ~@targets*]
[(assoc row :cols `[~left ~right ~@(:cols row)])])]]]
;; Variable length on the left.
[true false]
(if (zero? rlen)
(compile targets [(assoc row :cols `[~left ~@(:cols row)])])
[:bind [nsym `(count ~target)]
[:bind [msym `(max 0 (- ~nsym ~rlen))]
[:bind [lsym (take-form msym target)]
[:bind [rsym (drop-form msym target)]
[:test (if (zero? rlen)
`(not (seq ~rsym))
`(= (count ~rsym) ~rlen))
(compile `[~lsym ~rsym ~@targets*]
[(assoc row :cols `[~left ~right ~@(:cols row)])])]]]]])
;; Variable length on both sides.
[true true]
(let [parts-sym (gensym* "parts__")]
[:search [parts-sym `(r.util/partitions 2 ~target)]
[:bind [lsym `(nth ~parts-sym 0)]
[:bind [rsym `(nth ~parts-sym 1)]
(compile `[~lsym ~rsym ~@targets*]
[(assoc row :cols `[~left ~right ~@(:cols row)])])]]])))))
(r.matrix/first-column matrix)
(r.matrix/drop-column matrix))))
(defmethod compile-specialized-matrix :prd
[_ [target & targets* :as targets] matrix]
(let [targets* (vec targets*)]
(mapv
(fn [node row]
(case (r.syntax/tag node)
:any
[:pass (compile targets* [row])]
:prd
(let [arguments (:arguments node)]
[:test `(~(:form node) ~target)
(if (seq arguments)
(compile targets [(assoc row :cols `[~{:tag :cnj
:arguments arguments}
~@(:cols row)])])
(compile targets* [row]))])))
(r.matrix/first-column matrix)
(r.matrix/drop-column matrix))))
(defmethod compile-specialized-matrix :quo
[_ [target & targets*] matrix]
(let [targets* (vec targets*)]
(mapv
(fn [node row]
(case (r.syntax/tag node)
:any
[:pass (compile targets* [row])]
:quo
[:test `(= ~target ~(r.syntax/unparse node))
(compile targets* [row])]))
(r.matrix/first-column matrix)
(r.matrix/drop-column matrix))))
(defmethod compile-specialized-matrix :rxt
[_ [target & targets*] matrix]
(let [targets* (vec targets*)]
(mapv
(fn [node row]
(case (r.syntax/tag node)
:any
[:pass (compile targets* [row])]
:rxt
[:test `(string? ~target)
[:test `(re-matches ~(:regex node) ~target)
(compile targets* [row])]]))
(r.matrix/first-column matrix)
(r.matrix/drop-column matrix))))
(defmethod compile-specialized-matrix :rxc
[_ [target & targets*] matrix]
(let [targets* (vec targets*)]
(mapv
(fn [node row]
(case (r.syntax/tag node)
:any
[:pass (compile targets* [row])]
:rxc
(let [ret-sym (gensym* "ret__")
cols* `[~(:capture node) ~@(:cols row)]
row* (assoc row :cols cols*)]
[:test `(string? ~target)
[:bind [ret-sym `(re-matches ~(:regex node) ~target)]
[:test `(some? ~ret-sym)
(compile `[~ret-sym ~@targets*] [row*])]]])))
(r.matrix/first-column matrix)
(r.matrix/drop-column matrix))))
(defmethod compile-specialized-matrix :rp*
[_ [target & targets*] matrix]
(let [targets* (vec targets*)]
(mapv
(fn [node row]
(case (r.syntax/tag node)
:any
[:pass (compile targets* [row])]
:rp*
(let [elements (:elements node)
n (count elements)
;; Symbol which is bound to the first n elements of
;; target at the top of each loop.
init (gensym* "init__")
;; Gaurd pattern to check the length of the initial
;; slice at the top of each loop.
init-grd {:tag :grd
:expr `(= (count ~init) ~n)}
;; The sequence to match.
init-cat {:tag :cat
:elements elements}
;; Unbound memory variables must be bound before loop
;; execution and added to the compilation environment
;; for the internal loop body.
init-mvrs (keep
(fn [node]
(when (and (= (r.syntax/tag node) :mvr)
(not (r.matrix/get-var row node)))
node))
(r.syntax/variables init-cat))
env* (into (:env row) init-mvrs)