-
Notifications
You must be signed in to change notification settings - Fork 1
/
parser.y
2284 lines (2040 loc) · 91.8 KB
/
parser.y
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
%{
/* Copyright 2009-2024
* Kaz Kylheku <kaz@kylheku.com>
* Vancouver, Canada
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
*
* 1. Redistributions of source code must retain the above copyright notice,
* this list of conditions and the following disclaimer.
*
* 2. Redistributions in binary form must reproduce the above copyright notice,
* this list of conditions and the following disclaimer in the documentation
* and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
* LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
* CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
* ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
* POSSIBILITY OF SUCH DAMAGE.
*/
#include <stddef.h>
#include <stdio.h>
#include <assert.h>
#include <limits.h>
#include <stdlib.h>
#include <wchar.h>
#include <signal.h>
#include "config.h"
#include "alloca.h"
#include "lib.h"
#include "signal.h"
#include "unwind.h"
#include "regex.h"
#include "match.h"
#include "filter.h"
#include "hash.h"
#include "struct.h"
#include "eval.h"
#include "tree.h"
#include "y.tab.h"
#include "debug.h"
#include "txr.h"
#include "itypes.h"
#include "buf.h"
#include "parser.h"
static void set_syntax_tree(parser_t *parser, val tree);
static val sym_helper(parser_t *parser, wchar_t *lexeme, val meta_allowed);
static val repeat_rep_helper(val sym, val args, val main, val parts);
static void process_catch_exprs(val exprs);
static val define_transform(parser_t *parser, val define_form);
static val optimize_text(val text_form);
static val rlrec(parser_t *, val form, val line);
static val rlcp_parser(parser_t *parser, val to, val from);
static wchar_t char_from_name(const wchar_t *name);
static val make_expr(parser_t *, val sym, val rest, val lineno);
static val check_parse_time_action(val spec_rev);
static val uref_helper(parser_t *, val expr);
static val uoref_helper(parser_t *, val expr);
static val qref_helper(parser_t *, val lexpr, val rexpr);
static val fname_helper(parser_t *, val name);
static val output_helper(parser_t *, val sym, val exprs, val clauses);
#if YYBISON
union YYSTYPE;
int yylex(union YYSTYPE *, yyscan_t scanner);
int yyparse(scanner_t *, parser_t *);
#endif
#define rl(form, line) rlrec(parser, form, line)
#define rlc(to, from) rlcp_parser(parser, to, from)
#define mkexp(sym, rest, lineno) make_expr(parser, sym, rest, lineno)
#define symhlpr(lexeme, meta_allowed) sym_helper(parser, lexeme, meta_allowed)
#define yyerr(msg) yyerror(scnr, parser, msg)
#define yybadtok(tok, context) yybadtoken(parser, tok, context)
#define ifnign(expr) (parser->ignore ? nil : (expr))
INLINE val expand_forms_ver(val forms, int ver)
{
if (!opt_compat || opt_compat >= ver)
return expand_forms(forms, nil);
return forms;
}
INLINE val expand_form_ver(val form, int ver)
{
if (!opt_compat || opt_compat >= ver)
return expand(form, nil);
return form;
}
%}
%pure-parser
%parse-param{scanner_t *scnr}
%parse-param{parser_t *parser}
%lex-param{yyscan_t scnr}
%union {
wchar_t *lexeme;
union obj *val;
wchar_t chr;
cnum lineno;
}
%token <lexeme> SPACE TEXT SYMTOK
%token <lineno> ALL SOME NONE MAYBE CASES BLOCK CHOOSE GATHER
%token <lineno> AND OR END COLLECT
%token <lineno> UNTIL COLL OUTPUT REPEAT PUSH REP SINGLE FIRST LAST EMPTY
%token <lineno> MOD MODLAST DEFINE TRY CATCH FINALLY IF
%token <lineno> ERRTOK /* deliberately not used in grammar */
%token <lineno> HASH_BACKSLASH HASH_SLASH DOTDOT HASH_H HASH_S HASH_R HASH_J
%token <lineno> HASH_SEMI HASH_B_QUOTE HASH_N HASH_T
%token <lineno> WORDS WSPLICE QWORDS QWSPLICE
%token <lineno> SECRET_ESCAPE_R SECRET_ESCAPE_E SECRET_ESCAPE_I SECRET_ESCAPE_J
%token <lineno> OLD_DOTDOT
%token <val> NUMBER METANUM JSKW
%token <val> HASH_N_EQUALS HASH_N_HASH
%token <chr> REGCHAR REGTOKEN LITCHAR SPLICE JSPLICE OLD_AT
%token <chr> CONSDOT LAMBDOT UREFDOT OREFDOT UOREFDOT
%type <val> spec hash_semi_or_n_expr hash_semi_or_i_expr
%type <val> clauses_rev clauses_opt clause
%type <val> all_clause some_clause none_clause maybe_clause block_clause
%type <val> cases_clause choose_clause gather_clause collect_clause until_last
%type <val> collect_repeat
%type <val> clause_parts additional_parts gather_parts additional_gather_parts
%type <val> output_clause output_push define_clause try_clause catch_clauses_opt
%type <val> if_clause elif_clauses_opt else_clause_opt
%type <val> line elems_opt elems clause_parts_h additional_parts_h
%type <val> text texts elem var var_op modifiers
%type <val> vector hash struct range tnode tree
%type <val> json json_val json_vals json_pairs json_col
%type <val> exprs exprs_opt n_exprs listacc i_expr i_dot_expr
%type <val> n_expr n_exprs_opt n_dot_expr
%type <val> list dwim meta compound
%type <val> out_clauses out_clauses_opt out_clause
%type <val> repeat_clause repeat_parts_opt o_line
%type <val> out_if_clause out_elif_clauses_opt out_else_clause_opt
%type <val> o_elems_opt o_elems o_elem o_var q_var rep_elem rep_parts_opt
%type <val> regex lisp_regex regexpr regbranch
%type <val> regterm regtoken regclass regclassterm regrange
%type <val> strlit chrlit quasilit quasi_items quasi_item litchars restlitchar
%type <val> wordslit wordsqlit buflit buflit_items buflit_item not_a_clause
%type <chr> regchar
%type <val> byacc_fool
%type <lineno> '(' '[' '@'
%nonassoc LOW /* used for precedence assertion */
%right SYMTOK '{' '}'
%right ALL SOME NONE MAYBE CASES CHOOSE AND OR END COLLECT UNTIL COLL
%right OUTPUT REPEAT REP FIRST LAST EMPTY DEFINE IF ELIF ELSE
%right SPACE TEXT NUMBER METANUM HASH_N_EQUALS HASH_N_HASH HASH_B_QUOTE
%nonassoc '[' ']' '(' ')'
%left '-' ',' '\'' '^' SPLICE OLD_AT
%left '|' '/'
%left '&'
%right '~' '*' '?' '+' '%'
%right DOTDOT
%right '.' CONSDOT LAMBDOT UREFDOT OREFDOT UOREFDOT REGCHAR REGTOKEN LITCHAR
%right OLD_DOTDOT '@'
%%
spec : clauses_opt { set_syntax_tree(parser, $1); }
| SECRET_ESCAPE_R regexpr { set_syntax_tree(parser, $2);
end_of_regex(scnr); }
| SECRET_ESCAPE_E hash_semi_or_n_expr
{ set_syntax_tree(parser, $2); YYACCEPT; }
byacc_fool { internal_error("notreached"); }
| SECRET_ESCAPE_I hash_semi_or_i_expr
{ set_syntax_tree(parser, $2); YYACCEPT; }
byacc_fool { internal_error("notreached"); }
| SECRET_ESCAPE_E { if (yychar == YYEOF) {
parser->syntax_tree = nao;
YYACCEPT;
} else {
yybadtok(yychar, nil);
parser->syntax_tree = nil;
} }
| SECRET_ESCAPE_I { if (yychar == YYEOF) {
parser->syntax_tree = nao;
YYACCEPT;
} else {
yybadtok(yychar, nil);
parser->syntax_tree = nil;
} }
| SECRET_ESCAPE_J json_val { set_syntax_tree(parser, $2);
YYACCEPT; }
byacc_fool { internal_error("notreached"); }
| SECRET_ESCAPE_J { if (yychar == YYEOF) {
parser->syntax_tree = nao;
YYACCEPT;
} else {
yybadtok(yychar, nil);
parser->syntax_tree = nil;
} }
| error '\n' { parser->syntax_tree = nil;
if (parser->errors >= 8)
YYABORT;
yyerrok;
yybadtok(yychar, nil); }
;
hash_semi_or_n_expr : HASH_SEMI { parser->ignore = 1; }
n_expr { parser->ignore = 0;
$$ = nao; }
| HASH_SEMI '.' { parser->ignore = 1; }
n_expr { parser->ignore = 0;
$$ = nao; }
| HASH_SEMI OREFDOT { parser->ignore = 1; }
n_expr { parser->ignore = 0;
$$ = nao; }
| n_expr { $$ = $1; }
| '.' n_expr { $$ = uref_helper(parser, $2); }
| OREFDOT n_expr { $$ = uoref_helper(parser, $2); }
;
hash_semi_or_i_expr : HASH_SEMI { parser->ignore = 1; }
i_expr { parser->ignore = 0;
$$ = nao; }
| HASH_SEMI '.' { parser->ignore = 1; }
i_expr { parser->ignore = 0;
$$ = nao; }
| HASH_SEMI OREFDOT { parser->ignore = 1; }
i_expr { parser->ignore = 0;
$$ = nao; }
| i_expr { $$ = $1; }
| '.' i_expr { $$ = uref_helper(parser, $2); }
| OREFDOT i_expr { $$ = uoref_helper(parser, $2); }
;
/* Hack needed for Berkeley Yacc */
byacc_fool : n_expr { internal_error("notreached"); }
| HASH_SEMI { internal_error("notreached"); }
| { internal_error("notreached"); }
;
clauses_rev : clause { $$ = check_parse_time_action(cons($1, nil)); }
| clauses_rev clause { $$ = check_parse_time_action(cons($2, $1)); }
;
clauses_opt : clauses_rev { $$ = us_nreverse($1); }
| /* empty */ { $$ = nil; }
;
clause : all_clause { $$ = cons($1, nil); rlc($$, $1); }
| some_clause { $$ = cons($1, nil); rlc($$, $1); }
| none_clause { $$ = cons($1, nil); rlc($$, $1); }
| maybe_clause { $$ = cons($1, nil); rlc($$, $1); }
| cases_clause { $$ = cons($1, nil); rlc($$, $1); }
| block_clause { $$ = cons($1, nil); rlc($$, $1); }
| choose_clause { $$ = cons($1, nil); rlc($$, $1); }
| collect_clause { $$ = cons($1, nil); rlc($$, $1); }
| gather_clause { $$ = cons($1, nil); rlc($$, $1); }
| define_clause { $$ = list(define_transform(parser, $1), nao);
rlc(car($$), $1);
rlc($$, $1); }
| try_clause { $$ = cons($1, nil); rlc($$, $1); }
| if_clause { $$ = cons($1, nil); rlc($$, $1); }
| output_clause { $$ = cons($1, nil); rlc($$, $1); }
| line { $$ = $1; }
;
all_clause : ALL newl clause_parts { $$ = list(all_s, $3, nao);
rl($$, num($1)); }
| ALL newl error { $$ = nil;
yybadtok(yychar, lit("all clause")); }
;
some_clause : SOME exprs_opt ')'
newl clause_parts { $$ = list(some_s, $5, $2, nao);
rl($$, num($1)); }
| SOME exprs_opt ')'
newl error
{ $$ = nil;
yybadtok(yychar, lit("some clause")); }
;
none_clause : NONE newl clause_parts { $$ = list(none_s, $3, nao);
rl($$, num($1)); }
| NONE newl error { $$ = nil;
yybadtok(yychar, lit("none clause")); }
;
maybe_clause : MAYBE newl clause_parts { $$ = list(maybe_s, $3, nao);
rl($$, num($1)); }
| MAYBE newl error { $$ = nil;
yybadtok(yychar, lit("maybe clause")); }
;
cases_clause : CASES newl clause_parts { $$ = list(cases_s, $3, nao);
rl($$, num($1)); }
| CASES newl error { $$ = nil;
yybadtok(yychar, lit("cases clause")); }
;
block_clause : BLOCK exprs_opt ')'
newl clauses_opt
END newl { val name = first($2);
if (gt(length($2), one))
yyerr("block: takes zero or no arguments");
if (name && !bindable(name))
yyerrorf(scnr,
lit("block: ~s is not a bindable symbol"),
name, nao);
$$ = list(block_s, name, $5, nao);
rl($$, num($1)); }
| BLOCK exprs_opt ')'
newl error { $$ = nil;
yybadtok(yychar, lit("block clause")); }
;
choose_clause : CHOOSE exprs_opt ')'
newl clause_parts { $$ = list(choose_s, $5, $2, nao);
rl($$, num($1)); }
| CHOOSE exprs_opt ')'
newl error { $$ = nil;
yybadtok(yychar, lit("choose clause")); }
;
gather_clause : GATHER exprs_opt ')'
newl gather_parts
END newl { val args = match_expand_keyword_args($2);
$$ = list(gather_s,
append2(mapcar(pa_12_1(func_n2(cons), nil),
first($5)), rest($5)),
args, nao);
rl($$, num($1)); }
| GATHER exprs_opt ')'
newl gather_parts
until_last exprs_opt ')' newl
clauses_opt
END newl { val args = match_expand_keyword_args($2);
$$ = list(gather_s,
append2(mapcar(pa_12_1(func_n2(cons), nil),
first($5)), rest($5)),
args, cons(cdr($6),
cons($7, $10)), nao);
rl($$, num($1)); }
| GATHER exprs_opt ')'
newl error { $$ = nil;
yybadtok(yychar, lit("gather clause")); }
;
gather_parts : clauses_opt additional_gather_parts
{ $$ = if2($1, cons($1, $2)); }
;
additional_gather_parts : AND newl gather_parts { $$ = $3; }
| OR newl gather_parts { $$ = $3; }
| /* empty */ { $$ = nil; }
;
collect_clause : collect_repeat exprs_opt ')' newl
clauses_opt END newl { val args = match_expand_keyword_args($2);
$$ = list(car($1),
$5, nil, args,
nao);
rl($$, cdr($1)); }
| collect_repeat exprs_opt ')'
newl clauses_opt until_last exprs_opt ')'
newl clauses_opt END newl
{ val args = match_expand_keyword_args($2);
if (nilp($10))
yyerr("empty until/last in collect");
$$ = list(car($1), $5,
cons(cdr($6),
cons($7, $10)),
args, nao);
rl($$, cdr($1));
rl($10, car($6)); }
| collect_repeat exprs_opt ')'
newl error { $$ = nil;
yybadtok(yychar, lit("collect clause")); }
;
collect_repeat : COLLECT { $$ = cons(collect_s, num($1)); }
| REPEAT { $$ = cons(repeat_s, num($1)); }
;
until_last : UNTIL { $$ = cons(num($1), until_s); }
| LAST { $$ = cons(num($1), last_s); }
;
clause_parts : clauses_opt additional_parts { $$ = if2($1, cons($1, $2)); }
;
additional_parts : END newl { $$ = nil; }
| AND newl clause_parts { $$ = $3; }
| OR newl clause_parts { $$ = $3; }
;
if_clause : IF n_exprs_opt ')'
newl clauses_opt
elif_clauses_opt
else_clause_opt
END newl { if (opt_compat && opt_compat <= 136)
{ val xexp = expand_meta($2, nil);
val req = rlc(cons(require_s, xexp), $2);
val iff = rlc(cons(cons(cons(req, nil), $5), nil), $2);
val elifs = $6;
val els = cons($7, nil);
val cases = nappend2(nappend2(iff, elifs), els);
$$ = list(cases_s, cases, nao); }
else
{ val expr = expand(car($2), nil);
val ifs = $5;
val branch = cons(cons(expr, ifs), nil);
val elifs = $6;
val els = $7;
if (cdr($2))
yyerr("extra expression in if");
$$ = cons(if_s,
nappend2(branch, nappend2(elifs, els)));
rl($$, num($1)); } }
| IF n_exprs_opt ')'
newl error { $$ = nil; yybadtok(yychar, lit("if clause")); }
;
elif_clauses_opt : ELIF n_exprs_opt ')' newl
clauses_opt
elif_clauses_opt { if (opt_compat && opt_compat <= 136)
{ val xexp = expand_meta($2, nil);
val req = rlc(cons(require_s, xexp), $2);
$$ = cons(cons(cons(req, nil), $5), $6); }
else
{ val expr = expand(car($2), nil);
val elifs = $5;
val branch = cons(cons(expr, elifs), nil);
if (cdr($2))
yyerr("extra expression in elif");
$$ = nappend2(branch, $6); } }
| { $$ = nil; }
;
else_clause_opt : ELSE newl
clauses_opt { if (opt_compat && opt_compat <= 136)
{ $$ = $3; }
else
{ $$ = cons(cons(t, $3), nil); } }
| { $$ = nil; }
;
line : elems_opt '\n' { $$ = $1; }
;
elems_opt : elems { $$ = $1; }
| { $$ = nil; }
;
elems : elem { $$ = cons($1, nil);
rlc($$, $1); }
| elem elems { $$ = cons($1, $2);
rlc($$, $1); }
;
text : TEXT { $$ = rl(string_own($1), num(parser->lineno)); }
| SPACE { if ($1[0] == ' ' && $1[1] == 0)
{ val spaces = list(oneplus_s,
chr(' '), nao);
free($1);
$$ = regex_compile(spaces, nil);
rl($$, num(parser->lineno)); }
else
{ $$ = rl(string_own($1), num(parser->lineno)); }}
| regex { $$ = $1;
rl($$, num(parser->lineno)); }
| EMPTY { $$ = null_string; }
;
texts : text %prec LOW { $$ = rlc(cons($1, nil), $1); }
| text texts { $$ = rlc(cons($1, $2), $2); }
;
elem : texts { $$ = rlc(cons(text_s, $1), $1);
$$ = rlc(optimize_text($$), $$); }
| var { $$ = rl($1, num(parser->lineno));
match_reg_elem($$); }
| list { val sym = first($1);
if (sym == do_s || sym == require_s)
$$ = rlc(cons(sym,
expand_forms(rest($1), nil)),
$1);
else if (sym == mdo_s)
{ eval_intrinsic(cons(progn_s, cdr($1)), nil, nil);
$$ = cons(do_s, nil); }
else
{ $$ = match_expand_elem($1);
match_reg_elem($$); } }
| COLL exprs_opt ')' elems_opt END { val args = match_expand_keyword_args($2);
$$ = list(coll_s, $4, nil, args, nao);
rl($$, num($1)); }
| COLL exprs_opt ')' elems_opt
until_last exprs_opt ')'
elems_opt END { val args = match_expand_keyword_args($2);
$$ = list(coll_s, $4, cons(cdr($5),
cons($6, $8)),
args, nao);
rl($$, num($1));
rl($6, car($5)); }
| REP exprs_opt ')' elems END { val args = match_expand_keyword_args($2);
$$ = list(rep_s, $4, nil, args, nao);
rl($$, num($1)); }
| REP exprs_opt ')' elems
until_last exprs_opt ')'
elems END
{ val args = match_expand_keyword_args($2);
$$ = list(rep_s, $4, cons(cdr($5),
cons($6, $8)),
args, nao);
rl($$, num($1));
rl($6, car($5)); }
| BLOCK exprs_opt ')' elems END { $$ = list(block_s, car($2),
cons($4, nil), nao);
rl($$, num($1)); }
| COLL error { $$ = nil;
yybadtok(yychar, lit("coll clause")); }
| REP error { $$ = nil;
yybadtok(yychar, lit("rep clause")); }
| BLOCK error { $$ = nil;
yybadtok(yychar, lit("rep clause")); }
| ALL clause_parts_h { $$ = rl(list(all_s, t, $2, nao), num($1)); }
| SOME exprs_opt ')'
clause_parts_h { $$ = rl(list(some_s, t, $4, $2, nao), num($1)); }
| NONE clause_parts_h { $$ = rl(list(none_s, t, $2, nao), num($1)); }
| MAYBE clause_parts_h { $$ = rl(list(maybe_s, t, $2, nao), num($1)); }
| CASES clause_parts_h { $$ = rl(list(cases_s, t, $2, nao), num($1)); }
| CHOOSE exprs_opt ')'
clause_parts_h { $$ = list(choose_s, t, $4, $2, nao);
rl($$, num($1)); }
| DEFINE exprs ')' elems END
{ $$ = list(define_s, t, $4, $2, nao);
rl($$, num($1));
match_reg_params(second($2)); }
;
clause_parts_h : elems_opt additional_parts_h { $$ = if2($1, cons($1, $2)); }
;
additional_parts_h : END { $$ = nil; }
| AND clause_parts_h { $$ = $2; }
| OR clause_parts_h { $$ = $2; }
;
define_clause : DEFINE exprs ')' newl
clauses_opt
END newl { $$ = list(define_s, $2, $5, nao);
rl($$, num($1));
match_reg_params(second($2)); }
| DEFINE ')' newl
clauses_opt
END newl { $$ = list(define_s, nil, $4, nao);
rl($$, num($1)); }
| DEFINE error { $$ = nil;
yybadtok(yychar, lit("define directive")); }
| DEFINE exprs ')' newl
error { $$ = nil; yybadtok(yychar, lit("define")); }
| DEFINE ')' newl
error { $$ = nil;
yybadtok(yychar, lit("define")); }
;
try_clause : TRY newl
clauses_opt
catch_clauses_opt
END newl { $$ = list(try_s,
flatten(mapcar(func_n1(second),
$4)),
$3, $4, nao);
rl($$, num($1)); }
| TRY newl
error { $$ = nil;
yybadtok(yychar, lit("try clause")); }
;
catch_clauses_opt : CATCH ')' newl
clauses_opt
catch_clauses_opt { $$ = cons(list(catch_s, cons(t, nil),
$4, nao), $5);
rl($$, num($1)); }
| CATCH exprs ')' newl
clauses_opt
catch_clauses_opt { $$ = cons(list(catch_s, $2, $5, nao),
$6);
process_catch_exprs($2);
rl($$, num($1)); }
| FINALLY newl
clauses_opt { $$ = cons(list(finally_s, nil,
$3, nao),
nil);
rl($$, num($1)); }
| { $$ = nil; }
| CATCH ')' newl
error { $$ = nil;
yybadtok(yychar, lit("catch clause")); }
| CATCH exprs ')' newl
error { $$ = nil;
yybadtok(yychar, lit("catch clause")); }
| FINALLY newl
error { $$ = nil;
yybadtok(yychar, lit("finally clause")); }
;
output_clause : output_push ')' o_elems '\n'
out_clauses
END newl { $$ = nil;
yyerrorf(scnr, lit("~a: traling material"),
car($1), nao); }
| output_push ')' newl
END newl { $$ = rl(list(car($1), nao), $1); }
| output_push ')' newl
out_clauses
END newl { $$ = rl(list(car($1), $4, nao), $1); }
| output_push exprs ')' newl
out_clauses
END newl { $$ = output_helper(parser, car($1), $2, $5);
rl($$, $1); }
| output_push exprs ')' o_elems '\n'
out_clauses
END newl { $$ = nil;
yyerr("invalid combination of old and "
"new syntax in output directive"); }
| output_push error { $$ = nil;
yybadtok(yychar, lit("output directive")); }
| output_push ')' o_elems '\n'
error { $$ = nil;
yybadtok(yychar, lit("output clause")); }
| output_push ')' newl
error { $$ = nil;
yybadtok(yychar, lit("output clause")); }
| output_push exprs ')' o_elems '\n'
error { $$ = nil;
yybadtok(yychar, lit("output clause")); }
| output_push exprs ')' newl
error { $$ = nil;
yybadtok(yychar, lit("output clause")); }
;
output_push : OUTPUT { $$ = cons(output_s, num($1)); }
| PUSH { $$ = cons(push_s, num($1)); }
;
out_clauses : out_clause { $$ = cons($1, nil); }
| out_clause out_clauses { $$ = cons($1, $2); }
;
out_clause : repeat_clause { $$ = cons($1, nil); }
| out_if_clause { $$ = cons($1, nil); }
| o_line { $$ = $1; }
;
repeat_clause : REPEAT n_exprs_opt ')' newl
out_clauses_opt
repeat_parts_opt
END newl { $$ = repeat_rep_helper(repeat_s,
$2, $5, $6);
rl($$, num($1)); }
| REPEAT newl
error { $$ = nil;
yybadtok(yychar, lit("repeat clause")); }
;
repeat_parts_opt : SINGLE newl
out_clauses_opt
repeat_parts_opt { $$ = cons(cons(single_s, $3), $4);
rl($$, num($1)); }
| FIRST newl
out_clauses_opt
repeat_parts_opt { $$ = cons(cons(first_s, $3), $4);
rl($$, num($1)); }
| LAST exprs_opt ')' newl
out_clauses_opt
repeat_parts_opt { if ($2)
yyerrorf(scnr,
lit("last: in output, "
"takes no arguments"),
nao);
$$ = cons(cons(last_s, $5), $6);
rl($$, num($1)); }
| EMPTY newl
out_clauses_opt
repeat_parts_opt { $$ = cons(cons(empty_s, $3), $4);
rl($$, num($1)); }
| MOD exprs_opt ')'
newl
out_clauses_opt
repeat_parts_opt { $$ = cons(cons(mod_s,
cons(expand_forms_ver($2, 166),
$5)), $6);
rl($$, num($1)); }
| MODLAST exprs_opt ')'
newl
out_clauses_opt
repeat_parts_opt { $$ = cons(cons(modlast_s,
cons(expand_forms_ver($2, 166),
$5)), $6);
rl($$, num($1)); }
| /* empty */ { $$ = nil; }
;
out_if_clause : IF n_expr ')' newl
out_clauses_opt
out_elif_clauses_opt
out_else_clause_opt
END newl { val expr = expand($2, nil);
val ifs = $5;
val branch = cons(cons(expr, ifs), nil);
val elifs = $6;
val els = $7;
$$ = cons(if_s,
nappend2(branch, nappend2(elifs, els)));
rl($$, num($1)); }
| IF ')'
{ $$ = nil;
yyerr("if requires expression"); }
| IF n_expr ')' newl
error { $$ = nil; yybadtok(yychar, lit("if clause")); }
;
out_elif_clauses_opt : ELIF n_exprs_opt ')' newl
out_clauses_opt
out_elif_clauses_opt
{ val expr = expand(car($2), nil);
val elifs = $5;
val branch = cons(cons(expr, elifs), nil);
if (null($2))
yyerr("elif requires expression");
else if (cdr($2))
yyerr("extra expression in elif");
$$ = nappend2(branch, $6); }
| { $$ = nil; }
;
out_else_clause_opt : ELSE newl
out_clauses_opt
{ $$ = cons(cons(t, $3), nil); }
| { $$ = nil; }
;
out_clauses_opt : out_clauses { $$ = $1; }
| /* empty */ { $$ = nil; }
o_line : o_elems_opt '\n' { $$ = $1; }
;
o_elems_opt : o_elems { $$ = $1;
rl($$, num(parser->lineno)); }
| { $$ = nil; }
;
o_elems : o_elem { $$ = cons($1, nil); }
| o_elem o_elems { $$ = cons($1, $2); }
| not_a_clause { $$ = cons($1, nil); }
| not_a_clause o_elems { $$ = cons($1, $2); }
;
o_elem : TEXT { $$ = string_own($1);
rl($$, num(parser->lineno)); }
| SPACE { $$ = string_own($1);
rl($$, num(parser->lineno)); }
| o_var { $$ = $1; }
| compound { $$ = rlc(list(expr_s,
expand($1, nil), nao), $1); }
| rep_elem { $$ = $1; }
;
rep_elem : REP n_exprs_opt ')' o_elems_opt
rep_parts_opt END { $$ = repeat_rep_helper(rep_s, $2, $4, $5);
rl($$, num($1)); }
| REP error { $$ = nil;
yybadtok(yychar, lit("rep clause")); }
;
rep_parts_opt : SINGLE o_elems_opt
rep_parts_opt { $$ = cons(cons(single_s, $2), $3);
rl($$, num($1)); }
| FIRST o_elems_opt
rep_parts_opt { $$ = cons(cons(first_s, $2), $3);
rl($$, num($1)); }
| LAST exprs_opt ')'
o_elems_opt rep_parts_opt { if ($2)
yyerrorf(scnr,
lit("last: in output, "
"takes no arguments"),
nao);
$$ = cons(cons(last_s, $4), $5);
rl($$, num($1)); }
| EMPTY o_elems_opt
rep_parts_opt { $$ = cons(cons(empty_s, $2), $3);
rl($$, num($1)); }
| MOD exprs_opt ')'
o_elems_opt
rep_parts_opt { $$ = cons(cons(mod_s,
cons(expand_forms_ver($2, 166),
$4)), $5);
rl($$, num($1)); }
| MODLAST exprs_opt ')'
o_elems_opt
rep_parts_opt { $$ = cons(cons(modlast_s,
cons(expand_forms_ver($2, 166),
$4)), $5);
rl($$, num($1)); }
| /* empty */ { $$ = nil; }
;
/* This sucks, but factoring '*' into a nonterminal
* that generates an empty phrase causes reduce/reduce conflicts.
*/
var : SYMTOK { $$ = list(var_s, symhlpr($1, nil), nao); }
| '{' SYMTOK '}' { $$ = list(var_s, symhlpr($2, nil), nao); }
| '{' SYMTOK modifiers '}' { $$ = list(var_s, symhlpr($2, nil), $3, nao); }
| var_op SYMTOK { $$ = list(var_s, symhlpr($2, nil), $1, nao); }
| var_op '{' SYMTOK '}' { $$ = list(var_s, symhlpr($3, nil), $1, nao); }
| var_op '{' SYMTOK regex '}' { $$ = nil;
free($3);
yyerr("longest match "
"not useable with regex"); }
| var_op '{' SYMTOK NUMBER '}' { $$ = nil;
free($3);
yyerr("longest match "
"not useable with "
"fixed width match"); }
| SYMTOK error { $$ = nil;
free($1);
yybadtok(yychar, lit("variable spec")); }
| var_op error { $$ = nil;
yybadtok(yychar, lit("variable spec")); }
;
var_op : '*' { $$ = list(t, nao); }
;
modifiers : NUMBER { $$ = cons($1, nil); }
| regex { $$ = cons($1, nil);
rlc($$, $1); }
| compound { $$ = rlc(cons(expand_meta($1, nil),
nil), $1); }
| SYMTOK { $$ = cons(symhlpr($1, nil), nil); }
;
o_var : SYMTOK { val expr = symhlpr($1, nil);
if (!opt_compat || opt_compat > 128)
expr = expand(expr, nil);
$$ = list(var_s, expr, nao);
rl($$, num(parser->lineno)); }
| '{' n_expr n_exprs_opt '}'
{ if (opt_compat && opt_compat <= 128)
{ $$ = list(var_s,
expand_meta($2, nil),
expand_meta($3, nil), nao); }
else
{ val quasi_var = list(var_s, $2, $3, nao);
val quasi_items = cons(quasi_var, nil);
$$ = car(expand_quasi(quasi_items, nil)); } }
| SYMTOK error { $$ = nil;
free($1);
yybadtok(yychar, lit("variable spec")); }
;
q_var : '@' '{' n_expr n_exprs_opt '}'
{ $$ = list(var_s, $3, $4, nao);
rl($$, num(parser->lineno)); }
| '@' '{' error { $$ = nil;
yybadtok(yychar, lit("variable spec")); }
;
vector : '#' list { if (parser->quasi_level > 0)
$$ = rlc(cons(vector_lit_s,
cons($2, nil)), $2);
else
$$ = rlc(vec_list($2), $2); }
| '#' error { $$ = nil;
yybadtok(yychar, lit("unassigned/reserved # notation")); }
;
hash : HASH_H list { if (parser->ignore)
$$ = nil;
else if (parser->quasi_level > 0)
$$ = rl(cons(hash_lit_s, $2), num($1));
else
$$ = rl(hash_construct(first($2),
rest($2)),
num($1)); }
| HASH_H error { $$ = nil;
yybadtok(yychar, lit("hash literal")); }
;
struct : HASH_S list { if (parser->ignore)
{ $$ = nil; }
else if ((parser->quasi_level > 0) ||
(parser->read_unknown_structs &&
!find_struct_type(first($2))))
{ $$ = rl(cons(struct_lit_s, $2), num($1)); }
else
{ val strct = make_struct_lit(first($2),
rest($2));
$$ = rl(strct, num($1)); } }
| HASH_S error { $$ = nil;
yybadtok(yychar, lit("struct literal")); }
;
range : HASH_R list { if (length($2) != two)
yyerr("range literal needs two elements");
{ val range = rcons(first($2), second($2));
$$ = rl(range, num($1)); } }
| HASH_R error { $$ = nil;
yybadtok(yychar, lit("range literal")); }
;
tnode : HASH_N list { if (gt(length($2), three))
yyerr("excess elements in tree node");
{ val tn = tnode(first($2), second($2),
third($2));
$$ = rl(tn, num($1)); } }
| HASH_N error { $$ = nil;
yybadtok(yychar, lit("tree node literal")); }
;
tree : HASH_T list { if (parser->ignore)
{ $$ = nil; }
else if (parser->quasi_level > 0)
{ $$ = rl(cons(tree_lit_s, $2), num($1)); }
else
{ val opts = first($2);
val key_fn_name = pop(&opts);
val less_fn_name = pop(&opts);
val equal_fn_name = pop(&opts);
val key_fn = fname_helper(parser, key_fn_name);
val less_fn = fname_helper(parser, less_fn_name);
val equal_fn = fname_helper(parser, equal_fn_name);
val tr = tree(rest($2), key_fn,
less_fn, equal_fn, t);
$$ = rl(tr, num($1)); } }
| HASH_T error { $$ = nil;
yybadtok(yychar, lit("tree node literal")); }
;
json : HASH_J json_val { $$ = list(json_s, quote_s, $2, nao);
end_of_json(scnr); }
| HASH_J '^' { parser->quasi_level++; }
json_val { parser->quasi_level--;
end_of_json(scnr);
$$ = list(json_s, sys_qquote_s, $4, nao); }
json_val : NUMBER { $$ = $1; }
| JSKW { $$ = $1; }
| '"' '"' { $$ = null_string; }
| '"' litchars '"' { $$ = $2;
rl($$, num(parser->lineno)); }
| '[' ']' { $$ = vector(zero, nil); }
| '[' json_vals
opt_comma ']' { $$ = if3(vectorp($2),
$2,
rl(cons(vector_lit_s,
cons(nreverse($2), nil)),
$2)); }
| '{' '}' { $$ = make_hash(hash_weak_none, t); }
| '{' json_pairs
opt_comma '}' { $$ = if3(hashp($2),
$2,
rl(cons(hash_lit_s,
cons(nil, nreverse($2))),
$2)); }
| '~' { parser->quasi_level--; }
n_dot_expr { parser->quasi_level++;
end_of_json_unquote(scnr);
$$ = rl(rlc(list(sys_unquote_s, $3, nao), $3),
num(parser->lineno)); }
| JSPLICE { parser->quasi_level--; }
n_dot_expr { parser->quasi_level++;
end_of_json_unquote(scnr);
$$ = rl(rlc(list(sys_splice_s, $3, nao), $3),
num(parser->lineno)); }
| HASH_N_EQUALS { parser_circ_def(parser, $1, unique_s); }
json_val { parser_circ_def(parser, $1, $3);
$$ = $3; }
| HASH_N_HASH { $$ = parser_circ_ref(parser, $1); }
| '"' error { $$ = nil;
yybadtok(yychar, lit("JSON string")); }