Skip to content

Add a semantic analysis pass to perform checks on nullable types #60

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
dibyendumajumdar merged 9 commits into from
Jul 5, 2026
Merged

Add a semantic analysis pass to perform checks on nullable types #60

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
9 commits
Select commit Hold shift + click to select a range
c693cd8
experiment with flow type analysis
dibyendumajumdar Jun 13, 2026
df00ff7
experiment with flow type analysis
dibyendumajumdar Jun 14, 2026
eccdc85
experiment with flow type analysis
dibyendumajumdar Jul 4, 2026
3e15ffe
experiment with flow type analysis
dibyendumajumdar Jul 4, 2026
fe5e90d
experiment with flow type analysis
dibyendumajumdar Jul 4, 2026
9a64f57
experiment with flow type analysis
dibyendumajumdar Jul 4, 2026
88ba9b4
Remove per element tracking of array from lattice
dibyendumajumdar Jul 5, 2026
251431f
Add test case
dibyendumajumdar Jul 5, 2026
10529a0
experiment with flow type analysis
dibyendumajumdar Jul 5, 2026
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
2 changes: 2 additions & 0 deletions optvm/src/main/java/com/compilerprogramming/ezlang/compiler/Compiler.java
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -2,6 +2,7 @@

import com.compilerprogramming.ezlang.lexer.Lexer;
import com.compilerprogramming.ezlang.parser.Parser;
import com.compilerprogramming.ezlang.semantic.NullableAnalysis;
import com.compilerprogramming.ezlang.semantic.SemaAssignTypes;
import com.compilerprogramming.ezlang.semantic.SemaDefineTypes;
import com.compilerprogramming.ezlang.types.Symbol;
Expand Down Expand Up @@ -35,6 +36,7 @@ public TypeDictionary compileSrc(String src, EnumSet<Options> options) {
sema.analyze(program);
var sema2 = new SemaAssignTypes(typeDict);
sema2.analyze(program);
NullableAnalysis.analyze(typeDict);
compile(typeDict, options);
return typeDict;
}
Expand Down
233 changes: 147 additions & 86 deletions optvm/src/test/java/com/compilerprogramming/ezlang/compiler/TestSSADestructB.java
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -4578,7 +4578,8 @@ public void testSSA15() {
func foo()->Int
{
var f = new [Foo?] { new Foo{i = 1}, null }
return null == f[1] && 1 == f[0].i
var f0 = f[0]
return null == f[1] && f0 != null && 1 == f0.i
}
""";
String result = compileSrc(src);
Expand All @@ -4587,136 +4588,196 @@ func foo()->Int
Before SSA
==========
L0:
%t1 = New([Foo?], len=2)
%t2 = New(Foo)
%t2.i = 1
%t1[0] = %t2
%t1[1] = null
f = %t1
%t3 = f[1]
%t4 = null==%t3
if %t4 goto L2 else goto L3
%t2 = New([Foo?], len=2)
%t3 = New(Foo)
%t3.i = 1
%t2[0] = %t3
%t2[1] = null
f = %t2
%t4 = f[0]
f0 = %t4
%t5 = f[1]
%t6 = null==%t5
if %t6 goto L5 else goto L6
L5:
%t7 = f0!=null
goto L7
L7:
if %t7 goto L2 else goto L3
L2:
%t5 = f[0]
%t6 = %t5.i
%t7 = 1==%t6
%t8 = f0.i
%t9 = 1==%t8
goto L4
L4:
ret %t7
ret %t9
goto L1
L1:
L3:
%t7 = 0
%t9 = 0
goto L4
L6:
%t7 = 0
goto L7
After SSA
=========
L0:
%t1_0 = New([Foo?], len=2)
%t2_0 = New(Foo)
%t2_0.i = 1
%t1_0[0] = %t2_0
%t1_0[1] = null
f_0 = %t1_0
%t3_0 = f_0[1]
%t4_0 = null==%t3_0
if %t4_0 goto L2 else goto L3
%t2_0 = New([Foo?], len=2)
%t3_0 = New(Foo)
%t3_0.i = 1
%t2_0[0] = %t3_0
%t2_0[1] = null
f_0 = %t2_0
%t4_0 = f_0[0]
f0_0 = %t4_0
%t5_0 = f_0[1]
%t6_0 = null==%t5_0
if %t6_0 goto L5 else goto L6
L5:
%t7_1 = f0_0!=null
goto L7
L7:
%t7_2 = phi(%t7_1, %t7_0)
if %t7_2 goto L2 else goto L3
L2:
%t5_0 = f_0[0]
%t6_0 = %t5_0.i
%t7_1 = 1==%t6_0
%t8_0 = f0_0.i
%t9_1 = 1==%t8_0
goto L4
L4:
%t7_2 = phi(%t7_1, %t7_0)
ret %t7_2
%t9_2 = phi(%t9_1, %t9_0)
ret %t9_2
goto L1
L1:
L3:
%t7_0 = 0
%t9_0 = 0
goto L4
L6:
%t7_0 = 0
goto L7
After converting from SSA to CSSA
L0:
%t1_0 = New([Foo?], len=2)
%t2_0 = New(Foo)
%t2_0.i = 1
%t1_0[0] = %t2_0
%t1_0[1] = null
f_0 = %t1_0
%t3_0 = f_0[1]
%t4_0 = null==%t3_0
if %t4_0 goto L2 else goto L3
%t2_0 = New([Foo?], len=2)
%t3_0 = New(Foo)
%t3_0.i = 1
%t2_0[0] = %t3_0
%t2_0[1] = null
f_0 = %t2_0
%t4_0 = f_0[0]
f0_0 = %t4_0
%t5_0 = f_0[1]
%t6_0 = null==%t5_0
if %t6_0 goto L5 else goto L6
L5:
%t7_1 = f0_0!=null
(%t7_1_27) = (%t7_1)
goto L7
L7:
%t7_2_29 = phi(%t7_1_27, %t7_0_28)
(%t7_2) = (%t7_2_29)
if %t7_2 goto L2 else goto L3
L2:
%t5_0 = f_0[0]
%t6_0 = %t5_0.i
%t7_1 = 1==%t6_0
(%t7_1_18) = (%t7_1)
%t8_0 = f0_0.i
%t9_1 = 1==%t8_0
(%t9_1_24) = (%t9_1)
goto L4
L4:
%t7_2_20 = phi(%t7_1_18, %t7_0_19)
(%t7_2) = (%t7_2_20)
ret %t7_2
%t9_2_26 = phi(%t9_1_24, %t9_0_25)
(%t9_2) = (%t9_2_26)
ret %t9_2
goto L1
L1:
L3:
%t7_0 = 0
(%t7_0_19) = (%t7_0)
%t9_0 = 0
(%t9_0_25) = (%t9_0)
goto L4
L6:
%t7_0 = 0
(%t7_0_28) = (%t7_0)
goto L7
After removing phis from CSSA
L0:
%t1_0 = New([Foo?], len=2)
%t2_0 = New(Foo)
%t2_0.i = 1
%t1_0[0] = %t2_0
%t1_0[1] = null
f_0 = %t1_0
%t3_0 = f_0[1]
%t4_0 = null==%t3_0
if %t4_0 goto L2 else goto L3
%t2_0 = New([Foo?], len=2)
%t3_0 = New(Foo)
%t3_0.i = 1
%t2_0[0] = %t3_0
%t2_0[1] = null
f_0 = %t2_0
%t4_0 = f_0[0]
f0_0 = %t4_0
%t5_0 = f_0[1]
%t6_0 = null==%t5_0
if %t6_0 goto L5 else goto L6
L5:
%t7_1 = f0_0!=null
(%t7_1_27) = (%t7_1)
%t7_2_29 = %t7_1_27
goto L7
L7:
(%t7_2) = (%t7_2_29)
if %t7_2 goto L2 else goto L3
L2:
%t5_0 = f_0[0]
%t6_0 = %t5_0.i
%t7_1 = 1==%t6_0
(%t7_1_18) = (%t7_1)
%t7_2_20 = %t7_1_18
%t8_0 = f0_0.i
%t9_1 = 1==%t8_0
(%t9_1_24) = (%t9_1)
%t9_2_26 = %t9_1_24
goto L4
L4:
(%t7_2) = (%t7_2_20)
ret %t7_2
(%t9_2) = (%t9_2_26)
ret %t9_2
goto L1
L1:
L3:
%t7_0 = 0
(%t7_0_19) = (%t7_0)
%t7_2_20 = %t7_0_19
%t9_0 = 0
(%t9_0_25) = (%t9_0)
%t9_2_26 = %t9_0_25
goto L4
L6:
%t7_0 = 0
(%t7_0_28) = (%t7_0)
%t7_2_29 = %t7_0_28
goto L7
After exiting SSA
=================
L0:
%t1_0 = New([Foo?], len=2)
%t2_0 = New(Foo)
%t2_0.i = 1
%t1_0[0] = %t2_0
%t1_0[1] = null
f_0 = %t1_0
%t3_0 = f_0[1]
%t4_0 = null==%t3_0
if %t4_0 goto L2 else goto L3
%t2_0 = New([Foo?], len=2)
%t3_0 = New(Foo)
%t3_0.i = 1
%t2_0[0] = %t3_0
%t2_0[1] = null
f_0 = %t2_0
%t4_0 = f_0[0]
f0_0 = %t4_0
%t5_0 = f_0[1]
%t6_0 = null==%t5_0
if %t6_0 goto L5 else goto L6
L5:
%t7_1 = f0_0!=null
%t7_1_27 = %t7_1
%t7_2_29 = %t7_1_27
goto L7
L7:
%t7_2 = %t7_2_29
if %t7_2 goto L2 else goto L3
L2:
%t5_0 = f_0[0]
%t6_0 = %t5_0.i
%t7_1 = 1==%t6_0
%t7_1_18 = %t7_1
%t7_2_20 = %t7_1_18
%t8_0 = f0_0.i
%t9_1 = 1==%t8_0
%t9_1_24 = %t9_1
%t9_2_26 = %t9_1_24
goto L4
L4:
%t7_2 = %t7_2_20
ret %t7_2
%t9_2 = %t9_2_26
ret %t9_2
goto L1
L1:
L3:
%t7_0 = 0
%t7_0_19 = %t7_0
%t7_2_20 = %t7_0_19
%t9_0 = 0
%t9_0_25 = %t9_0
%t9_2_26 = %t9_0_25
goto L4
L6:
%t7_0 = 0
%t7_0_28 = %t7_0
%t7_2_29 = %t7_0_28
goto L7
""", result);
}

Expand Down
Loading
Loading