h2lang 0.5.4

H2 Language - A Herbert Online Judge compatible programming language with multi-agent support
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
1001
1002
1003
1004
1005
1006
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
1023
1024
1025
1026
1027
1028
1029
1030
1031
1032
1033
1034
1035
1036
1037
1038
1039
1040
1041
1042
1043
1044
1045
1046
1047
1048
1049
1050
1051
1052
1053
1054
1055
1056
1057
1058
1059
1060
1061
1062
1063
1064
1065
1066
1067
1068
1069
1070
1071
1072
1073
1074
1075
1076
1077
1078
1079
1080
1081
1082
1083
1084
1085
1086
1087
1088
1089
1090
1091
1092
1093
1094
1095
1096
1097
1098
1099
1100
1101
1102
1103
1104
1105
1106
1107
1108
1109
1110
1111
1112
1113
1114
1115
1116
1117
1118
1119
1120
1121
1122
1123
1124
1125
1126
1127
1128
1129
1130
1131
1132
1133
1134
1135
1136
1137
1138
1139
1140
1141
1142
1143
1144
1145
1146
1147
1148
1149
1150
1151
1152
1153
1154
1155
1156
1157
1158
1159
1160
1161
1162
1163
1164
1165
1166
1167
1168
1169
1170
1171
1172
1173
1174
1175
1176
1177
1178
1179
1180
1181
1182
1183
1184
1185
1186
1187
1188
1189
1190
1191
1192
1193
1194
1195
1196
1197
1198
1199
1200
1201
1202
1203
1204
1205
1206
1207
1208
1209
1210
1211
1212
1213
1214
1215
1216
1217
1218
1219
1220
1221
1222
1223
1224
1225
1226
1227
1228
1229
1230
1231
1232
1233
1234
1235
1236
1237
1238
1239
1240
1241
1242
1243
1244
1245
1246
1247
1248
1249
1250
1251
1252
1253
1254
1255
1256
1257
1258
1259
1260
1261
1262
1263
1264
1265
1266
1267
1268
1269
1270
1271
1272
1273
1274
1275
1276
1277
1278
1279
1280
1281
1282
1283
1284
1285
1286
1287
1288
1289
1290
1291
1292
1293
1294
1295
1296
1297
1298
1299
1300
1301
1302
1303
1304
1305
1306
1307
1308
1309
1310
1311
1312
1313
1314
1315
1316
1317
1318
1319
1320
1321
1322
1323
1324
1325
1326
1327
1328
1329
1330
1331
1332
1333
1334
1335
1336
1337
1338
1339
1340
1341
1342
1343
1344
1345
1346
1347
1348
1349
1350
1351
1352
1353
1354
1355
1356
1357
1358
1359
1360
1361
1362
1363
1364
1365
1366
1367
1368
1369
1370
1371
1372
1373
1374
1375
1376
1377
1378
1379
1380
1381
1382
1383
1384
1385
1386
1387
1388
1389
1390
1391
1392
1393
1394
1395
1396
1397
1398
1399
1400
1401
1402
1403
1404
1405
1406
1407
1408
1409
1410
1411
1412
1413
1414
1415
1416
1417
1418
1419
1420
1421
1422
1423
1424
1425
1426
1427
1428
1429
1430
1431
1432
1433
1434
1435
1436
1437
1438
1439
1440
1441
1442
1443
1444
1445
1446
1447
1448
1449
1450
1451
1452
//! Recursive descent parser for H2 Language.
//!
//! Uses Peekable iterator with buffering for lookahead.

use crate::ast::{
    Agent, Arg, Definition, Directive, DirectiveValue, Expr, FuncDef, LimitConfig, NumAtom, NumOp,
    OnLimitBehavior, ParamType, Primitive, Program,
};
use crate::error::ParseError;
use crate::lexer::Lexer;
use crate::token::{Span, Token, TokenKind};
use std::collections::HashMap;
use std::collections::VecDeque;
use std::iter::Peekable;
use std::vec::IntoIter;

/// Parser for H2 Language.
///
/// Uses Peekable iterator with a VecDeque buffer for O(1) lookahead.
pub struct Parser {
    /// Token iterator
    tokens: Peekable<IntoIter<Token>>,
    /// Lookahead buffer for multi-token lookahead (VecDeque for O(1) pop_front)
    buffer: VecDeque<Token>,
    /// Last consumed token's span (for error reporting)
    last_span: Span,
}

impl Parser {
    /// Create a new parser for the given input.
    pub fn new(input: &str) -> Result<Self, ParseError> {
        let mut lexer = Lexer::new(input);
        let tokens = lexer
            .tokenize()
            .map_err(|e| ParseError::new(e.message, Span::new(0, 0, e.line, e.column)))?;

        let default_span = Span::new(0, 0, 1, 1);

        Ok(Self {
            tokens: tokens.into_iter().peekable(),
            buffer: VecDeque::new(),
            last_span: default_span,
        })
    }

    /// Fill buffer up to n elements if possible.
    fn fill_buffer(&mut self, n: usize) {
        while self.buffer.len() < n {
            if let Some(token) = self.tokens.next() {
                self.buffer.push_back(token);
            } else {
                break;
            }
        }
    }

    /// Peek at the current token (0th position).
    fn peek(&mut self) -> Option<&Token> {
        self.fill_buffer(1);
        self.buffer.front()
    }

    /// Peek at the nth token ahead (0-indexed).
    fn peek_nth(&mut self, n: usize) -> Option<&Token> {
        self.fill_buffer(n + 1);
        self.buffer.get(n)
    }

    /// Get current token kind, or EOF if none.
    fn current_kind(&mut self) -> TokenKind {
        self.peek()
            .map(|t| t.kind.clone())
            .unwrap_or(TokenKind::Eof)
    }

    /// Get current token span.
    fn current_span(&mut self) -> Span {
        self.peek().map(|t| t.span).unwrap_or(self.last_span)
    }

    /// Advance to next token, returning the consumed token.
    fn advance(&mut self) -> Option<Token> {
        // First try to take from buffer (O(1) with VecDeque)
        if !self.buffer.is_empty() {
            let token = self.buffer.pop_front().unwrap();
            self.last_span = token.span;
            Some(token)
        } else {
            // Otherwise take from iterator
            let token = self.tokens.next();
            if let Some(ref t) = token {
                self.last_span = t.span;
            }
            token
        }
    }

    /// Check if current token matches the given kind.
    fn check(&mut self, kind: &TokenKind) -> bool {
        std::mem::discriminant(&self.current_kind()) == std::mem::discriminant(kind)
    }

    /// Check if we're at end of line or end of input.
    fn is_at_end_of_line(&mut self) -> bool {
        matches!(self.current_kind(), TokenKind::Newline | TokenKind::Eof)
    }

    /// Skip Space tokens.
    fn skip_space(&mut self) {
        while self.check(&TokenKind::Space) {
            self.advance();
        }
    }

    /// Expect a specific token kind.
    fn expect(&mut self, kind: &TokenKind) -> Result<Span, ParseError> {
        if self.check(kind) {
            let span = self.current_span();
            self.advance();
            Ok(span)
        } else {
            Err(ParseError::unexpected_token(
                kind.description(),
                self.current_kind().description(),
                self.current_span(),
            ))
        }
    }

    /// Parse the entire program.
    ///
    /// Structure: `directives* (agent_block | single_agent_block)`
    ///
    /// Supports two modes:
    /// 1. **With agent prefix**: `0: srl` - traditional multi-agent syntax
    /// 2. **Without agent prefix**: `srl` - single agent mode (defaults to agent 0)
    pub fn parse_program(&mut self) -> Result<Program, ParseError> {
        // Skip leading newlines
        while self.check(&TokenKind::Newline) {
            self.advance();
        }

        // Parse directives first
        let directives = self.parse_directives()?;
        let limits = Self::build_limit_config(&directives)?;

        // Skip newlines after directives
        while self.check(&TokenKind::Newline) {
            self.advance();
        }

        // Check if we're at EOF (empty program or directives only)
        if self.check(&TokenKind::Eof) {
            return Ok(Program {
                directives,
                limits,
                agents: Vec::new(),
            });
        }

        // Parse agents
        let mut agents = Vec::new();

        // Determine mode: check if first token is AgentId
        let has_agent_prefix = matches!(self.current_kind(), TokenKind::AgentId(_));

        if has_agent_prefix {
            // Traditional multi-agent mode
            while !self.check(&TokenKind::Eof) {
                let agent = self.parse_agent_line_with_prefix()?;
                agents.push(agent);

                // Skip newlines between agents
                while self.check(&TokenKind::Newline) {
                    self.advance();
                }
            }
        } else {
            // Single agent mode (no prefix)
            // All lines are treated as the same agent (agent 0)
            let agent = self.parse_agent_line_without_prefix_multiline()?;
            agents.push(agent);
        }

        Ok(Program {
            directives,
            limits,
            agents,
        })
    }

    /// Parse directives at the beginning of the program.
    ///
    /// Directives are lines like `MAX_STEP=1000` or `ON_LIMIT=ERROR`
    fn parse_directives(&mut self) -> Result<Vec<Directive>, ParseError> {
        let mut directives = Vec::new();

        loop {
            // Skip newlines and leading spaces (indented directives)
            while self.check(&TokenKind::Newline) || self.check(&TokenKind::Space) {
                self.advance();
            }

            // Check if this is a directive
            if let TokenKind::Directive(name) = self.current_kind() {
                let start_span = self.current_span();
                self.advance();

                // Expect '='
                self.expect(&TokenKind::Equals)?;

                // Parse directive value (number or directive value like ERROR/TRUNCATE)
                let value = self.parse_directive_value()?;

                let end_span = self.current_span();
                let span = Span::new(
                    start_span.start,
                    end_span.end,
                    start_span.line,
                    start_span.column,
                );

                directives.push(Directive { name, value, span });

                // Expect newline or EOF after directive
                if !self.check(&TokenKind::Newline) && !self.check(&TokenKind::Eof) {
                    return Err(ParseError::unexpected_token(
                        "newline or end of input",
                        self.current_kind().description(),
                        self.current_span(),
                    ));
                }
            } else {
                // Not a directive, stop parsing directives
                break;
            }
        }

        Ok(directives)
    }

    /// Parse directive value (number or ERROR/TRUNCATE)
    fn parse_directive_value(&mut self) -> Result<DirectiveValue, ParseError> {
        match self.current_kind() {
            TokenKind::Number(n) => {
                self.advance();
                Ok(DirectiveValue::Number(n as i64))
            }
            TokenKind::DirectiveValue(s) => {
                self.advance();
                Ok(DirectiveValue::String(s))
            }
            _ => Err(ParseError::unexpected_token(
                "number or ERROR/TRUNCATE",
                self.current_kind().description(),
                self.current_span(),
            )),
        }
    }

    /// Build LimitConfig from parsed directives.
    ///
    /// When no directives are specified, uses HOJ-compatible defaults (Truncate).
    /// When directives are specified but ON_LIMIT is not, uses spec default (Error).
    fn build_limit_config(directives: &[Directive]) -> Result<LimitConfig, ParseError> {
        let mut config = LimitConfig::default();

        // Track if ON_LIMIT was explicitly set
        let mut on_limit_explicit = false;

        for directive in directives {
            match directive.name.as_str() {
                "MAX_STEP" => {
                    if let DirectiveValue::Number(n) = &directive.value {
                        if *n < 1 || *n > 10_000_000 {
                            return Err(ParseError::new(
                                format!("MAX_STEP value {} out of range (1..10000000) (E009)", n),
                                directive.span,
                            ));
                        }
                        config.max_step = *n as usize;
                    } else {
                        return Err(ParseError::new(
                            "MAX_STEP requires a numeric value (E009)",
                            directive.span,
                        ));
                    }
                }
                "MAX_DEPTH" => {
                    if let DirectiveValue::Number(n) = &directive.value {
                        if *n < 1 || *n > 10_000 {
                            return Err(ParseError::new(
                                format!("MAX_DEPTH value {} out of range (1..10000) (E009)", n),
                                directive.span,
                            ));
                        }
                        config.max_depth = *n as usize;
                    } else {
                        return Err(ParseError::new(
                            "MAX_DEPTH requires a numeric value (E009)",
                            directive.span,
                        ));
                    }
                }
                "MAX_MEMORY" => {
                    if let DirectiveValue::Number(n) = &directive.value {
                        if *n < 1 || *n > 10_000_000 {
                            return Err(ParseError::new(
                                format!("MAX_MEMORY value {} out of range (1..10000000) (E009)", n),
                                directive.span,
                            ));
                        }
                        config.max_memory = *n as usize;
                    } else {
                        return Err(ParseError::new(
                            "MAX_MEMORY requires a numeric value (E009)",
                            directive.span,
                        ));
                    }
                }
                "ON_LIMIT" => {
                    on_limit_explicit = true;
                    if let DirectiveValue::String(s) = &directive.value {
                        match s.as_str() {
                            "ERROR" => config.on_limit = OnLimitBehavior::Error,
                            "TRUNCATE" => config.on_limit = OnLimitBehavior::Truncate,
                            _ => {
                                return Err(ParseError::new(
                                    format!(
                                        "ON_LIMIT value '{}' invalid, expected ERROR or TRUNCATE (E009)",
                                        s
                                    ),
                                    directive.span,
                                ));
                            }
                        }
                    } else {
                        return Err(ParseError::new(
                            "ON_LIMIT requires ERROR or TRUNCATE (E009)",
                            directive.span,
                        ));
                    }
                }
                _ => {
                    return Err(ParseError::new(
                        format!("Unknown directive '{}' (E009)", directive.name),
                        directive.span,
                    ));
                }
            }
        }

        // If directives were specified but ON_LIMIT was not explicitly set,
        // use spec default (Error) instead of HOJ default (Truncate)
        if !directives.is_empty() && !on_limit_explicit {
            config.on_limit = OnLimitBehavior::Error;
        }

        Ok(config)
    }

    /// Parse agent with prefix: `agent_id ':' statement_list`
    ///
    /// Parses until EOF or the next agent ID is encountered.
    /// Supports multi-line code for a single agent.
    fn parse_agent_line_with_prefix(&mut self) -> Result<Agent, ParseError> {
        let start_span = self.current_span();

        // Parse agent ID
        let id = match self.current_kind() {
            TokenKind::AgentId(n) => n,
            _ => {
                return Err(ParseError::unexpected_token(
                    "agent ID",
                    self.current_kind().description(),
                    self.current_span(),
                ));
            }
        };
        self.advance();

        // Expect ':'
        self.expect(&TokenKind::Colon)?;

        // Skip space after colon
        self.skip_space();

        // Parse statement list across multiple lines until next AgentId or EOF
        let (definitions, expression) = self.parse_statement_list_multiline()?;

        let end_span = self.current_span();
        let span = Span::new(
            start_span.start,
            end_span.end,
            start_span.line,
            start_span.column,
        );

        Ok(Agent {
            id,
            definitions,
            expression,
            span,
        })
    }

    /// Parse multiple lines without prefix as a single agent (agent 0).
    ///
    /// This is used for single-agent programs where all lines belong to agent 0.
    /// Continues parsing until EOF, treating newlines as whitespace separators.
    fn parse_agent_line_without_prefix_multiline(&mut self) -> Result<Agent, ParseError> {
        let start_span = self.current_span();

        // Default to agent 0
        let id = 0;

        // Parse statement list across multiple lines
        let (definitions, expression) = self.parse_statement_list_multiline()?;

        let end_span = self.current_span();
        let span = Span::new(
            start_span.start,
            end_span.end,
            start_span.line,
            start_span.column,
        );

        Ok(Agent {
            id,
            definitions,
            expression,
            span,
        })
    }

    /// Parse statement list across multiple lines until EOF or next AgentId.
    ///
    /// This is used for single-agent programs or multi-line agent definitions.
    fn parse_statement_list_multiline(&mut self) -> Result<(Vec<Definition>, Expr), ParseError> {
        let mut definitions = Vec::new();
        let mut expression_terms = Vec::new();

        loop {
            // Skip spaces and newlines
            while self.check(&TokenKind::Space) || self.check(&TokenKind::Newline) {
                self.advance();
            }

            // Check for end conditions
            if self.check(&TokenKind::Eof) {
                break;
            }

            // Check if we hit a new agent ID (for multi-agent mode)
            if matches!(self.current_kind(), TokenKind::AgentId(_)) {
                break;
            }

            // Try to parse a definition (lookahead required)
            if let Some(def) = self.try_parse_definition()? {
                definitions.push(def);
            } else {
                // Parse expression term
                let term = self.parse_term()?;
                expression_terms.push(term);
            }
        }

        let expression = if expression_terms.is_empty() {
            Expr::Sequence(vec![])
        } else if expression_terms.len() == 1 {
            expression_terms.pop().unwrap()
        } else {
            Expr::Sequence(expression_terms)
        };

        Ok((definitions, expression))
    }

    /// Try to parse a definition (macro or function).
    /// Returns None if not a definition, without consuming tokens.
    fn try_parse_definition(&mut self) -> Result<Option<Definition>, ParseError> {
        // Definition starts with identifier
        let name = match self.current_kind() {
            TokenKind::Ident(c) => c,
            _ => return Ok(None),
        };

        // Check what follows the identifier using lookahead
        let next_kind = self.peek_nth(1).map(|t| t.kind.clone());

        match next_kind {
            Some(TokenKind::Colon) => {
                // 0-arg function definition: `name ':' expression`
                let def = self.parse_zero_arg_function_def(name)?;
                Ok(Some(Definition::Function(def)))
            }
            Some(TokenKind::LParen) => {
                // Could be function definition or function call
                // Function definition has: name '(' PARAM? ')' ':'
                if self.is_function_definition() {
                    let def = self.parse_function_def(name)?;
                    Ok(Some(Definition::Function(def)))
                } else {
                    Ok(None)
                }
            }
            _ => Ok(None),
        }
    }

    /// Check if the current position is a function definition.
    /// A function definition has the pattern: ident '(' PARAM (',' PARAM)* ')' ':'
    /// Where PARAM is an uppercase letter (TokenKind::Param).
    fn is_function_definition(&mut self) -> bool {
        // Pattern: ident '(' PARAM (',' PARAM)* ')' ':'
        // peek(0): ident (current)
        // peek(1): '('
        // peek(2+): PARAM, optionally followed by ',' PARAM
        // then: ')' ':'

        let t1 = self.peek_nth(1);
        if !matches!(t1.map(|t| &t.kind), Some(TokenKind::LParen)) {
            return false;
        }

        // Scan forward to find ')' and check if ':' follows
        let mut pos = 2;
        loop {
            let token = self.peek_nth(pos);
            match token.map(|t| &t.kind) {
                Some(TokenKind::Param(_)) => {
                    pos += 1;
                }
                Some(TokenKind::Comma) => {
                    pos += 1;
                }
                Some(TokenKind::RParen) => {
                    // Found ')' - check if ':' follows
                    let next = self.peek_nth(pos + 1);
                    return matches!(next.map(|t| &t.kind), Some(TokenKind::Colon));
                }
                _ => {
                    // Not a valid function definition pattern
                    return false;
                }
            }

            // Safety limit to prevent infinite loop
            if pos > 20 {
                return false;
            }
        }
    }

    /// Parse 0-arg function definition: `name ':' expression`
    fn parse_zero_arg_function_def(&mut self, name: char) -> Result<FuncDef, ParseError> {
        let start_span = self.current_span();

        // Advance past name
        self.advance();

        // Expect ':'
        self.expect(&TokenKind::Colon)?;

        // Note: Do NOT skip space here - body ends at space
        // Parse body expression (until space, next definition, or end of line)
        let body = self.parse_expression_until_definition()?;

        let span = Span::new(
            start_span.start,
            body.span().end,
            start_span.line,
            start_span.column,
        );

        // 0-arg function has no parameters, so no type inference needed
        Ok(FuncDef {
            name,
            params: vec![],
            param_types: HashMap::new(),
            body,
            span,
        })
    }

    /// Parse function definition: `name '(' param_list? ')' ':' expression`
    fn parse_function_def(&mut self, name: char) -> Result<FuncDef, ParseError> {
        let start_span = self.current_span();

        // Advance past name
        self.advance();

        // Expect '('
        self.expect(&TokenKind::LParen)?;

        // Parse parameters (comma-separated, may be empty)
        let mut params = Vec::new();
        if !self.check(&TokenKind::RParen) {
            loop {
                // Expect parameter
                let param = match self.current_kind() {
                    TokenKind::Param(p) => p,
                    _ => {
                        return Err(ParseError::unexpected_token(
                            "parameter (uppercase letter)",
                            self.current_kind().description(),
                            self.current_span(),
                        ));
                    }
                };
                self.advance();
                params.push(param);

                // Check for comma (more params) or RParen (end of params)
                if self.check(&TokenKind::Comma) {
                    self.advance();
                } else {
                    break;
                }
            }
        }

        // Expect ')'
        self.expect(&TokenKind::RParen)?;

        // Expect ':'
        self.expect(&TokenKind::Colon)?;

        // Note: Do NOT skip space here - body ends at space
        // Parse body expression (until space, next definition, or end of line)
        let body = self.parse_expression_until_definition()?;

        let span = Span::new(
            start_span.start,
            body.span().end,
            start_span.line,
            start_span.column,
        );

        // Infer parameter types from body usage
        let param_types = Self::infer_param_types(&params, &body)?;

        Ok(FuncDef {
            name,
            params,
            param_types,
            body,
            span,
        })
    }

    /// Infer parameter types by analyzing their usage in the function body.
    /// - PARAM as term (alone) → CmdSeq
    /// - PARAM in num_expr (X-1, X+2) → Int
    /// - Both usages → Error (E010)
    fn infer_param_types(
        params: &[char],
        body: &Expr,
    ) -> Result<HashMap<char, ParamType>, ParseError> {
        let mut types: HashMap<char, Option<ParamType>> = HashMap::new();

        // Initialize all params as unknown
        for &p in params {
            types.insert(p, None);
        }

        // Analyze body to infer types
        Self::analyze_expr_for_types(body, &mut types)?;

        // Convert to final types (default to CmdSeq if not used)
        let mut result = HashMap::new();
        for &p in params {
            let ty = types
                .get(&p)
                .copied()
                .flatten()
                .unwrap_or(ParamType::CmdSeq);
            result.insert(p, ty);
        }

        Ok(result)
    }

    /// Analyze expression to infer parameter types.
    fn analyze_expr_for_types(
        expr: &Expr,
        types: &mut HashMap<char, Option<ParamType>>,
    ) -> Result<(), ParseError> {
        match expr {
            Expr::Primitive(_, _) => Ok(()),
            Expr::Param(p, span) => {
                // Param used as term → CmdSeq
                Self::mark_param_type(types, *p, ParamType::CmdSeq, *span)
            }
            Expr::FuncCall { args, .. } => {
                for arg in args {
                    Self::analyze_arg_for_types(arg, types)?;
                }
                Ok(())
            }
            Expr::Sequence(exprs) => {
                for e in exprs {
                    Self::analyze_expr_for_types(e, types)?;
                }
                Ok(())
            }
        }
    }

    /// Analyze argument to infer parameter types.
    fn analyze_arg_for_types(
        arg: &Arg,
        types: &mut HashMap<char, Option<ParamType>>,
    ) -> Result<(), ParseError> {
        match arg {
            Arg::Command(expr) => Self::analyze_expr_for_types(expr, types),
            Arg::Number(_, _) => Ok(()),
            Arg::NumExpr { first, rest, span } => {
                // Params in num_expr → Int
                if let NumAtom::Param(p) = first {
                    Self::mark_param_type(types, *p, ParamType::Int, *span)?;
                }
                for (_, atom) in rest {
                    if let NumAtom::Param(p) = atom {
                        Self::mark_param_type(types, *p, ParamType::Int, *span)?;
                    }
                }
                Ok(())
            }
        }
    }

    /// Mark a parameter's type, checking for conflicts.
    fn mark_param_type(
        types: &mut HashMap<char, Option<ParamType>>,
        param: char,
        new_type: ParamType,
        span: Span,
    ) -> Result<(), ParseError> {
        if let Some(current) = types.get_mut(&param) {
            match current {
                None => {
                    *current = Some(new_type);
                    Ok(())
                }
                Some(existing) if *existing == new_type => Ok(()),
                Some(_) => {
                    // Type conflict: E010
                    Err(ParseError::new(
                        format!(
                            "[E010] Type conflict for parameter '{}': used as both CmdSeq and Int",
                            param
                        ),
                        span,
                    ))
                }
            }
        } else {
            // Not a defined parameter, ignore (will be caught elsewhere)
            Ok(())
        }
    }

    /// Parse expression until we hit Space, definition start, or end of line.
    /// This is used for parsing definition bodies.
    fn parse_expression_until_definition(&mut self) -> Result<Expr, ParseError> {
        let mut terms = Vec::new();

        while !self.is_at_end_of_line() {
            // Space terminates definition body
            if self.check(&TokenKind::Space) {
                break;
            }

            // Check if this looks like a definition start
            if let TokenKind::Ident(_) = self.current_kind() {
                // Check for macro definition: ident ':'
                if matches!(self.peek_nth(1).map(|t| &t.kind), Some(TokenKind::Colon)) {
                    break;
                }
                // Check for function definition: ident '(' PARAM ')' ':'
                if self.is_function_definition() {
                    break;
                }
            }

            let term = self.parse_term()?;
            terms.push(term);
        }

        Ok(if terms.is_empty() {
            Expr::Sequence(vec![])
        } else if terms.len() == 1 {
            terms.pop().unwrap()
        } else {
            Expr::Sequence(terms)
        })
    }

    /// Parse a single term.
    fn parse_term(&mut self) -> Result<Expr, ParseError> {
        let span = self.current_span();

        match self.current_kind() {
            TokenKind::Straight => {
                self.advance();
                Ok(Expr::Primitive(Primitive::Straight, span))
            }
            TokenKind::Right => {
                self.advance();
                Ok(Expr::Primitive(Primitive::Right, span))
            }
            TokenKind::Left => {
                self.advance();
                Ok(Expr::Primitive(Primitive::Left, span))
            }
            TokenKind::Ident(name) => {
                // Check if this is a function call with parentheses
                if matches!(self.peek_nth(1).map(|t| &t.kind), Some(TokenKind::LParen)) {
                    self.parse_function_call(name)
                } else {
                    // 0-arg function call (unified model - no separate macro/ident concept)
                    self.advance();
                    Ok(Expr::FuncCall {
                        name,
                        args: vec![],
                        span,
                    })
                }
            }
            TokenKind::Param(name) => {
                self.advance();
                Ok(Expr::Param(name, span))
            }
            TokenKind::LParen => {
                // Grouped expression
                self.advance();
                let expr = self.parse_expression_until(&TokenKind::RParen)?;
                self.expect(&TokenKind::RParen)?;
                Ok(expr)
            }
            _ => Err(ParseError::unexpected_token(
                "'s', 'r', 'l', identifier, or '('",
                self.current_kind().description(),
                span,
            )),
        }
    }

    /// Parse function call with typed arguments: `name '(' args ')'`
    /// Arguments can be:
    /// - Command expression (e.g., srl, XXX)
    /// - Number literal (e.g., 4)
    /// - Numeric expression (e.g., X-1, X+2)
    fn parse_function_call(&mut self, name: char) -> Result<Expr, ParseError> {
        let start_span = self.current_span();

        // Advance past name
        self.advance();

        // Expect '('
        self.expect(&TokenKind::LParen)?;

        // Parse arguments
        let args = self.parse_function_args()?;

        // Expect ')'
        let end_span = self.current_span();
        self.expect(&TokenKind::RParen)?;

        let span = Span::new(
            start_span.start,
            end_span.end,
            start_span.line,
            start_span.column,
        );

        // Unified FuncCall (v0.5.0 - no separate FuncCallArgs)
        Ok(Expr::FuncCall { name, args, span })
    }

    /// Parse function arguments separated by commas.
    fn parse_function_args(&mut self) -> Result<Vec<Arg>, ParseError> {
        let mut args = Vec::new();

        if self.check(&TokenKind::RParen) {
            return Ok(args); // Empty args
        }

        loop {
            let arg = self.parse_function_arg()?;
            args.push(arg);

            if self.check(&TokenKind::Comma) {
                self.advance();
            } else {
                break;
            }
        }

        Ok(args)
    }

    /// Parse a single function argument.
    ///
    /// HOJ-compatible argument parsing:
    /// - If starts with NUMBER or PARAM followed by +/-, parse as num_expr
    /// - Otherwise, parse as command expression
    fn parse_function_arg(&mut self) -> Result<Arg, ParseError> {
        let span = self.current_span();

        match self.current_kind() {
            TokenKind::Minus => {
                // Negative number: -N (H2 extension, not HOJ-compatible)
                // Could be start of num_expr: -3+2
                self.advance();
                if let TokenKind::Number(n) = self.current_kind() {
                    let end_span = self.current_span();
                    self.advance();
                    let neg_span = Span::new(span.start, end_span.end, span.line, span.column);

                    // Check if more ops follow (e.g., -3+2)
                    if matches!(self.current_kind(), TokenKind::Plus | TokenKind::Minus) {
                        // Extended num_expr: -3+2...
                        self.parse_extended_num_expr(NumAtom::Number(-n), neg_span)
                    } else {
                        Ok(Arg::Number(-n, neg_span))
                    }
                } else {
                    Err(ParseError::unexpected_token(
                        "number after '-'",
                        self.current_kind().description(),
                        self.current_span(),
                    ))
                }
            }
            TokenKind::Number(n) => {
                self.advance();
                let next = self.current_kind();

                // Check if this is a num_expr: 10-3+1
                if matches!(next, TokenKind::Plus | TokenKind::Minus) {
                    self.parse_extended_num_expr(NumAtom::Number(n), span)
                } else {
                    Ok(Arg::Number(n, span))
                }
            }
            TokenKind::Param(p) => {
                // Check if this is a numeric expression (e.g., X-1, X+2)
                let next = self.peek_nth(1).map(|t| t.kind.clone());
                match next {
                    Some(TokenKind::Plus) | Some(TokenKind::Minus) => {
                        self.advance(); // consume param
                        self.parse_extended_num_expr(NumAtom::Param(p), span)
                    }
                    _ => {
                        // Parse as command expression (handles AA, AB, etc.)
                        let expr = self.parse_arg_expression()?;
                        Ok(Arg::Command(expr))
                    }
                }
            }
            _ => {
                // Parse as command expression
                let expr = self.parse_arg_expression()?;
                Ok(Arg::Command(expr))
            }
        }
    }

    /// Parse extended numeric expression: `first (('+' | '-') num_atom)*`
    ///
    /// HOJ supports: 10-3+1, X-1+2, etc.
    fn parse_extended_num_expr(
        &mut self,
        first: NumAtom,
        start_span: Span,
    ) -> Result<Arg, ParseError> {
        let mut rest = Vec::new();
        let mut end_span = start_span;

        // Parse (('+' | '-') num_atom)*
        while matches!(self.current_kind(), TokenKind::Plus | TokenKind::Minus) {
            let op = if self.check(&TokenKind::Plus) {
                NumOp::Add
            } else {
                NumOp::Sub
            };
            self.advance(); // consume + or -

            // Parse num_atom: NUMBER or PARAM
            let atom = match self.current_kind() {
                TokenKind::Number(n) => {
                    end_span = self.current_span();
                    self.advance();
                    NumAtom::Number(n)
                }
                TokenKind::Param(p) => {
                    end_span = self.current_span();
                    self.advance();
                    NumAtom::Param(p)
                }
                _ => {
                    return Err(ParseError::unexpected_token(
                        "number or parameter",
                        self.current_kind().description(),
                        self.current_span(),
                    ));
                }
            };

            rest.push((op, atom));
        }

        let span = Span::new(
            start_span.start,
            end_span.end,
            start_span.line,
            start_span.column,
        );

        Ok(Arg::NumExpr { first, rest, span })
    }

    /// Parse argument expression (until comma or rparen).
    fn parse_arg_expression(&mut self) -> Result<Expr, ParseError> {
        let mut terms = Vec::new();

        while !self.check(&TokenKind::RParen)
            && !self.check(&TokenKind::Comma)
            && !self.is_at_end_of_line()
        {
            let term = self.parse_term()?;
            terms.push(term);
        }

        Ok(if terms.is_empty() {
            Expr::Sequence(vec![])
        } else if terms.len() == 1 {
            terms.pop().unwrap()
        } else {
            Expr::Sequence(terms)
        })
    }

    /// Parse expression until a specific token.
    fn parse_expression_until(&mut self, end_token: &TokenKind) -> Result<Expr, ParseError> {
        let mut terms = Vec::new();

        while !self.check(end_token) && !self.is_at_end_of_line() {
            // Skip spaces within expressions (e.g., function arguments)
            self.skip_space();
            if self.check(end_token) || self.is_at_end_of_line() {
                break;
            }
            let term = self.parse_term()?;
            terms.push(term);
        }

        Ok(if terms.is_empty() {
            Expr::Sequence(vec![])
        } else if terms.len() == 1 {
            terms.pop().unwrap()
        } else {
            Expr::Sequence(terms)
        })
    }
}

#[cfg(test)]
mod tests {
    use super::*;

    #[test]
    fn test_simple_program() {
        let mut parser = Parser::new("0: srl").unwrap();
        let program = parser.parse_program().unwrap();

        assert_eq!(program.agents.len(), 1);
        assert_eq!(program.agents[0].id, 0);
    }

    #[test]
    fn test_multiple_agents() {
        let mut parser = Parser::new("0: srl\n1: lrs").unwrap();
        let program = parser.parse_program().unwrap();

        assert_eq!(program.agents.len(), 2);
        assert_eq!(program.agents[0].id, 0);
        assert_eq!(program.agents[1].id, 1);
    }

    #[test]
    fn test_macro_definition() {
        let mut parser = Parser::new("0: x:ss xrx").unwrap();
        let program = parser.parse_program().unwrap();

        assert_eq!(program.agents[0].definitions.len(), 1);
        assert_eq!(program.agents[0].definitions[0].name(), 'x');
    }

    #[test]
    fn test_function_definition() {
        let mut parser = Parser::new("0: f(X):XXX f(s)").unwrap();
        let program = parser.parse_program().unwrap();

        assert_eq!(program.agents[0].definitions.len(), 1);
        if let Definition::Function(f) = &program.agents[0].definitions[0] {
            assert_eq!(f.name, 'f');
            assert_eq!(f.params, vec!['X']);
        } else {
            panic!("Expected function definition");
        }
    }

    #[test]
    fn test_nested_function_call() {
        let mut parser = Parser::new("0: f(X):XXX f(f(s))").unwrap();
        let program = parser.parse_program().unwrap();

        // Should parse successfully
        assert_eq!(program.agents.len(), 1);
    }

    #[test]
    fn test_empty_expression() {
        let mut parser = Parser::new("0: x:ss").unwrap();
        let program = parser.parse_program().unwrap();

        // Macro definition only, empty expression
        assert_eq!(program.agents[0].definitions.len(), 1);
        assert!(program.agents[0].expression.is_empty());
    }

    #[test]
    fn test_function_call_not_definition() {
        // f(s) should be parsed as a function call, not a definition
        // because 's' is lowercase (not a Param)
        let mut parser = Parser::new("0: f(X):X f(s)").unwrap();
        let program = parser.parse_program().unwrap();

        // One function definition, one expression (function call)
        assert_eq!(program.agents[0].definitions.len(), 1);
        assert!(!program.agents[0].expression.is_empty());
    }

    #[test]
    fn test_multiple_definitions() {
        let mut parser = Parser::new("0: x:ss f(X):XX xf(s)").unwrap();
        let program = parser.parse_program().unwrap();

        // Two definitions: macro x and function f
        assert_eq!(program.agents[0].definitions.len(), 2);
    }

    #[test]
    fn test_numeric_argument() {
        // HOJ: a(4) - numeric argument
        let mut parser = Parser::new("0: a(X):sa(X-1) a(4)").unwrap();
        let program = parser.parse_program().unwrap();

        assert_eq!(program.agents[0].definitions.len(), 1);
        // Expression should be a function call with numeric arg
        if let Expr::FuncCall { name, args, .. } = &program.agents[0].expression {
            assert_eq!(*name, 'a');
            assert_eq!(args.len(), 1);
            assert!(matches!(args[0], Arg::Number(4, _)));
        } else {
            panic!("Expected FuncCall");
        }
    }

    #[test]
    fn test_numeric_expression_arg() {
        // HOJ: a(X-1) - numeric expression argument
        let mut parser = Parser::new("0: a(X-1)").unwrap();
        let program = parser.parse_program().unwrap();

        if let Expr::FuncCall { args, .. } = &program.agents[0].expression {
            assert_eq!(args.len(), 1);
            if let Arg::NumExpr { first, rest, .. } = &args[0] {
                assert_eq!(first, &NumAtom::Param('X'));
                assert_eq!(rest.len(), 1);
                assert_eq!(rest[0], (NumOp::Sub, NumAtom::Number(1)));
            } else {
                panic!("Expected NumExpr");
            }
        } else {
            panic!("Expected FuncCall");
        }
    }

    #[test]
    fn test_numeric_expression_plus() {
        // HOJ: a(X+2)
        let mut parser = Parser::new("0: a(X+2)").unwrap();
        let program = parser.parse_program().unwrap();

        if let Expr::FuncCall { args, .. } = &program.agents[0].expression {
            if let Arg::NumExpr { first, rest, .. } = &args[0] {
                assert_eq!(first, &NumAtom::Param('X'));
                assert_eq!(rest.len(), 1);
                assert_eq!(rest[0], (NumOp::Add, NumAtom::Number(2)));
            } else {
                panic!("Expected NumExpr");
            }
        } else {
            panic!("Expected FuncCall");
        }
    }

    #[test]
    fn test_extended_num_expr_chain() {
        // HOJ: a(10-3+1) = 8
        let mut parser = Parser::new("0: a(10-3+1)").unwrap();
        let program = parser.parse_program().unwrap();

        if let Expr::FuncCall { args, .. } = &program.agents[0].expression {
            if let Arg::NumExpr { first, rest, .. } = &args[0] {
                assert_eq!(first, &NumAtom::Number(10));
                assert_eq!(rest.len(), 2);
                assert_eq!(rest[0], (NumOp::Sub, NumAtom::Number(3)));
                assert_eq!(rest[1], (NumOp::Add, NumAtom::Number(1)));
            } else {
                panic!("Expected NumExpr");
            }
        } else {
            panic!("Expected FuncCall");
        }
    }

    #[test]
    fn test_extended_num_expr_with_param() {
        // HOJ: a(X-1+2)
        let mut parser = Parser::new("0: a(X-1+2)").unwrap();
        let program = parser.parse_program().unwrap();

        if let Expr::FuncCall { args, .. } = &program.agents[0].expression {
            if let Arg::NumExpr { first, rest, .. } = &args[0] {
                assert_eq!(first, &NumAtom::Param('X'));
                assert_eq!(rest.len(), 2);
                assert_eq!(rest[0], (NumOp::Sub, NumAtom::Number(1)));
                assert_eq!(rest[1], (NumOp::Add, NumAtom::Number(2)));
            } else {
                panic!("Expected NumExpr");
            }
        } else {
            panic!("Expected FuncCall");
        }
    }

    #[test]
    fn test_multiple_arguments() {
        // HOJ: a(4,s) - multiple arguments
        let mut parser = Parser::new("0: a(4,s)").unwrap();
        let program = parser.parse_program().unwrap();

        if let Expr::FuncCall { args, .. } = &program.agents[0].expression {
            assert_eq!(args.len(), 2);
            assert!(matches!(args[0], Arg::Number(4, _)));
            if let Arg::Command(Expr::Primitive(Primitive::Straight, _)) = &args[1] {
                // OK
            } else {
                panic!("Expected Command(Straight)");
            }
        } else {
            panic!("Expected FuncCall");
        }
    }

    #[test]
    fn test_complex_hoj_example() {
        // HOJ: a(X,Y):Ya(X-1,Y) a(4,s)
        let mut parser = Parser::new("0: a(X,Y):Ya(X-1,Y) a(4,s)").unwrap();
        let program = parser.parse_program().unwrap();

        // Should have one function definition
        assert_eq!(program.agents[0].definitions.len(), 1);
        // Expression should be function call with two args
        if let Expr::FuncCall { name, args, .. } = &program.agents[0].expression {
            assert_eq!(*name, 'a');
            assert_eq!(args.len(), 2);
        } else {
            panic!("Expected FuncCall");
        }
    }

    #[test]
    fn test_command_expression_arg() {
        // HOJ: f(srl) - command expression argument
        let mut parser = Parser::new("0: f(srl)").unwrap();
        let program = parser.parse_program().unwrap();

        if let Expr::FuncCall { args, .. } = &program.agents[0].expression {
            assert_eq!(args.len(), 1);
            if let Arg::Command(Expr::Sequence(exprs)) = &args[0] {
                assert_eq!(exprs.len(), 3);
            } else {
                panic!("Expected Command(Sequence)");
            }
        } else {
            panic!("Expected FuncCall");
        }
    }

    // =============================================================================
    // Agent Prefix Optional Tests (Single Agent)
    // =============================================================================

    #[test]
    fn test_no_agent_prefix_simple() {
        // Single agent without "0:" prefix
        let mut parser = Parser::new("srl").unwrap();
        let program = parser.parse_program().unwrap();

        assert_eq!(program.agents.len(), 1);
        assert_eq!(program.agents[0].id, 0);
    }

    #[test]
    fn test_no_agent_prefix_with_macro() {
        // Macro definition without agent prefix
        let mut parser = Parser::new("x:ss xrx").unwrap();
        let program = parser.parse_program().unwrap();

        assert_eq!(program.agents.len(), 1);
        assert_eq!(program.agents[0].id, 0);
        assert_eq!(program.agents[0].definitions.len(), 1);
    }

    #[test]
    fn test_no_agent_prefix_with_function() {
        // Function definition without agent prefix
        let mut parser = Parser::new("f(X):XXXX f(sssr)").unwrap();
        let program = parser.parse_program().unwrap();

        assert_eq!(program.agents.len(), 1);
        assert_eq!(program.agents[0].id, 0);
        assert_eq!(program.agents[0].definitions.len(), 1);
    }

    #[test]
    fn test_no_agent_prefix_multiline() {
        // Multiple lines without agent prefix are allowed
        // All lines are treated as the same agent (agent 0)
        let mut parser = Parser::new("srl\nlrs").unwrap();
        let program = parser.parse_program().unwrap();

        assert_eq!(program.agents.len(), 1);
        assert_eq!(program.agents[0].id, 0);
        // srl + lrs = 6 commands total
    }

    #[test]
    fn test_no_agent_prefix_macro_multiline() {
        // Macro definition on one line, usage on next line
        let mut parser = Parser::new("a:ssrs\naaaaaaaaaa").unwrap();
        let program = parser.parse_program().unwrap();

        assert_eq!(program.agents.len(), 1);
        assert_eq!(program.agents[0].id, 0);
        assert_eq!(program.agents[0].definitions.len(), 1);
    }

    #[test]
    fn test_mixed_prefix_and_no_prefix() {
        // If first line has prefix, it's multi-agent mode
        let mut parser = Parser::new("0: srl\n1: lrs").unwrap();
        let program = parser.parse_program().unwrap();
        assert_eq!(program.agents.len(), 2);
    }

    #[test]
    fn test_agent_with_multiline_code() {
        // Agent 0 has code spanning multiple lines
        // Agent 1 has single line
        let mut parser = Parser::new("0: a:ssrs\naaaa\n1: srl").unwrap();
        let program = parser.parse_program().unwrap();

        assert_eq!(program.agents.len(), 2);
        assert_eq!(program.agents[0].id, 0);
        assert_eq!(program.agents[0].definitions.len(), 1); // macro a
        assert_eq!(program.agents[1].id, 1);
    }

    #[test]
    fn test_agent_with_multiline_code_trailing() {
        // Agent 0 code, then Agent 1 code with trailing lines
        let mut parser = Parser::new("0: srl\n1: a:ss\naaaa").unwrap();
        let program = parser.parse_program().unwrap();

        assert_eq!(program.agents.len(), 2);
        assert_eq!(program.agents[0].id, 0);
        assert_eq!(program.agents[1].id, 1);
        assert_eq!(program.agents[1].definitions.len(), 1); // macro a
    }

    // =============================================================================
    // Directive Parsing Tests (including indented directives)
    // =============================================================================

    #[test]
    fn test_indented_directive() {
        // Directive with leading space should be parsed correctly
        let mut parser = Parser::new("  MAX_STEP=100\n0: srl").unwrap();
        let program = parser.parse_program().unwrap();

        assert_eq!(program.directives.len(), 1);
        assert_eq!(program.directives[0].name, "MAX_STEP");
        assert_eq!(program.limits.max_step, 100);
    }

    #[test]
    fn test_multiple_directives_with_spaces() {
        // Multiple directives with various spacing
        let mut parser = Parser::new("  MAX_STEP=50\n  ON_LIMIT=TRUNCATE\n0: srl").unwrap();
        let program = parser.parse_program().unwrap();

        assert_eq!(program.directives.len(), 2);
        assert_eq!(program.limits.max_step, 50);
        assert_eq!(program.limits.on_limit, OnLimitBehavior::Truncate);
    }

    #[test]
    fn test_directive_without_spaces() {
        // Directive without leading space still works
        let mut parser = Parser::new("MAX_STEP=200\n0: srl").unwrap();
        let program = parser.parse_program().unwrap();

        assert_eq!(program.directives.len(), 1);
        assert_eq!(program.limits.max_step, 200);
    }

    #[test]
    fn test_directive_default_on_limit_with_directive() {
        // When directive is specified but ON_LIMIT is not, default to Error
        let mut parser = Parser::new("MAX_STEP=100\n0: srl").unwrap();
        let program = parser.parse_program().unwrap();

        assert_eq!(program.limits.on_limit, OnLimitBehavior::Error);
    }

    #[test]
    fn test_no_directive_default_on_limit() {
        // When no directive is specified, default to Truncate (HOJ compatibility)
        let mut parser = Parser::new("0: srl").unwrap();
        let program = parser.parse_program().unwrap();

        assert_eq!(program.limits.on_limit, OnLimitBehavior::Truncate);
    }
}