-
Notifications
You must be signed in to change notification settings - Fork 11
/
STD.pm
3876 lines (3192 loc) · 107 KB
/
STD.pm
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
grammar STD:ver<6.0.0.alpha>:auth<http://perl.org>;
my $LANG is context;
my $PKGDECL is context = "";
my $PKG is context = "";
my @PKGS;
my $GOAL is context = "(eof)";
my $PARSER is context<rw>;
my $IN_DECL is context<rw>;
# random rule for debugging, please ignore
token foo {
'foo' 'bar' 'baz'
}
=begin things todo
add more suppositions and figure out exact error continuation semantics
think about longest-token-defeating {*} that maybe should be <?{ {*}; 1}>
add parsing this file to sanity tests :)
evaluate "is context<rw>" for reentrancy brokenness
=end things todo
=begin comment overview
This file is designed to be either preprocessed into a grammar with
action statements or used as-is without any preprocessing. The {*}
notation is a no-op action block, but can be identified uniquely via a
combination of the preceding token or rule name plus any additional text
following a #= comment. We put this into a comment rather than using
a macro so that bootstrap compilers don't have to worry about macros
yet, and to keep the main grammar relatively uncluttered by action
statements. Note that the preprocessor can certainly generate accesses
to the match state within the action block, so we need not mention it
explicitly.
Also, some rules are named by syntactic category plus an additonal symbol
specified in adverbial form, either in bare :name form or in :sym<name>
form. (It does not matter which form you use for identifier symbols,
except that to specify a symbol "sym" you must use the :sym<sym> form
of adverb.) If you use the <sym> rule within the rule, it will parse the
symbol at that point. At the final reduction point of a rule, if $sym
has been set, that is used as the final symbol name for the rule. This
need not match the symbol specified as part the rule name; that is just
for disambiguating the name. However, if no $sym is set, the original
symbol will be used by default.
Note that rules with only one action need no #= comment, so the identifier
of the following stub is just "TOP".
Another nod toward preprocessing is that blocks that contain nested braces
are delimited by double braces so that the preprocessor does not need to
understand Perl 6 code.
This grammar also assumes transitive longest-token semantics, though
we make a feeble attempt to order rules so a procedural interpretation
of alternation can usually produce a correct parse. (This will tend
to become less true over time.)
=end comment overview
method TOP ($STOP = undef) {
if defined $STOP {
my $GOAL is context = $STOP;
self.unitstop($STOP).comp_unit;
}
else {
self.comp_unit;
}
}
# XXX shouldn't need this, it should all be defined/imported by the prelude
my @typenames = qw[
Object Any Junction Whatever
Capture Match Signature
Package Module Class Role Grammar
Scalar Array Hash KeyHash KeySet KeyBag
Pair List Seq Range Set Bag Mapping
Void Undef Failure Exception
Code Block Routine Sub Macro
Method Submethod Regex
Str Blob
Char Byte Codepoint Grapheme StrPos StrLen Version
Num Complex
num complex
Int int int1 int2 int4 int8 int16 int32 int64
Rat rat rat1 rat2 rat4 rat8 rat16 rat32 rat64
UInt uint uint1 uint2 uint4 uint8 uint16 uint32 uint64
Buf buf buf1 buf2 buf4 buf8 buf16 buf32 buf64
Bit Bool True False
bit bool
Order Increasing Decreasing
Ordered Callable Positional Associatve
Ordering KeyExtractor Comparator OrderingPair
IO
KitchenSink
];
my %typenames;
%typenames{@typenames} = (1 xx @typenames);
method is_type ($name) {
return True if %typenames{$name};
#return True if GLOBAL::{$name}.:exists;
return False;
}
method add_type ($longname) {
my $shortname = $longname.<name>.text;
my $typename = main::mangle($shortname);
my $qualname = ($+PKG // 'GLOBAL') ~ '::' ~ $typename;
%typenames{$typename} = $qualname;
%typenames{$qualname} = $qualname;
%typenames{$shortname} = $qualname;
}
# The internal precedence levels are *not* part of the public interface.
# The current values are mere implementation; they may change at any time.
# Users should specify precedence only in relation to existing levels.
constant %term = (:prec<z=>);
constant %methodcall = (:prec<y=>);
constant %autoincrement = (:prec<x=>);
constant %exponentiation = (:prec<w=>, :assoc<right>, :assign);
constant %symbolic_unary = (:prec<v=>);
constant %multiplicative = (:prec<u=>, :assoc<left>, :assign);
constant %additive = (:prec<t=>, :assoc<left>, :assign);
constant %replication = (:prec<s=>, :assoc<left>, :assign);
constant %concatenation = (:prec<r=>, :assoc<left>, :assign);
constant %junctive_and = (:prec<q=>, :assoc<list>, :assign);
constant %junctive_or = (:prec<p=>, :assoc<list>, :assign);
constant %named_unary = (:prec<o=>);
constant %nonchaining = (:prec<n=>, :assoc<non>);
constant %chaining = (:prec<m=>, :assoc<chain>, :bool);
constant %tight_and = (:prec<l=>, :assoc<left>, :assign);
constant %tight_or = (:prec<k=>, :assoc<left>, :assign);
constant %conditional = (:prec<j=>, :assoc<right>);
constant %item_assignment = (:prec<i=>, :assoc<right>);
constant %loose_unary = (:prec<h=>);
constant %comma = (:prec<g=>, :assoc<list>, :nextterm<nulltermish>);
constant %list_infix = (:prec<f=>, :assoc<list>, :assign);
constant %list_assignment = (:prec<i=>, :sub<e=>, :assoc<right>);
constant %list_prefix = (:prec<e=>);
constant %loose_and = (:prec<d=>, :assoc<left>, :assign);
constant %loose_or = (:prec<c=>, :assoc<left>, :assign);
constant %feed_infix = (:prec<b=>, :assoc<left>);
constant %LOOSEST = (:prec<a=!>);
constant %terminator = (:prec<a=>, :assoc<list>);
# "epsilon" tighter than terminator
#constant $LOOSEST = %LOOSEST<prec>;
constant $LOOSEST = "a=!"; # XXX preceding line is busted
role PrecOp {
# This is hopefully called on a match to mix in operator info by type.
method coerce (Match $m) {
# $m but= ::?CLASS;
my $var = self.WHAT ~ '::o';
my $d = %::($var);
if not $d<transparent> {
for keys(%$d) { $m<O>{$_} = $d.{$_} };
$m.deb("coercing to " ~ self) if $*DEBUG +& DEBUG::EXPR;
}
return $m;
}
} # end role
class Hyper does PrecOp {
our %o = (:transparent);
} # end class
class Term does PrecOp {
our %o = %term;
} # end class
class Methodcall does PrecOp {
our %o = %methodcall;
} # end class
class Autoincrement does PrecOp {
our %o = %autoincrement;
} # end class
class Exponentiation does PrecOp {
our %o = %exponentiation;
} # end class
class Symbolic_unary does PrecOp {
our %o = %symbolic_unary;
} # end class
class Multiplicative does PrecOp {
our %o = %multiplicative;
} # end class
class Additive does PrecOp {
our %o = %additive;
} # end class
class Replication does PrecOp {
our %o = %replication;
} # end class
class Concatenation does PrecOp {
our %o = %concatenation;
} # end class
class Junctive_and does PrecOp {
our %o = %junctive_and;
} # end class
class Junctive_or does PrecOp {
our %o = %junctive_or;
} # end class
class Named_unary does PrecOp {
our %o = %named_unary;
} # end class
class Nonchaining does PrecOp {
our %o = %nonchaining;
} # end class
class Chaining does PrecOp {
our %o = %chaining;
} # end class
class Tight_and does PrecOp {
our %o = %tight_and;
} # end class
class Tight_or does PrecOp {
our %o = %tight_or;
} # end class
class Conditional does PrecOp {
our %o = %conditional;
} # end class
class Item_assignment does PrecOp {
our %o = %item_assignment;
} # end class
class Loose_unary does PrecOp {
our %o = %loose_unary;
} # end class
class Comma does PrecOp {
our %o = %comma;
} # end class
class List_infix does PrecOp {
our %o = %list_infix;
} # end class
class List_assignment does PrecOp {
our %o = %list_assignment;
} # end class
class List_prefix does PrecOp {
our %o = %list_prefix;
} # end class
class Loose_and does PrecOp {
our %o = %loose_and;
} # end class
class Loose_or does PrecOp {
our %o = %loose_or;
} # end class
class Feed_infix does PrecOp {
our %o = %feed_infix;
} # end class
class Terminator does PrecOp {
our %o = %terminator;
} # end class
# Categories are designed to be easily extensible in derived grammars
# by merely adding more rules in the same category. The rules within
# a given category start with the category name followed by a differentiating
# adverbial qualifier to serve (along with the category) as the longer name.
# The endsym context, if specified, says what to implicitly check for in each
# rule right after the initial <sym>. Normally this is used to make sure
# there's appropriate whitespace. # Note that endsym isn't called if <sym>
# isn't called.
my $endsym is context = "null";
my $endargs is context = -1;
proto token category { <...> }
token category:category { <sym> }
token category:sigil { <sym> }
proto token sigil { <...> }
token category:twigil { <sym> }
proto token twigil { <...> }
token category:special_variable { <sym> }
proto token special_variable { <...> }
token category:version { <sym> }
proto token version { <...> }
token category:module_name { <sym> }
proto token module_name { <...> }
token category:term { <sym> }
proto token term { <...> }
token category:quote { <sym> }
proto token quote () { <...> }
token category:prefix { <sym> }
proto token prefix is unary is defequiv(%symbolic_unary) { <...> }
token category:infix { <sym> }
proto token infix is binary is defequiv(%additive) { <...> }
token category:postfix { <sym> }
proto token postfix is unary is defequiv(%autoincrement) { <...> }
token category:dotty { <sym> }
proto token dotty (:$endsym is context = 'unspacey') { <...> }
token category:circumfix { <sym> }
proto token circumfix { <...> }
token category:postcircumfix { <sym> }
proto token postcircumfix is unary { <...> } # unary as far as EXPR knows...
token category:quote_mod { <sym> }
proto token quote_mod { <...> }
token category:trait_verb { <sym> }
proto token trait_verb (:$endsym is context = 'spacey') { <...> }
token category:trait_auxiliary { <sym> }
proto token trait_auxiliary (:$endsym is context = 'spacey') { <...> }
token category:type_declarator { <sym> }
proto token type_declarator () { <...> }
token category:scope_declarator { <sym> }
proto token scope_declarator () { <...> }
token category:package_declarator { <sym> }
proto token package_declarator () { <...> }
token category:multi_declarator { <sym> }
proto token multi_declarator () { <...> }
token category:routine_declarator { <sym> }
proto token routine_declarator () { <...> }
token category:regex_declarator { <sym> }
proto token regex_declarator () { <...> }
token category:statement_prefix { <sym> }
proto rule statement_prefix () { <...> }
token category:statement_control { <sym> }
proto rule statement_control (:$endsym is context = 'spacey') { <...> }
token category:statement_mod_cond { <sym> }
proto rule statement_mod_cond () { <...> }
token category:statement_mod_loop { <sym> }
proto rule statement_mod_loop () { <...> }
token category:infix_prefix_meta_operator { <sym> }
proto token infix_prefix_meta_operator is binary { <...> }
token category:infix_postfix_meta_operator { <sym> }
proto token infix_postfix_meta_operator ($op) is binary { <...> }
token category:infix_circumfix_meta_operator { <sym> }
proto token infix_circumfix_meta_operator is binary { <...> }
token category:postfix_prefix_meta_operator { <sym> }
proto token postfix_prefix_meta_operator is unary { <...> }
token category:prefix_postfix_meta_operator { <sym> }
proto token prefix_postfix_meta_operator is unary { <...> }
token category:prefix_circumfix_meta_operator { <sym> }
proto token prefix_circumfix_meta_operator is unary { <...> }
token category:terminator { <sym> }
proto token terminator { <...> }
token unspacey { <.unsp>? }
token spacey { <?before \s | '#'> }
# Lexical routines
token ws {
# XXX exists is a p5ism
:my @stub = return self if exists self.<_>[self.pos]<ws>;
:my $startpos = self.pos;
[
| \h+ <![#\s\\]> { $¢.<_>[$¢.pos]<ws> = $startpos; } # common case
| <?before \w> <?after \w> :::
{ $¢.<_>[$startpos]<ws> = undef; }
<!> # must \s+ between words
]
||
[
| <.unsp>
| <.vws> <.heredoc>
| <.unv>
| $ { $¢.moreinput }
]*
{ $¢.<_>[$¢.pos]<ws> =
$¢.pos == $startpos
?? undef
!! $startpos;
}
}
token unsp {
\\ <?before [\s|'#'] >
[
| <.vws> {*} #= vwhite
| <.unv> {*} #= unv
| $ { $¢.moreinput }
]*
}
token vws {
\v ::
{ $COMPILING::LINE++ } # XXX wrong several ways, use self.lineof($¢.pos)
[ '#DEBUG -1' { say "DEBUG"; $STD::DEBUG = $*DEBUG = -1; } ]?
}
# We provide two mechanisms here:
# 1) define $+moreinput, or
# 2) override moreinput method
method moreinput () {
$+moreinput.() if $+moreinput;
}
token unv {
| \h+ {*} #= hwhite
| <?before '='> ^^ :: <.pod_comment> {*} #= pod
| \h* '#' :: [
| <?opener> ::
[ <!after ^^ . > || <.panic: "Can't use embedded comments in column 1"> ]
<.quibble($¢.cursor_fresh( ::STD::Q ))> {*} #= embedded
| :: \N* {*} #= end
]
}
token identifier {
<.alpha> \w*
}
token apostrophe {
<[ ' \- ]>
}
token ident {
<.identifier> [ <.apostrophe> <.identifier> ]*
}
# XXX We need to parse the pod eventually to support $= variables.
token pod_comment {
^^ '=' <.unsp>?
[
| 'begin' \h+ <ident> :: .*?
"\n=" <.unsp>? 'end' \h+ $<ident> » \N* {*} #= tagged
| 'begin' » :: \h* \n .*?
"\n=" <.unsp>? 'end' » \N* {*} #= anon
| ::
[ <?before .*? ^^ '=cut' » > <.panic: "Obsolete pod format, please use =begin/=end instead"> ]?
\N* {*} #= misc
]
}
# Top-level rules
# Note: we only check for the stopper. We don't check for ^ because
# we might be embedded in something else.
rule comp_unit {
:my $begin_compunit is context = 1;
:my $endargs is context<rw> = -1;
<statementlist>
[ <?unitstopper> || <.panic: "Can't understand next input--giving up"> ]
}
# Note: because of the possibility of placeholders we can't determine arity of
# the block syntactically, so this must be determined via semantic analysis.
# Also, pblocks used in an if/unless statement do not treat $_ as a placeholder,
# while most other blocks treat $_ as equivalent to $^x. Therefore the first
# possible place to check arity is not here but in the rule that calls this
# rule. (Could also be done in a later pass.)
token pblock {
[ <lambda> <signature> ]? <block>
}
token lambda { '->' | '<->' }
# Look for an expression followed by a required lambda.
token xblock {
:my $GOAL is context = '{';
<EXPR>
<.ws>
<pblock>
}
token block {
'{' <in: '}', 'statementlist', 'block'>
[
| <?before \h* $$> <.ws> # (usual case without comments)
{ $¢.<_>[$¢.pos]<endstmt> = 2; } {*} #= endstmt simple
| \h* <.unsp>? <?before <[,:]>> {*} #= normal
| <.unv>? $$ <.ws>
{ $¢.<_>[$¢.pos]<endstmt> = 2; } {*} #= endstmt complex
| {*} { $¢.<_>[$¢.pos]<endargs> = 1; } #= endargs
]
}
token regex_block {
:my $lang = ::Regex;
:my $GOAL is context = '}';
[ <quotepair> <.ws>
{
my $kv = $<quotepair>[*-1];
$lang = $lang.tweak($kv.<k>, $kv.<v>)
or self.panic("Unrecognized adverb :" ~ $kv.<k> ~ '(' ~ $kv.<v> ~ ')');
}
]*
'{'
<nibble( $¢.cursor_fresh($lang).unbalanced('}') )>
[ '}' || <.panic: "Unable to parse regex; couldn't find right brace"> ]
[
| <?before \h* $$> <.ws> # (usual case without comments)
{ $¢.<_>[$¢.pos]<endstmt> = 2; } {*} #= endstmt simple
| \h* <.unsp>? <?before <[,:]>> {*} #= normal
| <.unv>? $$ <.ws>
{ $¢.<_>[$¢.pos]<endstmt> = 2; } {*} #= endstmt complex
| {*} { $¢.<_>[$¢.pos]<endargs> = 1; } #= endargs
]
}
# statement semantics
rule statementlist {
:my $PARSER is context<rw> = self;
[
| $
| <?before <[\)\]\}]> >
| [<statement><.eat_terminator> ]*
]
}
# embedded semis, context-dependent semantics
rule semilist {
[
| <?before <[\)\]\}]> >
| [<statement><.eat_terminator> ]*
]
}
token label {
<ident> ':' <?before \s> <.ws>
[ <?{ $¢.is_type($<ident>.text) }>
<.panic("You tried to use an existing typename as a label")>
# <suppose("You tried to use an existing name $/{'ident'} as a label")>
]?
# add label as a pseudo type
# {{ eval 'COMPILING::{"::$<ident>"} = Label.new($<ident>)' }} # XXX need statement ref too?
}
token statement {
:my $endargs is context = -1;
<!before <[\)\]\}]> >
# this could either be a statement that follows a declaration
# or a statement that is within the block of a code declaration
<!!{ bless $¢, ref $PARSER; }>
[
| <label> <statement> {*} #= label
| <statement_control> {*} #= control
| <EXPR> {*} #= expr
[
|| <?{ ($¢.<_>[$¢.pos]<endstmt> // 0) == 2 }> # no mod after end-line curly
||
[
| <statement_mod_loop> {*} #= mod loop
| <statement_mod_cond> {*} #= mod cond
[
|| <?{ ($¢.<_>[$¢.pos]<endstmt> // 0) == 2 }>
|| <statement_mod_loop>? {*} #= mod condloop
]
]?
]
{*} #= modexpr
| <?before ';'> {*} #= null
]
}
token eat_terminator {
[
|| ';'
|| <?{ $¢.<_>[$¢.pos]<endstmt> }>
|| <?before <terminator>>
|| $
|| {{ if $¢.<_>[$¢.pos]<ws> { $¢.pos = $¢.<_>[$¢.pos]<ws>; } }} # undo any line transition
<.panic: "Syntax error">
]
}
rule statement_control:use {\
<sym>
[
| <version>
| <module_name><arglist>?
{{
my $longname = $<module_name><longname>;
$¢.add_type($longname);
}}
]
}
rule statement_control:no {\
<sym>
<module_name><arglist>?
}
rule statement_control:if {\
<sym>
<xblock>
$<elsif> = (
'elsif'<?spacey> <xblock> {*} #= elsif
)*
$<else> = (
'else'<?spacey> <pblock> {*} #= else
)?
}
rule statement_control:unless {\
<sym>
<xblock>
[ <!before 'else'> || <.panic: "unless does not take \"else\" in Perl 6; please rewrite using \"if\""> ]
}
rule statement_control:while {\
<sym>
[ <?before '(' ['my'? '$'\w+ '=']? '<' '$'?\w+ '>' ')'> #'
<.panic: "This appears to be Perl 5 code"> ]?
<xblock>
}
rule statement_control:until {\
<sym>
<xblock>
}
rule statement_control:repeat {\
<sym>
[
| ('while'|'until') <EXPR> {*} #= wu expr
<block> {*} #= wu block
| <block> {*} #= block wu
('while'|'until') <EXPR> {*} #= expr wu
]
}
rule statement_control:loop {\
<sym>
$<eee> = (
'('
<e1=EXPR>? ';' {*} #= e1
<e2=EXPR>? ';' {*} #= e2
<e3=EXPR>? {*} #= e3
')' {*} #= eee
)?
<block> {*} #= block
}
rule statement_control:for {\
<sym>
[ <?before 'my'? '$'\w+ '(' >
<.panic: "This appears to be Perl 5 code"> ]?
<xblock>
}
rule statement_control:given {\
<sym>
<xblock>
}
rule statement_control:when {\
<sym>
<xblock>
}
rule statement_control:default {<sym> <block> }
rule statement_control:BEGIN {<sym> <block> }
rule statement_control:CHECK {<sym> <block> }
rule statement_control:INIT {<sym> <block> }
rule statement_control:END {<sym> <block> }
rule statement_control:START {<sym> <block> }
rule statement_control:ENTER {<sym> <block> }
rule statement_control:LEAVE {<sym> <block> }
rule statement_control:KEEP {<sym> <block> }
rule statement_control:UNDO {<sym> <block> }
rule statement_control:FIRST {<sym> <block> }
rule statement_control:NEXT {<sym> <block> }
rule statement_control:LAST {<sym> <block> }
rule statement_control:PRE {<sym> <block> }
rule statement_control:POST {<sym> <block> }
rule statement_control:CATCH {<sym> <block> }
rule statement_control:CONTROL {<sym> <block> }
rule term:BEGIN {<sym> <block> }
rule term:CHECK {<sym> <block> }
rule term:INIT {<sym> <block> }
rule term:START {<sym> <block> }
rule term:ENTER {<sym> <block> }
rule term:FIRST {<sym> <block> }
rule modifier_expr { <EXPR> }
rule statement_mod_cond:if {<sym> <modifier_expr> {*} } #= if
rule statement_mod_cond:unless {<sym> <modifier_expr> {*} } #= unless
rule statement_mod_cond:when {<sym> <modifier_expr> {*} } #= when
rule statement_mod_loop:while {<sym> <modifier_expr> {*} } #= while
rule statement_mod_loop:until {<sym> <modifier_expr> {*} } #= until
rule statement_mod_loop:for {<sym> <modifier_expr> {*} } #= for
rule statement_mod_loop:given {<sym> <modifier_expr> {*} } #= given
token module_name:normal {
<longname>
[ <?{ ($+PKGDECL//'') eq 'role' }> <?before '['> <postcircumfix> ]?
}
token module_name:deprecated { 'v6-alpha' }
token vnum {
\d+ | '*'
}
token version:sym<v> {
'v' <?before \d> :: <vnum> ** '.' '+'?
}
###################################################
token pre {
[
| <prefix>
{ $<O> = $<prefix><O>; $<sym> = $<prefix><sym> }
{*} #= prefix
| <prefix_circumfix_meta_operator>
{ $<O> = $<prefix_circumfix_meta_operator><O>; $<sym> = $<prefix_circumfix_meta_operator>.text }
{*} #= precircum
]
# XXX assuming no precedence change
::
<prefix_postfix_meta_operator>* {*} #= prepost
{ $+prevop = $<O> }
<.ws>
}
# (for when you want to tell EXPR that infix already parsed the term)
token nullterm {
<?>
}
token nulltermish {
[
| <?stdstopper>
| <termish>?
]
}
token termish {
[
| <pre>+ :: <noun>
| <noun>
]
::
# also queue up any postfixes, since adverbs could change things
[ <?stdstopper> ||
<post>*
<.ws>
<adverbs>?
]
}
token adverbs {
<!stdstopper>
[ <colonpair> <.ws> ]+
{
my $prop = $+prevop orelse
$¢.panic('No previous operator visible to adverbial pair');
# $prop.adverb($<colonpair>);
}
}
token noun {
[
| <fatarrow>
| <variable> { $<sigil> = $<variable><sigil> }
| <package_declarator>
| <scope_declarator>
| <?before 'multi'|'proto'|'only'> <multi_declarator>
| <routine_declarator>
| <regex_declarator>
| <type_declarator>
| <circumfix>
| <dotty>
| <value>
| <capterm>
| <sigterm>
| <term>
| <statement_prefix>
| [ <colonpair> <.ws> ]+
]
}
token fatarrow {
<key=ident> \h* '=>' :: <.ws> <val=EXPR(item %item_assignment)>
}
token colonpair {
:my $key;
:my $value;
':'
[
| '!' <ident>
{ $key = $<ident>.text; $value = 0; }
{*} #= false
| <ident>
{ $key = $<ident>.text; }
[
|| <.unsp>? '.'? <postcircumfix> { $value = $<postcircumfix>; }
|| { $value = 1; }
]
{*} #= value
| <postcircumfix>
{ $key = ""; $value = $<postcircumfix>; }
{*} #= structural
| $<var> = (<sigil> :: <twigil>? <desigilname>)
{ $key = $<var><desigilname>.text; $value = $<var>; }
{*} #= varname
]
{ $<k> = $key; $<v> = $value; }
}
token quotepair {
:my $key;
:my $value;
':'
[
| '!' <ident>
{ $key = $<ident>.text; $value = 0; }
{*} #= false
| <ident>
{ $key = $<ident>.text; }
[
|| <.unsp>? '.'? <?before '('> <postcircumfix> { $value = $<postcircumfix>; }
|| { $value = 1; }
]
{*} #= value
| $<n>=(\d+) $<id>=(<[a..z]>+)
{ $key = $<id>.text; $value = $<n>.text; }
{*} #= nth
]
{ $<k> = $key; $<v> = $value; }
}
token infixish {
<!stdstopper>
<!infixstopper>
[
| <infix>
[
| ''
{ $<O> = $<infix>.<O>; $<sym> = $<infix>.<sym>; }
| <?before '='> <infix_postfix_meta_operator($<infix>)>
{ $<O> = $<infix_postfix_meta_operator>.<O>; $<sym> = $<infix_postfix_meta_operator>.<sym>; }
]
| <infix_prefix_meta_operator>
{ $<O> = $<infix_prefix_meta_operator><O>;
$<sym> = $<infix_prefix_meta_operator><sym>; }
| <infix_circumfix_meta_operator>
{ $<O> = $<infix_circumfix_meta_operator><O>;
$<sym> = $<infix_circumfix_meta_operator><sym>; }
]
}
# doing fancy as one rule simplifies LTM
token dotty:sym<.*> ( --> Methodcall) {
('.' <[+*?=^:]>) <?unspacey> <dottyop>
{ $<sym> = $0.item; }
}
token dotty:sym<.> ( --> Methodcall) {
<sym> <dottyop>
}
token privop ( --> Methodcall) {
'!' <methodop>
}
token dottyop {
[
| <methodop>
| <postop> # forcing postop's precedence to methodcall here
]
}
# Note, this rule mustn't do anything irreversible because it's used
# as a lookahead by the quote interpolator.
token post {
<!stdstopper>
# last whitespace didn't end here
<!{ $¢.<_>[$¢.pos]<ws> }>
[ <.unsp> | '\\' <?before '.'> ]?
[ ['.' <.unsp>?]? <postfix_prefix_meta_operator> <.unsp>? ]*
[
| <dotty> { $<O> = $<dotty><O> }
| <privop> { $<O> = $<privop><O> }
| <postop> { $<O> = $<postop><O> }
]
{ $+prevop = $<O> }
}
regex prefix_circumfix_meta_operator:reduce (--> List_prefix) {
$<s> = (
'['
[
| <op=infix> ']' ['«'|<?>]
| <op=infix_prefix_meta_operator> ']' ['«'|<?>]
| <op=infix_circumfix_meta_operator> ']' ['«'|<?>]
| \\<op=infix> ']' ['«'|<?>]
| \\<op=infix_prefix_meta_operator> ']' ['«'|<?>]
| \\<op=infix_circumfix_meta_operator> ']' ['«'|<?>]
]
) <?before \s | '(' >
{ $<O> = $<s><op><O>; $<sym> = $<s>.text; }
[ <!{ $<O><assoc> eq 'non' }>
|| <.panic: "Can't reduce a non-associative operator"> ]
[ <!{ $<O><prec> eq %conditional<prec> }>
|| <.panic: "Can't reduce a conditional operator"> ]
{ $<O><assoc> = 'unary'; }
}
token prefix_postfix_meta_operator:sym< « > { <sym> | '<<' }
token postfix_prefix_meta_operator:sym< » > { <sym> | '>>' }
token infix_prefix_meta_operator:sym<!> ( --> Chaining) {
<sym> <!before '!'> <infix>
<!!{ $<O> = $<infix><O>; }>
<!!lex1: 'negation'>
[
|| <!!{ $<O><assoc> eq 'chain'}>
|| <!!{ $<O><assoc> and $<O><bool> }>
|| <.panic: "Only boolean infix operators may be negated">
]
<!{ $<O><hyper> and $¢.panic("Negation of hyper operator not allowed") }>
}
method lex1 (Str $s) {