-
-
Notifications
You must be signed in to change notification settings - Fork 6
Expand file tree
/
Copy pathantlr_parser.jl
More file actions
1316 lines (1111 loc) · 43 KB
/
Copy pathantlr_parser.jl
File metadata and controls
1316 lines (1111 loc) · 43 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
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
# ANTLR4 Parser Integration for BaseModelica
# This module uses PythonCall to interface with the ANTLR-generated Python parser
# Flag to track if ANTLR parser is initialized
const ANTLR_INITIALIZED = Ref(false)
# Python module references (will be populated during initialization)
const antlr4 = Ref{Py}()
const BaseModelicaLexer = Ref{Py}()
const BaseModelicaParser = Ref{Py}()
const BaseModelicaVisitor = Ref{Py}()
"""
init_antlr_parser()
Initialize the ANTLR4 parser by loading the necessary Python modules.
**Note**: You typically don't need to call this explicitly - the parser
automatically initializes itself on first use (lazy initialization).
This function is exported mainly for pre-loading or troubleshooting.
# Example
```julia
using BaseModelica
# Option 1: Lazy initialization (recommended)
parse_file_antlr("model.bmo") # Initializes automatically
# Option 2: Explicit initialization
BaseModelica.init_antlr_parser() # Pre-load the parser
parse_file_antlr("model.bmo")
```
"""
function init_antlr_parser()
if ANTLR_INITIALIZED[]
@info "ANTLR parser already initialized"
return
end
return try
# Get the path to the generated parser directory
base_dir = dirname(dirname(@__FILE__))
parser_dir = joinpath(base_dir, "src", "antlr_generated")
# Check if generated parser exists
if !isdir(parser_dir)
error(
"Generated parser not found at: $parser_dir\n" *
"Please run: ./build_parser.sh"
)
end
# Import ANTLR4 runtime
antlr4[] = pyimport("antlr4")
# Add parser directory to Python's sys.path so we can import the modules
# The generated files are in the grammar subdirectory
py_sys = pyimport("sys")
sys_path_list = py_sys.path
# Check if grammar_dir is already in sys.path, if not add it
if pyconvert(Bool, parser_dir ∉ sys_path_list)
sys_path_list.insert(0, parser_dir)
end
# Import generated parser modules by module name
BaseModelicaLexer[] = pyimport("BaseModelicaLexer").BaseModelicaLexer
BaseModelicaParser[] = pyimport("BaseModelicaParser").BaseModelicaParser
BaseModelicaVisitor[] = pyimport("BaseModelicaVisitor").BaseModelicaVisitor
@info "ANTLR parser initialized successfully"
ANTLR_INITIALIZED[] = true
catch e
@error "Failed to initialize ANTLR parser" exception = e
@info """
The ANTLR parser requires:
1. Generated parser files (run: cd grammar && ./build_parser.sh)
2. Python dependencies (managed automatically by CondaPkg.jl)
If you're seeing import errors, the Python dependencies should be installed
automatically. Try restarting Julia to trigger CondaPkg installation.
"""
rethrow(e)
end
end
"""
parse_with_antlr(input::String) -> Py
Parse BaseModelica source code using the ANTLR4 parser.
Returns the ANTLR parse tree as a Python object.
The parser is automatically initialized on first use (lazy initialization),
so you don't need to call `init_antlr_parser()` explicitly.
# Arguments
- `input::String`: The BaseModelica source code to parse
# Returns
- A Python object representing the ANTLR parse tree
# Example
```julia
source = read("model.bmo", String)
parse_tree = parse_with_antlr(source) # Automatically initializes parser on first call
```
"""
function parse_with_antlr(input::String)
# Lazy initialization - automatically initialize on first use
if !ANTLR_INITIALIZED[]
init_antlr_parser()
end
try
# Create an input stream from the string
input_stream = antlr4[].InputStream(input)
# Create lexer
lexer = BaseModelicaLexer[](input_stream)
# Create token stream
token_stream = antlr4[].CommonTokenStream(lexer)
# Create parser
parser = BaseModelicaParser[](token_stream)
# Parse starting from the root rule (baseModelica)
parse_tree = parser.baseModelica()
return parse_tree
catch e
@error "Parsing failed" exception = e
rethrow(e)
end
end
"""
antlr_tree_to_ast(parse_tree::Py) -> BaseModelicaPackage
Convert an ANTLR parse tree to BaseModelica AST types.
This is where the bridge between ANTLR and BaseModelica AST happens.
# Arguments
- `parse_tree::Py`: The ANTLR parse tree from `parse_with_antlr`
# Returns
- A `BaseModelicaPackage` instance (BaseModelica AST)
# Example
```julia
source = read("model.bmo", String)
parse_tree = parse_with_antlr(source)
ast = antlr_tree_to_ast(parse_tree)
```
"""
function antlr_tree_to_ast(parse_tree::Py)
visitor = ASTBuilderVisitor()
return visit_baseModelica(visitor, parse_tree)
end
"""
ASTBuilderVisitor
Visitor implementation that traverses ANTLR parse tree and constructs BaseModelica AST nodes.
This struct holds any state needed during tree traversal.
"""
struct ASTBuilderVisitor end
# Helper function to get text from a terminal node or context
function get_text(ctx::Py)
text = pyconvert(String, ctx.getText())
# Strip surrounding single quotes for quoted identifiers (Q_IDENT)
if startswith(text, "'") && endswith(text, "'") && length(text) > 2
return text[2:(end - 1)]
end
return text
end
# Helper function to check if a context is nothing/null
function is_null(ctx::Py)
return pyconvert(Bool, ctx == pybuiltins.None)
end
# Root rule visitor
function visit_baseModelica(visitor::ASTBuilderVisitor, ctx::Py)
# baseModelica: versionHeader 'package' IDENT
# (decoration? classDefinition ';' | decoration? globalConstant ';')*
# decoration? 'model' longClassSpecifier ';'
# (annotationComment ';')?
# 'end' IDENT ';'
package_name = get_text(ctx.IDENT(0)) # First IDENT is package name
# Collect class definitions and global constants
class_defs = []
# Get classDefinition contexts
class_def_ctxs = ctx.classDefinition()
if !is_null(class_def_ctxs)
for class_def_ctx in class_def_ctxs
push!(class_defs, visit_classDefinition(visitor, class_def_ctx))
end
end
# Get globalConstant contexts
global_const_ctxs = ctx.globalConstant()
if !is_null(global_const_ctxs)
for const_ctx in global_const_ctxs
push!(class_defs, visit_globalConstant(visitor, const_ctx))
end
end
# Get the main model
model = visit_longClassSpecifier(visitor, ctx.longClassSpecifier())
model_ast = BaseModelicaModel(model)
return BaseModelicaPackage(package_name, class_defs, model_ast)
end
# Class Definition visitors
function visit_classDefinition(visitor::ASTBuilderVisitor, ctx::Py)
# classDefinition: classPrefixes classSpecifier
class_type = get_text(ctx.classPrefixes())
class_spec = visit_classSpecifier(visitor, ctx.classSpecifier())
return BaseModelicaClassDefinition(class_type, class_spec)
end
function visit_classSpecifier(visitor::ASTBuilderVisitor, ctx::Py)
if !is_null(ctx.longClassSpecifier())
return visit_longClassSpecifier(visitor, ctx.longClassSpecifier())
elseif !is_null(ctx.shortClassSpecifier())
return visit_shortClassSpecifier(visitor, ctx.shortClassSpecifier())
elseif !is_null(ctx.derClassSpecifier())
return visit_derClassSpecifier(visitor, ctx.derClassSpecifier())
end
end
function visit_longClassSpecifier(visitor::ASTBuilderVisitor, ctx::Py)
# longClassSpecifier: IDENT stringComment composition 'end' IDENT
name = get_text(ctx.IDENT(0))
description = visit_stringComment(visitor, ctx.stringComment())
composition = visit_composition(visitor, ctx.composition())
return BaseModelicaLongClass(name, description, composition)
end
function visit_shortClassSpecifier(visitor::ASTBuilderVisitor, ctx::Py)
# For now, return a placeholder - can be expanded later
name = get_text(ctx.IDENT())
return BaseModelicaLongClass(name, "", BaseModelicaComposition([], [], [], [], nothing, []))
end
function visit_derClassSpecifier(visitor::ASTBuilderVisitor, ctx::Py)
# For now, return a placeholder - can be expanded later
name = get_text(ctx.IDENT(0))
return BaseModelicaLongClass(name, "", BaseModelicaComposition([], [], [], [], nothing, []))
end
function visit_globalConstant(visitor::ASTBuilderVisitor, ctx::Py)
# globalConstant: 'constant' typeSpecifier arraySubscripts? declaration comment
type_spec = visit_typeSpecifier(visitor, ctx.typeSpecifier())
decl = visit_declaration(visitor, ctx.declaration())
comment_text = visit_comment(visitor, ctx.comment())
# Extract name and modification from declaration
name = decl.ident
modification = decl.modification
# Get value from modification if present
value = nothing
if !isnothing(modification)
value = modification.expr
end
return BaseModelicaConstant(type_spec, name, value, comment_text, modification)
end
# Composition visitor
function visit_composition(visitor::ASTBuilderVisitor, ctx::Py)
# composition: (decoration? genericElement ';')*
# ('equation' (equation ';')*
# | 'initial' 'equation' (initialEquation ';')*
# | 'initial'? 'algorithm' (statement ';')*)*
# ...
components = []
equations = []
initial_equations = []
parameter_equations = []
# Get generic elements (components and parameter equations)
generic_elems = ctx.genericElement()
if !is_null(generic_elems)
for elem_ctx in generic_elems
elem = visit_genericElement(visitor, elem_ctx)
if elem isa BaseModelicaParameterEquation
push!(parameter_equations, elem)
else
push!(components, elem)
end
end
end
# Get equations
equation_ctxs = ctx.equation()
if !is_null(equation_ctxs)
for eq_ctx in equation_ctxs
eq = visit_equation(visitor, eq_ctx)
if !isnothing(eq)
push!(equations, eq)
end
end
end
# Get initial equations
initial_eq_ctxs = ctx.initialEquation()
if !is_null(initial_eq_ctxs)
for init_eq_ctx in initial_eq_ctxs
eq = visit_initialEquation(visitor, init_eq_ctx)
if !isnothing(eq)
push!(initial_equations, eq)
end
end
end
# Get annotation comment at the end of composition
annotation = nothing
annotation_ctx = ctx.annotationComment()
if !is_null(annotation_ctx)
# Handle both single and list cases
if pyconvert(Bool, pybuiltins.hasattr(annotation_ctx, "__iter__"))
# Multiple annotations - take the last one
if pyconvert(Int, pybuiltins.len(annotation_ctx)) > 0
annotation = visit_annotationComment(visitor, annotation_ctx[pyconvert(Int, pybuiltins.len(annotation_ctx)) - 1])
end
else
# Single annotation
annotation = visit_annotationComment(visitor, annotation_ctx)
end
end
# Get clock base partitions
base_partitions = []
partition_ctxs = ctx.basePartition()
if !is_null(partition_ctxs)
if pyconvert(Bool, pybuiltins.hasattr(partition_ctxs, "__iter__"))
for partition_ctx in partition_ctxs
partition = visit_basePartition(visitor, partition_ctx)
if !isnothing(partition)
push!(base_partitions, partition)
end
end
else
partition = visit_basePartition(visitor, partition_ctxs)
if !isnothing(partition)
push!(base_partitions, partition)
end
end
end
return BaseModelicaComposition(components, equations, initial_equations, parameter_equations, annotation, base_partitions)
end
function visit_basePartition(visitor::ASTBuilderVisitor, ctx::Py)
# basePartition: 'partition' stringComment (annotationComment ';')? (clockClause ';')* subPartition*
clock_clauses = []
clock_clause_ctxs = ctx.clockClause()
if !is_null(clock_clause_ctxs)
if pyconvert(Bool, pybuiltins.hasattr(clock_clause_ctxs, "__iter__"))
for cc_ctx in clock_clause_ctxs
push!(clock_clauses, visit_clockClause(visitor, cc_ctx))
end
else
push!(clock_clauses, visit_clockClause(visitor, clock_clause_ctxs))
end
end
sub_partitions = []
sub_partition_ctxs = ctx.subPartition()
if !is_null(sub_partition_ctxs)
if pyconvert(Bool, pybuiltins.hasattr(sub_partition_ctxs, "__iter__"))
for sp_ctx in sub_partition_ctxs
push!(sub_partitions, visit_subPartition(visitor, sp_ctx))
end
else
push!(sub_partitions, visit_subPartition(visitor, sub_partition_ctxs))
end
end
return BaseModelicaBasePartition(clock_clauses, sub_partitions)
end
function visit_clockClause(visitor::ASTBuilderVisitor, ctx::Py)
# clockClause: decoration? 'Clock' IDENT '=' expression comment
name = get_text(ctx.IDENT())
expr = visit_expression(visitor, ctx.expression())
return BaseModelicaClockClause(name, expr)
end
function visit_subPartition(visitor::ASTBuilderVisitor, ctx::Py)
# subPartition: 'subpartition' '(' argumentList ')' stringComment (annotationComment ';')?
# ('equation' (equation ';')* | 'algorithm' (statement ';')*)*
clock_args = []
if !is_null(ctx.argumentList())
clock_args = visit_argumentList(visitor, ctx.argumentList())
end
equations = []
eq_ctxs = ctx.equation()
if !is_null(eq_ctxs)
if pyconvert(Bool, pybuiltins.hasattr(eq_ctxs, "__iter__"))
for eq_ctx in eq_ctxs
eq = visit_equation(visitor, eq_ctx)
if !isnothing(eq)
push!(equations, eq)
end
end
else
eq = visit_equation(visitor, eq_ctxs)
if !isnothing(eq)
push!(equations, eq)
end
end
end
return BaseModelicaSubPartition(clock_args, equations)
end
function visit_genericElement(visitor::ASTBuilderVisitor, ctx::Py)
if !is_null(ctx.normalElement())
return visit_normalElement(visitor, ctx.normalElement())
elseif !is_null(ctx.parameterEquation())
return visit_parameterEquation(visitor, ctx.parameterEquation())
end
end
function visit_normalElement(visitor::ASTBuilderVisitor, ctx::Py)
# normalElement: componentClause
return visit_componentClause(visitor, ctx.componentClause())
end
function visit_componentClause(visitor::ASTBuilderVisitor, ctx::Py)
# componentClause: typePrefix typeSpecifier componentList
type_prefix = visit_typePrefix(visitor, ctx.typePrefix())
type_spec = visit_typeSpecifier(visitor, ctx.typeSpecifier())
component_list = visit_componentList(visitor, ctx.componentList())
return BaseModelicaComponentClause(type_prefix, type_spec, component_list)
end
function visit_typePrefix(visitor::ASTBuilderVisitor, ctx::Py)
# typePrefix: ('discrete' | 'parameter' | 'constant')? ('input' | 'output')?
prefix_text = get_text(ctx)
# Parse the prefix to extract discrete/parameter/constant and input/output
dpc = nothing # discrete/parameter/constant
io = nothing # input/output
if occursin("discrete", prefix_text)
dpc = "discrete"
elseif occursin("parameter", prefix_text)
dpc = "parameter"
elseif occursin("constant", prefix_text)
dpc = "constant"
end
if occursin("input", prefix_text)
io = "input"
elseif occursin("output", prefix_text)
io = "output"
end
return BaseModelicaTypePrefix(false, dpc, io) # final_flag is always false for now
end
function visit_typeSpecifier(visitor::ASTBuilderVisitor, ctx::Py)
# typeSpecifier: '.'? name
name = visit_name(visitor, ctx.name())
return BaseModelicaTypeSpecifier(name)
end
function visit_name(visitor::ASTBuilderVisitor, ctx::Py)
# name: IDENT ('.' IDENT)*
return get_text(ctx)
end
function visit_componentList(visitor::ASTBuilderVisitor, ctx::Py)
# componentList: componentDeclaration (',' componentDeclaration)*
components = []
comp_decls = ctx.componentDeclaration()
for comp_decl in comp_decls
push!(components, visit_componentDeclaration(visitor, comp_decl))
end
return components
end
function visit_componentDeclaration(visitor::ASTBuilderVisitor, ctx::Py)
# componentDeclaration: declaration comment
decl = visit_declaration(visitor, ctx.declaration())
comment_text = visit_comment(visitor, ctx.comment())
return BaseModelicaComponentDeclaration(decl, comment_text)
end
function visit_declaration(visitor::ASTBuilderVisitor, ctx::Py)
# declaration: IDENT arraySubscripts? modification?
# Note: ident should be a list of BaseModelicaIdentifier objects to match parser.jl
# Note: modification should be a list to match parser.jl
ident = [BaseModelicaIdentifier(get_text(ctx.IDENT()))]
array_subs = nothing
if !is_null(ctx.arraySubscripts())
array_subs = visit_arraySubscripts(visitor, ctx.arraySubscripts())
end
modification = nothing
if !is_null(ctx.modification())
mod = visit_modification(visitor, ctx.modification())
if !isnothing(mod)
modification = [mod]
end
end
return BaseModelicaDeclaration(ident, array_subs, modification)
end
function visit_modification(visitor::ASTBuilderVisitor, ctx::Py)
# modification: classModification ('=' expression)?
# | '=' expression
# | ':=' expression
# Parse class modifications (the argument list in parentheses)
class_mods = []
if !is_null(ctx.classModification())
class_mod_ctx = ctx.classModification()
if !is_null(class_mod_ctx.argumentList())
class_mods = visit_argumentList(visitor, class_mod_ctx.argumentList())
end
end
# Get the final assignment expression (if present)
expr_list = []
expr_ctxs = ctx.expression()
if !is_null(expr_ctxs)
if pyconvert(Bool, pybuiltins.hasattr(expr_ctxs, "__iter__"))
# It's a list
for expr_ctx in expr_ctxs
push!(expr_list, visit_expression(visitor, expr_ctx))
end
else
# It's a single element
push!(expr_list, visit_expression(visitor, expr_ctxs))
end
end
# Return modification only if we have class mods or expressions
if !isempty(class_mods) || !isempty(expr_list)
return BaseModelicaModification(class_mods, expr_list)
end
return nothing
end
function visit_argumentList(visitor::ASTBuilderVisitor, ctx::Py)
# argumentList: argument (',' argument)*
args = []
arg_ctxs = ctx.argument()
for arg_ctx in arg_ctxs
arg = visit_argument(visitor, arg_ctx)
if !isnothing(arg)
push!(args, arg)
end
end
return args
end
function visit_argument(visitor::ASTBuilderVisitor, ctx::Py)
# argument: decoration? elementModificationOrReplaceable
# elementModificationOrReplaceable: elementModification
# elementModification: name modification? stringComment
elem_mod_ctx = ctx.elementModificationOrReplaceable().elementModification()
# Get the name
name_ctx = elem_mod_ctx.name()
name_str = get_text(name_ctx)
name = BaseModelicaIdentifier(name_str)
# Get the modification (if present)
mod = nothing
if !is_null(elem_mod_ctx.modification())
mod = visit_modification(visitor, elem_mod_ctx.modification())
end
return BaseModelicaClassModificationArg(name, mod)
end
function visit_arraySubscripts(visitor::ASTBuilderVisitor, ctx::Py)
# arraySubscripts: '[' subscript (',' subscript)* ']'
subscripts = []
subscript_ctxs = ctx.subscript()
for sub_ctx in subscript_ctxs
push!(subscripts, visit_subscript(visitor, sub_ctx))
end
return BaseModelicaArraySubscripts(subscripts)
end
function visit_subscript(visitor::ASTBuilderVisitor, ctx::Py)
# subscript: ':' | expression
text = get_text(ctx)
if text == ":"
return BMColon()
else
return visit_expression(visitor, ctx.expression())
end
end
function visit_parameterEquation(visitor::ASTBuilderVisitor, ctx::Py)
# parameterEquation: 'parameter' 'equation' guessValue '=' (expression | prioritizeExpression) comment
comp_ref = visit_guessValue(visitor, ctx.guessValue())
if !is_null(ctx.expression())
expr = visit_expression(visitor, ctx.expression())
else
expr = visit_prioritizeExpression(visitor, ctx.prioritizeExpression())
end
comment_text = visit_comment(visitor, ctx.comment())
return BaseModelicaParameterEquation(comp_ref, expr, comment_text)
end
function visit_guessValue(visitor::ASTBuilderVisitor, ctx::Py)
# guessValue: 'guess' '(' componentReference ')'
return visit_componentReference(visitor, ctx.componentReference())
end
function visit_prioritizeExpression(visitor::ASTBuilderVisitor, ctx::Py)
# For now, just return the expression part
expr_ctxs = ctx.expression()
if pyconvert(Bool, pybuiltins.hasattr(expr_ctxs, "__iter__"))
return visit_expression(visitor, expr_ctxs[0])
else
return visit_expression(visitor, expr_ctxs)
end
end
# Equation visitors
function visit_equation(visitor::ASTBuilderVisitor, ctx::Py)
# equation: decoration? (simpleExpression decoration? ('=' expression)?
# | ifEquation | forEquation | whenEquation) comment
if !is_null(ctx.ifEquation())
return visit_ifEquation(visitor, ctx.ifEquation())
elseif !is_null(ctx.forEquation())
return visit_forEquation(visitor, ctx.forEquation())
elseif !is_null(ctx.whenEquation())
return visit_whenEquation(visitor, ctx.whenEquation())
else
# Simple equation
simple_expr = visit_simpleExpression(visitor, ctx.simpleExpression())
# Check if there's an '=' expression
expr_ctxs = ctx.expression()
if !is_null(expr_ctxs)
# Get the first expression after '='
first_expr = pyconvert(Bool, pybuiltins.hasattr(expr_ctxs, "__iter__")) ? expr_ctxs[0] : expr_ctxs
rhs = visit_expression(visitor, first_expr)
comment_text = visit_comment(visitor, ctx.comment())
return BaseModelicaAnyEquation(
BaseModelicaSimpleEquation(simple_expr, rhs),
comment_text
)
else
# Just an expression (no '='), could be a function call
return nothing
end
end
end
function visit_initialEquation(visitor::ASTBuilderVisitor, ctx::Py)
# initialEquation: equation | prioritizeEquation
if !is_null(ctx.equation())
eq = visit_equation(visitor, ctx.equation())
return isnothing(eq) ? nothing : BaseModelicaInitialEquation(eq)
else
# prioritizeEquation - skip for now
return nothing
end
end
function visit_ifEquation(visitor::ASTBuilderVisitor, ctx::Py)
# ifEquation: 'if' expression 'then' (equation ';')*
# ('elseif' expression 'then' (equation ';')*)*
# ('else' (equation ';')*)?
# 'end' 'if'
ifs = [] # conditions
thens = [] # equation lists for each branch
# Walk through children to properly group by branch
child_count = pyconvert(Int, ctx.getChildCount())
i = 0
seen_if = false # Track if we've seen the initial 'if'
while i < child_count
child = ctx.getChild(i)
child_text = pyconvert(String, child.getText())
if (child_text == "if" && !seen_if) || child_text == "elseif"
if child_text == "if"
seen_if = true
end
# Next child should be the condition expression
i += 1
if i < child_count
cond_child = ctx.getChild(i)
cond_expr = visit_expression(visitor, cond_child)
push!(ifs, cond_expr)
end
# Skip 'then' keyword
i += 1
if i < child_count && pyconvert(String, ctx.getChild(i).getText()) == "then"
i += 1
end
# Collect equations until next keyword
branch_equations = []
while i < child_count
next_child = ctx.getChild(i)
next_text = pyconvert(String, next_child.getText())
if next_text in ["elseif", "else", "end"]
break
elseif next_text != ";"
# It's an equation
eq = visit_equation(visitor, next_child)
if !isnothing(eq)
push!(branch_equations, eq)
end
end
i += 1
end
push!(thens, branch_equations)
elseif child_text == "else"
# Else branch has no condition, just equations
i += 1
branch_equations = []
while i < child_count
next_child = ctx.getChild(i)
next_text = pyconvert(String, next_child.getText())
if next_text == "end"
break
elseif next_text != ";"
eq = visit_equation(visitor, next_child)
if !isnothing(eq)
push!(branch_equations, eq)
end
end
i += 1
end
push!(thens, branch_equations)
else
i += 1
end
end
return BaseModelicaIfEquation(ifs, thens)
end
function visit_forEquation(visitor::ASTBuilderVisitor, ctx::Py)
# forEquation: 'for' forIndex 'loop' (equation ';')* 'end' 'for'
for_index = visit_forIndex(visitor, ctx.forIndex())
equations = []
eq_ctxs = ctx.equation()
for eq_ctx in eq_ctxs
eq = visit_equation(visitor, eq_ctx)
if !isnothing(eq)
push!(equations, eq)
end
end
return BaseModelicaForEquation(for_index, equations)
end
function visit_forIndex(visitor::ASTBuilderVisitor, ctx::Py)
# forIndex: IDENT 'in' expression
ident = get_text(ctx.IDENT())
expr = visit_expression(visitor, ctx.expression())
return BaseModelicaForIndex(ident, expr)
end
function visit_whenEquation(visitor::ASTBuilderVisitor, ctx::Py)
# whenEquation: 'when' expression 'then' (equation ';')*
# ('elsewhen' expression 'then' (equation ';')*)*
# 'end' 'when'
whens = []
thens = []
# Get all condition expressions
expr_ctxs = ctx.expression()
for expr_ctx in expr_ctxs
push!(whens, visit_expression(visitor, expr_ctx))
end
# Get all equation lists (simplified)
eq_ctxs = ctx.equation()
for expr_ctx in expr_ctxs
branch_equations = []
push!(thens, branch_equations)
end
return BaseModelicaWhenEquation(whens, thens)
end
# Expression visitors
function visit_expression(visitor::ASTBuilderVisitor, ctx::Py)
# expression: expressionNoDecoration decoration?
return visit_expressionNoDecoration(visitor, ctx.expressionNoDecoration())
end
function visit_expressionNoDecoration(visitor::ASTBuilderVisitor, ctx::Py)
# expressionNoDecoration: simpleExpression | ifExpression
if !is_null(ctx.ifExpression())
return visit_ifExpression(visitor, ctx.ifExpression())
else
return visit_simpleExpression(visitor, ctx.simpleExpression())
end
end
function visit_ifExpression(visitor::ASTBuilderVisitor, ctx::Py)
# ifExpression: 'if' expressionNoDecoration 'then' expressionNoDecoration
# ('elseif' expressionNoDecoration 'then' expressionNoDecoration)*
# 'else' expressionNoDecoration
# Use the simpler approach: get all expressionNoDecoration contexts in order
# The grammar guarantees they appear in a specific order:
# 1st: if condition, 2nd: then expression
# 3rd, 4th (if elseif): elseif condition, then expression
# ... more elseif pairs ...
# last: else expression
conditions = []
expressions = []
expr_ctxs = ctx.expressionNoDecoration()
num_exprs = pyconvert(Int, pybuiltins.len(expr_ctxs))
# Process pairs: condition, then-expression
idx = 0
while idx < num_exprs - 1
# Condition
push!(conditions, visit_expressionNoDecoration(visitor, expr_ctxs[idx]))
idx += 1
# Then-expression
push!(expressions, visit_expressionNoDecoration(visitor, expr_ctxs[idx]))
idx += 1
end
# Last one is the else expression
if idx < num_exprs
push!(expressions, visit_expressionNoDecoration(visitor, expr_ctxs[idx]))
end
return BaseModelicaIfExpression(conditions, expressions)
end
function visit_simpleExpression(visitor::ASTBuilderVisitor, ctx::Py)
# simpleExpression: logicalExpression (':' logicalExpression (':' logicalExpression)?)?
logical_exprs = ctx.logicalExpression()
if pyconvert(Int, length(logical_exprs)) == 1
return visit_logicalExpression(visitor, logical_exprs[0])
elseif pyconvert(Int, length(logical_exprs)) == 2
# start:stop (default step is 1)
start_expr = visit_logicalExpression(visitor, logical_exprs[0])
stop_expr = visit_logicalExpression(visitor, logical_exprs[1])
return BaseModelicaRange(start_expr, BaseModelicaNumber(1), stop_expr)
else
# start:step:stop
start_expr = visit_logicalExpression(visitor, logical_exprs[0])
step_expr = visit_logicalExpression(visitor, logical_exprs[1])
stop_expr = visit_logicalExpression(visitor, logical_exprs[2])
return BaseModelicaRange(start_expr, step_expr, stop_expr)
end
end
function visit_logicalExpression(visitor::ASTBuilderVisitor, ctx::Py)
# logicalExpression: logicalTerm ('or' logicalTerm)*
terms = ctx.logicalTerm()
if pyconvert(Int, length(terms)) == 1
return visit_logicalTerm(visitor, terms[0])
else
result = visit_logicalTerm(visitor, terms[0])
for i in 1:(pyconvert(Int, length(terms)) - 1)
right = visit_logicalTerm(visitor, terms[i])
result = BaseModelicaOr(result, right)
end
return result
end
end
function visit_logicalTerm(visitor::ASTBuilderVisitor, ctx::Py)
# logicalTerm: logicalFactor ('and' logicalFactor)*
factors = ctx.logicalFactor()
if pyconvert(Int, length(factors)) == 1
return visit_logicalFactor(visitor, factors[0])
else
result = visit_logicalFactor(visitor, factors[0])
for i in 1:(pyconvert(Int, length(factors)) - 1)
right = visit_logicalFactor(visitor, factors[i])
result = BaseModelicaAnd(result, right)
end
return result
end
end
function visit_logicalFactor(visitor::ASTBuilderVisitor, ctx::Py)
# logicalFactor: 'not'? relation
# Check if 'not' keyword is present by examining the parse tree text
has_not = false
if pyconvert(Int, ctx.getChildCount()) > 1
# If there's more than one child, check if first child is 'not'
first_child = ctx.getChild(0)
if !is_null(first_child)
child_text = pyconvert(String, first_child.getText())
has_not = (child_text == "not")
end
end
relation = visit_relation(visitor, ctx.relation())
if has_not
return BaseModelicaNot(relation)
else
return relation
end
end
function visit_relation(visitor::ASTBuilderVisitor, ctx::Py)
# relation: arithmeticExpression (relationalOperator arithmeticExpression)?
arith_exprs = ctx.arithmeticExpression()
if pyconvert(Int, length(arith_exprs)) == 1
return visit_arithmeticExpression(visitor, arith_exprs[0])
else
left = visit_arithmeticExpression(visitor, arith_exprs[0])
right = visit_arithmeticExpression(visitor, arith_exprs[1])
op_ctx = ctx.relationalOperator()
op_text = get_text(op_ctx)
if op_text == "<"
return BaseModelicaLessThan(left, right)
elseif op_text == "<="
return BaseModelicaLEQ(left, right)
elseif op_text == ">"
return BaseModelicaGreaterThan(left, right)
elseif op_text == ">="
return BaseModelicaGEQ(left, right)
elseif op_text == "=="
return BaseModelicaEQ(left, right)
elseif op_text == "<>"
return BaseModelicaNEQ(left, right)
end
end
end
function visit_arithmeticExpression(visitor::ASTBuilderVisitor, ctx::Py)
# arithmeticExpression: addOperator? term (addOperator term)*
terms = ctx.term()
add_ops = ctx.addOperator()
# Check for leading unary minus
has_leading_op = !is_null(add_ops) && pyconvert(Int, length(add_ops)) == pyconvert(Int, length(terms))
if pyconvert(Int, length(terms)) == 1 && pyconvert(Int, length(add_ops)) == 0
return visit_term(visitor, terms[0])
else
result = nothing
term_idx = 0
op_idx = 0
# Handle leading operator
if has_leading_op
op_text = get_text(add_ops[0])
first_term = visit_term(visitor, terms[0])
if op_text == "-" || op_text == ".-"