From 192146b99db363403de855ff565f1cd3054a0d3c Mon Sep 17 00:00:00 2001 From: SirYwell Date: Mon, 5 May 2025 00:22:11 +0200 Subject: [PATCH] Initial commit --- README.md | 88 ++++++ build.gradle.kts | 30 +++ build.sh | 4 + gradle/wrapper/gradle-wrapper.jar | Bin 0 -> 43764 bytes gradle/wrapper/gradle-wrapper.properties | 7 + gradlew | 251 ++++++++++++++++++ gradlew.bat | 94 +++++++ run.sh | 3 + settings.gradle.kts | 5 + .../edu/kit/kastel/vads/compiler/Main.java | 61 +++++ .../kit/kastel/vads/compiler/Position.java | 13 + .../edu/kit/kastel/vads/compiler/Span.java | 20 ++ .../backend/aasm/AasmRegisterAllocator.java | 43 +++ .../compiler/backend/aasm/CodeGenerator.java | 89 +++++++ .../backend/aasm/VirtualRegister.java | 10 + .../compiler/backend/regalloc/Register.java | 4 + .../backend/regalloc/RegisterAllocator.java | 11 + .../vads/compiler/ir/GraphConstructor.java | 192 ++++++++++++++ .../kit/kastel/vads/compiler/ir/IrGraph.java | 53 ++++ .../vads/compiler/ir/SsaTranslation.java | 227 ++++++++++++++++ .../kastel/vads/compiler/ir/node/AddNode.java | 19 ++ .../compiler/ir/node/BinaryOperationNode.java | 50 ++++ .../kastel/vads/compiler/ir/node/Block.java | 11 + .../vads/compiler/ir/node/ConstIntNode.java | 32 +++ .../kastel/vads/compiler/ir/node/DivNode.java | 15 ++ .../kastel/vads/compiler/ir/node/ModNode.java | 15 ++ .../kastel/vads/compiler/ir/node/MulNode.java | 18 ++ .../kastel/vads/compiler/ir/node/Node.java | 73 +++++ .../kit/kastel/vads/compiler/ir/node/Phi.java | 11 + .../vads/compiler/ir/node/ProjNode.java | 24 ++ .../vads/compiler/ir/node/ReturnNode.java | 9 + .../vads/compiler/ir/node/StartNode.java | 7 + .../kastel/vads/compiler/ir/node/SubNode.java | 7 + .../ir/optimize/LocalValueNumbering.java | 20 ++ .../vads/compiler/ir/optimize/Optimizer.java | 9 + .../vads/compiler/ir/util/DebugInfo.java | 12 + .../compiler/ir/util/DebugInfoHelper.java | 16 ++ .../compiler/ir/util/GraphVizPrinter.java | 144 ++++++++++ .../vads/compiler/ir/util/NodeSupport.java | 18 ++ .../vads/compiler/lexer/ErrorToken.java | 10 + .../vads/compiler/lexer/Identifier.java | 10 + .../kastel/vads/compiler/lexer/Keyword.java | 15 ++ .../vads/compiler/lexer/KeywordType.java | 41 +++ .../kit/kastel/vads/compiler/lexer/Lexer.java | 215 +++++++++++++++ .../vads/compiler/lexer/NumberLiteral.java | 10 + .../kastel/vads/compiler/lexer/Operator.java | 42 +++ .../kastel/vads/compiler/lexer/Separator.java | 35 +++ .../kit/kastel/vads/compiler/lexer/Token.java | 22 ++ .../vads/compiler/parser/ParseException.java | 7 + .../kastel/vads/compiler/parser/Parser.java | 201 ++++++++++++++ .../kastel/vads/compiler/parser/Printer.java | 138 ++++++++++ .../vads/compiler/parser/TokenSource.java | 83 ++++++ .../compiler/parser/ast/AssignmentTree.java | 17 ++ .../parser/ast/BinaryOperationTree.java | 19 ++ .../vads/compiler/parser/ast/BlockTree.java | 18 ++ .../compiler/parser/ast/DeclarationTree.java | 20 ++ .../compiler/parser/ast/ExpressionTree.java | 4 + .../compiler/parser/ast/FunctionTree.java | 16 ++ .../parser/ast/IdentExpressionTree.java | 16 ++ .../compiler/parser/ast/LValueIdentTree.java | 16 ++ .../vads/compiler/parser/ast/LValueTree.java | 4 + .../vads/compiler/parser/ast/LiteralTree.java | 11 + .../vads/compiler/parser/ast/NameTree.java | 12 + .../vads/compiler/parser/ast/NegateTree.java | 16 ++ .../vads/compiler/parser/ast/ProgramTree.java | 24 ++ .../vads/compiler/parser/ast/ReturnTree.java | 17 ++ .../compiler/parser/ast/StatementTree.java | 4 + .../kastel/vads/compiler/parser/ast/Tree.java | 11 + .../vads/compiler/parser/ast/TypeTree.java | 12 + .../compiler/parser/symbol/IdentName.java | 8 + .../compiler/parser/symbol/KeywordName.java | 10 + .../vads/compiler/parser/symbol/Name.java | 17 ++ .../vads/compiler/parser/type/BasicType.java | 12 + .../vads/compiler/parser/type/Type.java | 5 + .../compiler/parser/visitor/NoOpVisitor.java | 85 ++++++ .../visitor/RecursivePostorderVisitor.java | 134 ++++++++++ .../vads/compiler/parser/visitor/Unit.java | 5 + .../vads/compiler/parser/visitor/Visitor.java | 44 +++ .../vads/compiler/semantic/Namespace.java | 26 ++ .../compiler/semantic/ReturnAnalysis.java | 30 +++ .../compiler/semantic/SemanticAnalysis.java | 19 ++ .../compiler/semantic/SemanticException.java | 7 + .../semantic/VariableStatusAnalysis.java | 68 +++++ src/main/java/module-info.java | 7 + 84 files changed, 3258 insertions(+) create mode 100644 README.md create mode 100644 build.gradle.kts create mode 100755 build.sh create mode 100644 gradle/wrapper/gradle-wrapper.jar create mode 100644 gradle/wrapper/gradle-wrapper.properties create mode 100755 gradlew create mode 100644 gradlew.bat create mode 100755 run.sh create mode 100644 settings.gradle.kts create mode 100644 src/main/java/edu/kit/kastel/vads/compiler/Main.java create mode 100644 src/main/java/edu/kit/kastel/vads/compiler/Position.java create mode 100644 src/main/java/edu/kit/kastel/vads/compiler/Span.java create mode 100644 src/main/java/edu/kit/kastel/vads/compiler/backend/aasm/AasmRegisterAllocator.java create mode 100644 src/main/java/edu/kit/kastel/vads/compiler/backend/aasm/CodeGenerator.java create mode 100644 src/main/java/edu/kit/kastel/vads/compiler/backend/aasm/VirtualRegister.java create mode 100644 src/main/java/edu/kit/kastel/vads/compiler/backend/regalloc/Register.java create mode 100644 src/main/java/edu/kit/kastel/vads/compiler/backend/regalloc/RegisterAllocator.java create mode 100644 src/main/java/edu/kit/kastel/vads/compiler/ir/GraphConstructor.java create mode 100644 src/main/java/edu/kit/kastel/vads/compiler/ir/IrGraph.java create mode 100644 src/main/java/edu/kit/kastel/vads/compiler/ir/SsaTranslation.java create mode 100644 src/main/java/edu/kit/kastel/vads/compiler/ir/node/AddNode.java create mode 100644 src/main/java/edu/kit/kastel/vads/compiler/ir/node/BinaryOperationNode.java create mode 100644 src/main/java/edu/kit/kastel/vads/compiler/ir/node/Block.java create mode 100644 src/main/java/edu/kit/kastel/vads/compiler/ir/node/ConstIntNode.java create mode 100644 src/main/java/edu/kit/kastel/vads/compiler/ir/node/DivNode.java create mode 100644 src/main/java/edu/kit/kastel/vads/compiler/ir/node/ModNode.java create mode 100644 src/main/java/edu/kit/kastel/vads/compiler/ir/node/MulNode.java create mode 100644 src/main/java/edu/kit/kastel/vads/compiler/ir/node/Node.java create mode 100644 src/main/java/edu/kit/kastel/vads/compiler/ir/node/Phi.java create mode 100644 src/main/java/edu/kit/kastel/vads/compiler/ir/node/ProjNode.java create mode 100644 src/main/java/edu/kit/kastel/vads/compiler/ir/node/ReturnNode.java create mode 100644 src/main/java/edu/kit/kastel/vads/compiler/ir/node/StartNode.java create mode 100644 src/main/java/edu/kit/kastel/vads/compiler/ir/node/SubNode.java create mode 100644 src/main/java/edu/kit/kastel/vads/compiler/ir/optimize/LocalValueNumbering.java create mode 100644 src/main/java/edu/kit/kastel/vads/compiler/ir/optimize/Optimizer.java create mode 100644 src/main/java/edu/kit/kastel/vads/compiler/ir/util/DebugInfo.java create mode 100644 src/main/java/edu/kit/kastel/vads/compiler/ir/util/DebugInfoHelper.java create mode 100644 src/main/java/edu/kit/kastel/vads/compiler/ir/util/GraphVizPrinter.java create mode 100644 src/main/java/edu/kit/kastel/vads/compiler/ir/util/NodeSupport.java create mode 100644 src/main/java/edu/kit/kastel/vads/compiler/lexer/ErrorToken.java create mode 100644 src/main/java/edu/kit/kastel/vads/compiler/lexer/Identifier.java create mode 100644 src/main/java/edu/kit/kastel/vads/compiler/lexer/Keyword.java create mode 100644 src/main/java/edu/kit/kastel/vads/compiler/lexer/KeywordType.java create mode 100644 src/main/java/edu/kit/kastel/vads/compiler/lexer/Lexer.java create mode 100644 src/main/java/edu/kit/kastel/vads/compiler/lexer/NumberLiteral.java create mode 100644 src/main/java/edu/kit/kastel/vads/compiler/lexer/Operator.java create mode 100644 src/main/java/edu/kit/kastel/vads/compiler/lexer/Separator.java create mode 100644 src/main/java/edu/kit/kastel/vads/compiler/lexer/Token.java create mode 100644 src/main/java/edu/kit/kastel/vads/compiler/parser/ParseException.java create mode 100644 src/main/java/edu/kit/kastel/vads/compiler/parser/Parser.java create mode 100644 src/main/java/edu/kit/kastel/vads/compiler/parser/Printer.java create mode 100644 src/main/java/edu/kit/kastel/vads/compiler/parser/TokenSource.java create mode 100644 src/main/java/edu/kit/kastel/vads/compiler/parser/ast/AssignmentTree.java create mode 100644 src/main/java/edu/kit/kastel/vads/compiler/parser/ast/BinaryOperationTree.java create mode 100644 src/main/java/edu/kit/kastel/vads/compiler/parser/ast/BlockTree.java create mode 100644 src/main/java/edu/kit/kastel/vads/compiler/parser/ast/DeclarationTree.java create mode 100644 src/main/java/edu/kit/kastel/vads/compiler/parser/ast/ExpressionTree.java create mode 100644 src/main/java/edu/kit/kastel/vads/compiler/parser/ast/FunctionTree.java create mode 100644 src/main/java/edu/kit/kastel/vads/compiler/parser/ast/IdentExpressionTree.java create mode 100644 src/main/java/edu/kit/kastel/vads/compiler/parser/ast/LValueIdentTree.java create mode 100644 src/main/java/edu/kit/kastel/vads/compiler/parser/ast/LValueTree.java create mode 100644 src/main/java/edu/kit/kastel/vads/compiler/parser/ast/LiteralTree.java create mode 100644 src/main/java/edu/kit/kastel/vads/compiler/parser/ast/NameTree.java create mode 100644 src/main/java/edu/kit/kastel/vads/compiler/parser/ast/NegateTree.java create mode 100644 src/main/java/edu/kit/kastel/vads/compiler/parser/ast/ProgramTree.java create mode 100644 src/main/java/edu/kit/kastel/vads/compiler/parser/ast/ReturnTree.java create mode 100644 src/main/java/edu/kit/kastel/vads/compiler/parser/ast/StatementTree.java create mode 100644 src/main/java/edu/kit/kastel/vads/compiler/parser/ast/Tree.java create mode 100644 src/main/java/edu/kit/kastel/vads/compiler/parser/ast/TypeTree.java create mode 100644 src/main/java/edu/kit/kastel/vads/compiler/parser/symbol/IdentName.java create mode 100644 src/main/java/edu/kit/kastel/vads/compiler/parser/symbol/KeywordName.java create mode 100644 src/main/java/edu/kit/kastel/vads/compiler/parser/symbol/Name.java create mode 100644 src/main/java/edu/kit/kastel/vads/compiler/parser/type/BasicType.java create mode 100644 src/main/java/edu/kit/kastel/vads/compiler/parser/type/Type.java create mode 100644 src/main/java/edu/kit/kastel/vads/compiler/parser/visitor/NoOpVisitor.java create mode 100644 src/main/java/edu/kit/kastel/vads/compiler/parser/visitor/RecursivePostorderVisitor.java create mode 100644 src/main/java/edu/kit/kastel/vads/compiler/parser/visitor/Unit.java create mode 100644 src/main/java/edu/kit/kastel/vads/compiler/parser/visitor/Visitor.java create mode 100644 src/main/java/edu/kit/kastel/vads/compiler/semantic/Namespace.java create mode 100644 src/main/java/edu/kit/kastel/vads/compiler/semantic/ReturnAnalysis.java create mode 100644 src/main/java/edu/kit/kastel/vads/compiler/semantic/SemanticAnalysis.java create mode 100644 src/main/java/edu/kit/kastel/vads/compiler/semantic/SemanticException.java create mode 100644 src/main/java/edu/kit/kastel/vads/compiler/semantic/VariableStatusAnalysis.java create mode 100644 src/main/java/module-info.java diff --git a/README.md b/README.md new file mode 100644 index 0000000..96469d2 --- /dev/null +++ b/README.md @@ -0,0 +1,88 @@ +# Starter Code: Java + +This project contains starter code written in Java 24. +It contains: + +- A lexer for L1 +- A parser for L1 +- Semantic analysis for L1 +- SSA translation and IR +- Code generation for an abstract assembly + +Furthermore, the starter code also provides working `build.sh` and `run.sh` files. + +## Code Overview + +The starter code is meant to spare you some initial work on things that are not covered +by the lecture at the time of the first lab. +You will most likely need to touch large parts of the existing code sooner or later, +so we recommend going through it for a basic understanding of what is going on. + +Remember that you are free to modify any code. + +### Lexer & Tokens + +The lexer lazily produces tokens from an input string. +Invalid input parts will generate `ErrorToken`s. + +### Parser & AST + +The parser is a handwritten, recursive-descent parser. +You can choose other technologies (e.g., ANTLR), but expanding this parser as needed +might be a good exercise to deepen your understanding. + +The parser does not implement any kind of error recovery. +Instead, it just throws an exception as soon as the first problem is encountered. +You can implement error recovery, but it is not mandatory. + +### Semantic Analysis + +The semantic analysis in Lab 1 is just very basic. +You will need to expand it in future labs. +Similar to the parser, error handling is only very basic. + +### SSA translation & IR + +The SSA IR is inspired by [libFirm](https://libfirm.github.io/) and [Sea-of-Nodes](https://github.com/SeaOfNodes/). +It might be helpful to study these to get a better understanding of what is going on. +The implementation also showcases how SSA translation can directly apply optimizations. + +In the first lab, you don't need to understand SSA in full detail. +However, register allocation on chordal graphs depends on SSA. +For Lab 1, register allocation can also be done just using the AST, +but that means you'll likely have to rewrite more code in future labs. +It can still make sense to start with simple, naive implementations to have something working early on. + +### Code generation + +This is more or less just a placeholder. +You most likely just want to fully replace it with your register allocation and instruction selection. + +## Debugging Utilities + +There is a chance something won't work on the first try. +To figure out the cause, we provide utilities that ease debugging. + +- `edu.kit.kastel.vads.compiler.parser.Printer` allows printing the AST. + As it inserts many parentheses, it can be helpful when debugging precedence problems. +- `edu.kit.kastel.vads.compiler.ir.util.GraphVizPrinter` can generate output in the DOT format. + There are online tools (e.g., https://magjac.com/graphviz-visual-editor/) that can visualize that output. + It allows debugging anything related to the IR. + +We also try to keep track of source positions as much as possible through the compiler. +You can get rid of all that, but it can be helpful to track down where something comes from. + +## Miscellaneous + +### Nullability + +This project uses [jspecify](https://jspecify.dev/). +The `module-info.java` is annotated with `@NullMarked`, +meaning uses of `null` must be annotated, and not-null is assumed otherwise. + +### Gradle + +This project provides the wrapper for Gradle 8.14. +Additionally, the `application` plugin is used to easily specify the main class and build ready-to-use executables. +To ease setup ceremony, +the `foojay-resolver-convention` is used to automatically download a JDK matching the toolchain configuration. \ No newline at end of file diff --git a/build.gradle.kts b/build.gradle.kts new file mode 100644 index 0000000..b3f652d --- /dev/null +++ b/build.gradle.kts @@ -0,0 +1,30 @@ +plugins { + id("java") + application +} + +group = "edu.kit.kastel.logic" +version = "1.0-SNAPSHOT" + +application { + mainModule = "edu.kit.kastel.vads.compiler" + mainClass = "edu.kit.kastel.vads.compiler.Main" +} + +repositories { + mavenCentral() +} + +dependencies { + implementation("org.jspecify:jspecify:1.0.0") + testImplementation(platform("org.junit:junit-bom:5.10.0")) + testImplementation("org.junit.jupiter:junit-jupiter") +} + +java { + toolchain.languageVersion = JavaLanguageVersion.of(24) +} + +tasks.test { + useJUnitPlatform() +} \ No newline at end of file diff --git a/build.sh b/build.sh new file mode 100755 index 0000000..7b6c3d0 --- /dev/null +++ b/build.sh @@ -0,0 +1,4 @@ +#!/usr/bin/env sh +set -e +cd "$(dirname "$0")" +./gradlew --no-daemon installDist diff --git a/gradle/wrapper/gradle-wrapper.jar b/gradle/wrapper/gradle-wrapper.jar new file mode 100644 index 0000000000000000000000000000000000000000..1b33c55baabb587c669f562ae36f953de2481846 GIT binary patch literal 43764 zcma&OWmKeVvL#I6?i3D%6z=Zs?ofE*?rw#G$eqJB ziT4y8-Y@s9rkH0Tz>ll(^xkcTl)CY?rS&9VNd66Yc)g^6)JcWaY(5$5gt z8gr3SBXUTN;~cBgz&})qX%#!Fxom2Yau_`&8)+6aSN7YY+pS410rRUU*>J}qL0TnJ zRxt*7QeUqTh8j)Q&iavh<}L+$Jqz))<`IfKussVk%%Ah-Ti?Eo0hQH!rK%K=#EAw0 zwq@@~XNUXRnv8$;zv<6rCRJ6fPD^hfrh;0K?n z=p!u^3xOgWZ%f3+?+>H)9+w^$Tn1e;?UpVMJb!!;f)`6f&4|8mr+g)^@x>_rvnL0< zvD0Hu_N>$(Li7|Jgu0mRh&MV+<}`~Wi*+avM01E)Jtg=)-vViQKax!GeDc!xv$^mL z{#OVBA$U{(Zr8~Xm|cP@odkHC*1R8z6hcLY#N@3E-A8XEvpt066+3t9L_6Zg6j@9Q zj$$%~yO-OS6PUVrM2s)(T4#6=JpI_@Uz+!6=GdyVU?`!F=d;8#ZB@(5g7$A0(`eqY z8_i@3w$0*es5mrSjhW*qzrl!_LQWs4?VfLmo1Sd@Ztt53+etwzAT^8ow_*7Jp`Y|l z*UgSEwvxq+FYO!O*aLf-PinZYne7Ib6ny3u>MjQz=((r3NTEeU4=-i0LBq3H-VJH< z^>1RE3_JwrclUn9vb7HcGUaFRA0QHcnE;6)hnkp%lY1UII#WPAv?-;c?YH}LWB8Nl z{sx-@Z;QxWh9fX8SxLZk8;kMFlGD3Jc^QZVL4nO)1I$zQwvwM&_!kW+LMf&lApv#< zur|EyC|U@5OQuph$TC_ZU`{!vJp`13e9alaR0Dbn5ikLFH7>eIz4QbV|C=%7)F=qo z_>M&5N)d)7G(A%c>}UCrW!Ql_6_A{?R7&CL`;!KOb3 z8Z=$YkV-IF;c7zs{3-WDEFJzuakFbd*4LWd<_kBE8~BFcv}js_2OowRNzWCtCQ6&k z{&~Me92$m*@e0ANcWKuz)?YjB*VoSTx??-3Cc0l2U!X^;Bv@m87eKHukAljrD54R+ zE;@_w4NPe1>3`i5Qy*3^E9x#VB6?}v=~qIprrrd5|DFkg;v5ixo0IsBmik8=Y;zv2 z%Bcf%NE$a44bk^`i4VwDLTbX=q@j9;JWT9JncQ!+Y%2&HHk@1~*L8-{ZpY?(-a9J-1~<1ltr9i~D9`P{XTIFWA6IG8c4;6bFw*lzU-{+?b&%OcIoCiw00n>A1ra zFPE$y@>ebbZlf(sN_iWBzQKDV zmmaLX#zK!@ZdvCANfwV}9@2O&w)!5gSgQzHdk2Q`jG6KD7S+1R5&F)j6QTD^=hq&7 zHUW+r^da^%V(h(wonR(j?BOiC!;y=%nJvz?*aW&5E87qq;2z`EI(f zBJNNSMFF9U{sR-af5{IY&AtoGcoG)Iq-S^v{7+t0>7N(KRoPj;+2N5;9o_nxIGjJ@ z7bYQK)bX)vEhy~VL%N6g^NE@D5VtV+Q8U2%{ji_=6+i^G%xeskEhH>Sqr194PJ$fB zu1y^){?9Vkg(FY2h)3ZHrw0Z<@;(gd_dtF#6y_;Iwi{yX$?asr?0N0_B*CifEi7<6 zq`?OdQjCYbhVcg+7MSgIM|pJRu~`g?g3x?Tl+V}#$It`iD1j+!x+!;wS0+2e>#g?Z z*EA^k7W{jO1r^K~cD#5pamp+o@8&yw6;%b|uiT?{Wa=4+9<}aXWUuL#ZwN1a;lQod zW{pxWCYGXdEq9qAmvAB904}?97=re$>!I%wxPV#|f#@A*Y=qa%zHlDv^yWbR03%V0 zprLP+b(#fBqxI%FiF*-n8HtH6$8f(P6!H3V^ysgd8de-N(@|K!A< z^qP}jp(RaM9kQ(^K(U8O84?D)aU(g?1S8iWwe)gqpHCaFlJxb*ilr{KTnu4_@5{K- z)n=CCeCrPHO0WHz)dDtkbZfUfVBd?53}K>C5*-wC4hpDN8cGk3lu-ypq+EYpb_2H; z%vP4@&+c2p;thaTs$dc^1CDGlPG@A;yGR5@$UEqk6p58qpw#7lc<+W(WR;(vr(D>W z#(K$vE#uBkT=*q&uaZwzz=P5mjiee6>!lV?c}QIX%ZdkO1dHg>Fa#xcGT6~}1*2m9 zkc7l3ItD6Ie~o_aFjI$Ri=C!8uF4!Ky7iG9QTrxVbsQroi|r)SAon#*B*{}TB-?=@ z8~jJs;_R2iDd!$+n$%X6FO&PYS{YhDAS+U2o4su9x~1+U3z7YN5o0qUK&|g^klZ6X zj_vrM5SUTnz5`*}Hyts9ADwLu#x_L=nv$Z0`HqN`Zo=V>OQI)fh01n~*a%01%cx%0 z4LTFVjmW+ipVQv5rYcn3;d2o4qunWUY!p+?s~X~(ost@WR@r@EuDOSs8*MT4fiP>! zkfo^!PWJJ1MHgKS2D_hc?Bs?isSDO61>ebl$U*9*QY(b=i&rp3@3GV@z>KzcZOxip z^dzA~44;R~cnhWz7s$$v?_8y-k!DZys}Q?4IkSyR!)C0j$(Gm|t#e3|QAOFaV2}36 z?dPNY;@I=FaCwylc_;~kXlZsk$_eLkNb~TIl8QQ`mmH&$*zwwR8zHU*sId)rxHu*K z;yZWa8UmCwju%aSNLwD5fBl^b0Ux1%q8YR*uG`53Mi<`5uA^Dc6Ync)J3N7;zQ*75)hf%a@{$H+%S?SGT)ks60)?6j$ zspl|4Ad6@%-r1t*$tT(en!gIXTUDcsj?28ZEzz)dH)SV3bZ+pjMaW0oc~rOPZP@g! zb9E+ndeVO_Ib9c_>{)`01^`ZS198 z)(t=+{Azi11$eu%aU7jbwuQrO`vLOixuh~%4z@mKr_Oc;F%Uq01fA)^W&y+g16e?rkLhTxV!EqC%2}sx_1u7IBq|}Be&7WI z4I<;1-9tJsI&pQIhj>FPkQV9{(m!wYYV@i5h?A0#BN2wqlEwNDIq06|^2oYVa7<~h zI_OLan0Do*4R5P=a3H9`s5*>xU}_PSztg`+2mv)|3nIy=5#Z$%+@tZnr> zLcTI!Mxa`PY7%{;KW~!=;*t)R_sl<^b>eNO@w#fEt(tPMg_jpJpW$q_DoUlkY|uo> z0-1{ouA#;t%spf*7VjkK&$QrvwUERKt^Sdo)5@?qAP)>}Y!h4(JQ!7{wIdkA+|)bv z&8hBwoX4v|+fie}iTslaBX^i*TjwO}f{V)8*!dMmRPi%XAWc8<_IqK1jUsApk)+~R zNFTCD-h>M5Y{qTQ&0#j@I@tmXGj%rzhTW5%Bkh&sSc=$Fv;M@1y!zvYG5P2(2|(&W zlcbR1{--rJ&s!rB{G-sX5^PaM@3EqWVz_y9cwLR9xMig&9gq(voeI)W&{d6j1jh&< zARXi&APWE1FQWh7eoZjuP z;vdgX>zep^{{2%hem;e*gDJhK1Hj12nBLIJoL<=0+8SVEBx7!4Ea+hBY;A1gBwvY<)tj~T=H`^?3>zeWWm|LAwo*S4Z%bDVUe z6r)CH1H!(>OH#MXFJ2V(U(qxD{4Px2`8qfFLG+=a;B^~Te_Z!r3RO%Oc#ZAHKQxV5 zRYXxZ9T2A%NVJIu5Pu7!Mj>t%YDO$T@M=RR(~mi%sv(YXVl`yMLD;+WZ{vG9(@P#e zMo}ZiK^7^h6TV%cG+;jhJ0s>h&VERs=tuZz^Tlu~%d{ZHtq6hX$V9h)Bw|jVCMudd zwZ5l7In8NT)qEPGF$VSKg&fb0%R2RnUnqa){)V(X(s0U zkCdVZe6wy{+_WhZh3qLp245Y2RR$@g-!9PjJ&4~0cFSHMUn=>dapv)hy}|y91ZWTV zCh=z*!S3_?`$&-eZ6xIXUq8RGl9oK0BJw*TdU6A`LJqX9eS3X@F)g$jLkBWFscPhR zpCv8#KeAc^y>>Y$k^=r|K(DTC}T$0#jQBOwB#@`P6~*IuW_8JxCG}J4va{ zsZzt}tt+cv7=l&CEuVtjD6G2~_Meh%p4RGuY?hSt?(sreO_F}8r7Kp$qQdvCdZnDQ zxzc*qchE*E2=WK)^oRNa>Ttj`fpvF-JZ5tu5>X1xw)J@1!IqWjq)ESBG?J|ez`-Tc zi5a}GZx|w-h%5lNDE_3ho0hEXMoaofo#Z;$8|2;EDF&*L+e$u}K=u?pb;dv$SXeQM zD-~7P0i_`Wk$#YP$=hw3UVU+=^@Kuy$>6?~gIXx636jh{PHly_a2xNYe1l60`|y!7 z(u%;ILuW0DDJ)2%y`Zc~hOALnj1~txJtcdD#o4BCT68+8gZe`=^te6H_egxY#nZH&P*)hgYaoJ^qtmpeea`35Fw)cy!w@c#v6E29co8&D9CTCl%^GV|X;SpneSXzV~LXyRn-@K0Df z{tK-nDWA!q38M1~`xUIt_(MO^R(yNY#9@es9RQbY@Ia*xHhD&=k^T+ zJi@j2I|WcgW=PuAc>hs`(&CvgjL2a9Rx zCbZyUpi8NWUOi@S%t+Su4|r&UoU|ze9SVe7p@f1GBkrjkkq)T}X%Qo1g!SQ{O{P?m z-OfGyyWta+UCXH+-+(D^%kw#A1-U;?9129at7MeCCzC{DNgO zeSqsV>W^NIfTO~4({c}KUiuoH8A*J!Cb0*sp*w-Bg@YfBIPZFH!M}C=S=S7PLLcIG zs7K77g~W)~^|+mx9onzMm0qh(f~OsDTzVmRtz=aZTllgR zGUn~_5hw_k&rll<4G=G+`^Xlnw;jNYDJz@bE?|r866F2hA9v0-8=JO3g}IHB#b`hy zA42a0>{0L7CcabSD+F7?pGbS1KMvT{@1_@k!_+Ki|5~EMGt7T%u=79F)8xEiL5!EJ zzuxQ`NBliCoJMJdwu|);zRCD<5Sf?Y>U$trQ-;xj6!s5&w=9E7)%pZ+1Nh&8nCCwM zv5>Ket%I?cxr3vVva`YeR?dGxbG@pi{H#8@kFEf0Jq6~K4>kt26*bxv=P&jyE#e$| zDJB_~imk^-z|o!2njF2hL*|7sHCnzluhJjwLQGDmC)Y9 zr9ZN`s)uCd^XDvn)VirMgW~qfn1~SaN^7vcX#K1G`==UGaDVVx$0BQnubhX|{e z^i0}>k-;BP#Szk{cFjO{2x~LjK{^Upqd&<+03_iMLp0$!6_$@TbX>8U-f*-w-ew1?`CtD_0y_Lo|PfKi52p?`5$Jzx0E8`M0 zNIb?#!K$mM4X%`Ry_yhG5k@*+n4||2!~*+&pYLh~{`~o(W|o64^NrjP?-1Lgu?iK^ zTX6u3?#$?R?N!{599vg>G8RGHw)Hx&=|g4599y}mXNpM{EPKKXB&+m?==R3GsIq?G zL5fH={=zawB(sMlDBJ+{dgb)Vx3pu>L=mDV0{r1Qs{0Pn%TpopH{m(By4;{FBvi{I z$}x!Iw~MJOL~&)p93SDIfP3x%ROjg}X{Sme#hiJ&Yk&a;iR}V|n%PriZBY8SX2*;6 z4hdb^&h;Xz%)BDACY5AUsV!($lib4>11UmcgXKWpzRL8r2Srl*9Y(1uBQsY&hO&uv znDNff0tpHlLISam?o(lOp#CmFdH<6HmA0{UwfU#Y{8M+7od8b8|B|7ZYR9f<#+V|ZSaCQvI$~es~g(Pv{2&m_rKSB2QQ zMvT}$?Ll>V+!9Xh5^iy3?UG;dF-zh~RL#++roOCsW^cZ&({6q|?Jt6`?S8=16Y{oH zp50I7r1AC1(#{b`Aq5cw>ypNggHKM9vBx!W$eYIzD!4KbLsZGr2o8>g<@inmS3*>J zx8oG((8f!ei|M@JZB`p7+n<Q}?>h249<`7xJ?u}_n;Gq(&km#1ULN87CeTO~FY zS_Ty}0TgQhV zOh3T7{{x&LSYGQfKR1PDIkP!WnfC1$l+fs@Di+d4O=eVKeF~2fq#1<8hEvpwuqcaH z4A8u~r^gnY3u6}zj*RHjk{AHhrrDqaj?|6GaVJbV%o-nATw}ASFr!f`Oz|u_QPkR# z0mDudY1dZRlk@TyQ?%Eti=$_WNFtLpSx9=S^be{wXINp%MU?a`F66LNU<c;0&ngifmP9i;bj6&hdGMW^Kf8e6ZDXbQD&$QAAMo;OQ)G zW(qlHh;}!ZP)JKEjm$VZjTs@hk&4{?@+NADuYrr!R^cJzU{kGc1yB?;7mIyAWwhbeA_l_lw-iDVi7wcFurf5 z#Uw)A@a9fOf{D}AWE%<`s1L_AwpZ?F!Vac$LYkp<#A!!`XKaDC{A%)~K#5z6>Hv@V zBEqF(D5?@6r3Pwj$^krpPDCjB+UOszqUS;b2n>&iAFcw<*im2(b3|5u6SK!n9Sg4I z0KLcwA6{Mq?p%t>aW0W!PQ>iUeYvNjdKYqII!CE7SsS&Rj)eIw-K4jtI?II+0IdGq z2WT|L3RL?;GtGgt1LWfI4Ka`9dbZXc$TMJ~8#Juv@K^1RJN@yzdLS8$AJ(>g!U9`# zx}qr7JWlU+&m)VG*Se;rGisutS%!6yybi%B`bv|9rjS(xOUIvbNz5qtvC$_JYY+c& za*3*2$RUH8p%pSq>48xR)4qsp!Q7BEiJ*`^>^6INRbC@>+2q9?x(h0bpc>GaNFi$K zPH$6!#(~{8@0QZk=)QnM#I=bDx5vTvjm$f4K}%*s+((H2>tUTf==$wqyoI`oxI7>C z&>5fe)Yg)SmT)eA(|j@JYR1M%KixxC-Eceknf-;N=jJTwKvk#@|J^&5H0c+%KxHUI z6dQbwwVx3p?X<_VRVb2fStH?HH zFR@Mp=qX%#L3XL)+$PXKV|o|#DpHAoqvj6uQKe@M-mnhCSou7Dj4YuO6^*V`m)1lf z;)@e%1!Qg$10w8uEmz{ENb$^%u}B;J7sDd zump}onoD#!l=agcBR)iG!3AF0-63%@`K9G(CzKrm$VJ{v7^O9Ps7Zej|3m= zVXlR&yW6=Y%mD30G@|tf=yC7-#L!16Q=dq&@beWgaIL40k0n% z)QHrp2Jck#evLMM1RGt3WvQ936ZC9vEje0nFMfvmOHVI+&okB_K|l-;|4vW;qk>n~ z+|kk8#`K?x`q>`(f6A${wfw9Cx(^)~tX7<#TpxR#zYG2P+FY~mG{tnEkv~d6oUQA+ z&hNTL=~Y@rF`v-RZlts$nb$3(OL1&@Y11hhL9+zUb6)SP!;CD)^GUtUpCHBE`j1te zAGud@miCVFLk$fjsrcpjsadP__yj9iEZUW{Ll7PPi<$R;m1o!&Xdl~R_v0;oDX2z^!&8}zNGA}iYG|k zmehMd1%?R)u6R#<)B)1oe9TgYH5-CqUT8N7K-A-dm3hbm_W21p%8)H{O)xUlBVb+iUR}-v5dFaCyfSd zC6Bd7=N4A@+Bna=!-l|*_(nWGDpoyU>nH=}IOrLfS+-d40&(Wo*dDB9nQiA2Tse$R z;uq{`X7LLzP)%Y9aHa4YQ%H?htkWd3Owv&UYbr5NUDAH^<l@Z0Cx%`N+B*i!!1u>D8%;Qt1$ zE5O0{-`9gdDxZ!`0m}ywH!;c{oBfL-(BH<&SQ~smbcobU!j49O^f4&IIYh~f+hK*M zZwTp%{ZSAhMFj1qFaOA+3)p^gnXH^=)`NTYgTu!CLpEV2NF=~-`(}7p^Eof=@VUbd z_9U|8qF7Rueg&$qpSSkN%%%DpbV?8E8ivu@ensI0toJ7Eas^jyFReQ1JeY9plb^{m z&eQO)qPLZQ6O;FTr*aJq=$cMN)QlQO@G&%z?BKUs1&I^`lq>=QLODwa`(mFGC`0H< zOlc*|N?B5&!U6BuJvkL?s1&nsi$*5cCv7^j_*l&$-sBmRS85UIrE--7eD8Gr3^+o? zqG-Yl4S&E;>H>k^a0GdUI(|n1`ws@)1%sq2XBdK`mqrNq_b4N{#VpouCXLzNvjoFv zo9wMQ6l0+FT+?%N(ka*;%m~(?338bu32v26!{r)|w8J`EL|t$}TA4q_FJRX5 zCPa{hc_I(7TGE#@rO-(!$1H3N-C0{R$J=yPCXCtGk{4>=*B56JdXU9cQVwB`6~cQZ zf^qK21x_d>X%dT!!)CJQ3mlHA@ z{Prkgfs6=Tz%63$6Zr8CO0Ak3A)Cv#@BVKr&aiKG7RYxY$Yx>Bj#3gJk*~Ps-jc1l z;4nltQwwT4@Z)}Pb!3xM?+EW0qEKA)sqzw~!C6wd^{03-9aGf3Jmt=}w-*!yXupLf z;)>-7uvWN4Unn8b4kfIza-X=x*e4n5pU`HtgpFFd))s$C@#d>aUl3helLom+RYb&g zI7A9GXLRZPl}iQS*d$Azxg-VgcUr*lpLnbPKUV{QI|bsG{8bLG<%CF( zMoS4pRDtLVYOWG^@ox^h8xL~afW_9DcE#^1eEC1SVSb1BfDi^@g?#f6e%v~Aw>@w- zIY0k+2lGWNV|aA*e#`U3=+oBDmGeInfcL)>*!w|*;mWiKNG6wP6AW4-4imN!W)!hE zA02~S1*@Q`fD*+qX@f3!2yJX&6FsEfPditB%TWo3=HA;T3o2IrjS@9SSxv%{{7&4_ zdS#r4OU41~GYMiib#z#O;zohNbhJknrPPZS6sN$%HB=jUnlCO_w5Gw5EeE@KV>soy z2EZ?Y|4RQDDjt5y!WBlZ(8M)|HP<0YyG|D%RqD+K#e7-##o3IZxS^wQ5{Kbzb6h(i z#(wZ|^ei>8`%ta*!2tJzwMv+IFHLF`zTU8E^Mu!R*45_=ccqI};Zbyxw@U%a#2}%f zF>q?SrUa_a4H9l+uW8JHh2Oob>NyUwG=QH~-^ZebU*R@67DcXdz2{HVB4#@edz?B< z5!rQH3O0>A&ylROO%G^fimV*LX7>!%re{_Sm6N>S{+GW1LCnGImHRoF@csnFzn@P0 zM=jld0z%oz;j=>c7mMwzq$B^2mae7NiG}%>(wtmsDXkWk{?BeMpTrIt3Mizq?vRsf zi_WjNp+61uV(%gEU-Vf0;>~vcDhe(dzWdaf#4mH3o^v{0EWhj?E?$5v02sV@xL0l4 zX0_IMFtQ44PfWBbPYN#}qxa%=J%dlR{O!KyZvk^g5s?sTNycWYPJ^FK(nl3k?z-5t z39#hKrdO7V(@!TU)LAPY&ngnZ1MzLEeEiZznn7e-jLCy8LO zu^7_#z*%I-BjS#Pg-;zKWWqX-+Ly$T!4`vTe5ZOV0j?TJVA*2?*=82^GVlZIuH%9s zXiV&(T(QGHHah=s&7e|6y?g+XxZGmK55`wGV>@1U)Th&=JTgJq>4mI&Av2C z)w+kRoj_dA!;SfTfkgMPO>7Dw6&1*Hi1q?54Yng`JO&q->^CX21^PrU^JU#CJ_qhV zSG>afB%>2fx<~g8p=P8Yzxqc}s@>>{g7}F!;lCXvF#RV)^fyYb_)iKVCz1xEq=fJ| z0a7DMCK*FuP=NM*5h;*D`R4y$6cpW-E&-i{v`x=Jbk_xSn@2T3q!3HoAOB`@5Vg6) z{PW|@9o!e;v1jZ2{=Uw6S6o{g82x6g=k!)cFSC*oemHaVjg?VpEmtUuD2_J^A~$4* z3O7HsbA6wxw{TP5Kk)(Vm?gKo+_}11vbo{Tp_5x79P~#F)ahQXT)tSH5;;14?s)On zel1J>1x>+7;g1Iz2FRpnYz;sD0wG9Q!vuzE9yKi3@4a9Nh1!GGN?hA)!mZEnnHh&i zf?#ZEN2sFbf~kV;>K3UNj1&vFhc^sxgj8FCL4v>EOYL?2uuT`0eDH}R zmtUJMxVrV5H{L53hu3#qaWLUa#5zY?f5ozIn|PkMWNP%n zWB5!B0LZB0kLw$k39=!akkE9Q>F4j+q434jB4VmslQ;$ zKiO#FZ`p|dKS716jpcvR{QJkSNfDVhr2%~eHrW;fU45>>snr*S8Vik-5eN5k*c2Mp zyxvX&_cFbB6lODXznHHT|rsURe2!swomtrqc~w5 zymTM8!w`1{04CBprR!_F{5LB+2_SOuZN{b*!J~1ZiPpP-M;);!ce!rOPDLtgR@Ie1 zPreuqm4!H)hYePcW1WZ0Fyaqe%l}F~Orr)~+;mkS&pOhP5Ebb`cnUt!X_QhP4_4p( z8YKQCDKGIy>?WIFm3-}Br2-N`T&FOi?t)$hjphB9wOhBXU#Hb+zm&We_-O)s(wc`2 z8?VsvU;J>Ju7n}uUb3s1yPx_F*|FlAi=Ge=-kN?1;`~6szP%$3B0|8Sqp%ebM)F8v zADFrbeT0cgE>M0DMV@_Ze*GHM>q}wWMzt|GYC%}r{OXRG3Ij&<+nx9;4jE${Fj_r* z`{z1AW_6Myd)i6e0E-h&m{{CvzH=Xg!&(bLYgRMO_YVd8JU7W+7MuGWNE=4@OvP9+ zxi^vqS@5%+#gf*Z@RVyU9N1sO-(rY$24LGsg1>w>s6ST^@)|D9>cT50maXLUD{Fzf zt~tp{OSTEKg3ZSQyQQ5r51){%=?xlZ54*t1;Ow)zLe3i?8tD8YyY^k%M)e`V*r+vL zPqUf&m)U+zxps+NprxMHF{QSxv}>lE{JZETNk1&F+R~bp{_T$dbXL2UGnB|hgh*p4h$clt#6;NO~>zuyY@C-MD@)JCc5XrYOt`wW7! z_ti2hhZBMJNbn0O-uTxl_b6Hm313^fG@e;RrhIUK9@# z+DHGv_Ow$%S8D%RB}`doJjJy*aOa5mGHVHz0e0>>O_%+^56?IkA5eN+L1BVCp4~m=1eeL zb;#G!#^5G%6Mw}r1KnaKsLvJB%HZL)!3OxT{k$Yo-XrJ?|7{s4!H+S2o?N|^Z z)+?IE9H7h~Vxn5hTis^3wHYuOU84+bWd)cUKuHapq=&}WV#OxHpLab`NpwHm8LmOo zjri+!k;7j_?FP##CpM+pOVx*0wExEex z@`#)K<-ZrGyArK;a%Km`^+We|eT+#MygHOT6lXBmz`8|lyZOwL1+b+?Z$0OhMEp3R z&J=iRERpv~TC=p2-BYLC*?4 zxvPs9V@g=JT0>zky5Poj=fW_M!c)Xxz1<=&_ZcL=LMZJqlnO1P^xwGGW*Z+yTBvbV z-IFe6;(k1@$1;tS>{%pXZ_7w+i?N4A2=TXnGf=YhePg8bH8M|Lk-->+w8Y+FjZ;L=wSGwxfA`gqSn)f(XNuSm>6Y z@|#e-)I(PQ^G@N`%|_DZSb4_pkaEF0!-nqY+t#pyA>{9^*I-zw4SYA1_z2Bs$XGUZbGA;VeMo%CezHK0lO={L%G)dI-+8w?r9iexdoB{?l zbJ}C?huIhWXBVs7oo{!$lOTlvCLZ_KN1N+XJGuG$rh<^eUQIqcI7^pmqhBSaOKNRq zrx~w^?9C?*&rNwP_SPYmo;J-#!G|{`$JZK7DxsM3N^8iR4vvn>E4MU&Oe1DKJvLc~ zCT>KLZ1;t@My zRj_2hI^61T&LIz)S!+AQIV23n1>ng+LUvzv;xu!4;wpqb#EZz;F)BLUzT;8UA1x*6vJ zicB!3Mj03s*kGV{g`fpC?V^s(=JG-k1EMHbkdP4P*1^8p_TqO|;!Zr%GuP$8KLxuf z=pv*H;kzd;P|2`JmBt~h6|GxdU~@weK5O=X&5~w$HpfO}@l-T7@vTCxVOwCkoPQv8 z@aV_)I5HQtfs7^X=C03zYmH4m0S!V@JINm6#(JmZRHBD?T!m^DdiZJrhKpBcur2u1 zf9e4%k$$vcFopK5!CC`;ww(CKL~}mlxK_Pv!cOsFgVkNIghA2Au@)t6;Y3*2gK=5d z?|@1a)-(sQ%uFOmJ7v2iG&l&m^u&^6DJM#XzCrF%r>{2XKyxLD2rgWBD;i(!e4InDQBDg==^z;AzT2z~OmV0!?Z z0S9pX$+E;w3WN;v&NYT=+G8hf=6w0E1$0AOr61}eOvE8W1jX%>&Mjo7&!ulawgzLH zbcb+IF(s^3aj12WSi#pzIpijJJzkP?JzRawnxmNDSUR#7!29vHULCE<3Aa#be}ie~d|!V+ z%l~s9Odo$G&fH!t!+`rUT0T9DulF!Yq&BfQWFZV1L9D($r4H(}Gnf6k3^wa7g5|Ws zj7%d`!3(0bb55yhC6@Q{?H|2os{_F%o=;-h{@Yyyn*V7?{s%Grvpe!H^kl6tF4Zf5 z{Jv1~yZ*iIWL_9C*8pBMQArfJJ0d9Df6Kl#wa}7Xa#Ef_5B7=X}DzbQXVPfCwTO@9+@;A^Ti6il_C>g?A-GFwA0#U;t4;wOm-4oS})h z5&on>NAu67O?YCQr%7XIzY%LS4bha9*e*4bU4{lGCUmO2UQ2U)QOqClLo61Kx~3dI zmV3*(P6F_Tr-oP%x!0kTnnT?Ep5j;_IQ^pTRp=e8dmJtI4YgWd0}+b2=ATkOhgpXe z;jmw+FBLE}UIs4!&HflFr4)vMFOJ19W4f2^W(=2)F%TAL)+=F>IE$=e=@j-*bFLSg z)wf|uFQu+!=N-UzSef62u0-C8Zc7 zo6@F)c+nZA{H|+~7i$DCU0pL{0Ye|fKLuV^w!0Y^tT$isu%i1Iw&N|tX3kwFKJN(M zXS`k9js66o$r)x?TWL}Kxl`wUDUpwFx(w4Yk%49;$sgVvT~n8AgfG~HUcDt1TRo^s zdla@6heJB@JV z!vK;BUMznhzGK6PVtj0)GB=zTv6)Q9Yt@l#fv7>wKovLobMV-+(8)NJmyF8R zcB|_K7=FJGGn^X@JdFaat0uhKjp3>k#^&xE_}6NYNG?kgTp>2Iu?ElUjt4~E-?`Du z?mDCS9wbuS%fU?5BU@Ijx>1HG*N?gIP+<~xE4u=>H`8o((cS5M6@_OK%jSjFHirQK zN9@~NXFx*jS{<|bgSpC|SAnA@I)+GB=2W|JJChLI_mx+-J(mSJ!b)uUom6nH0#2^(L@JBlV#t zLl?j54s`Y3vE^c_3^Hl0TGu*tw_n?@HyO@ZrENxA+^!)OvUX28gDSF*xFtQzM$A+O zCG=n#6~r|3zt=8%GuG} z<#VCZ%2?3Q(Ad#Y7GMJ~{U3>E{5e@z6+rgZLX{Cxk^p-7dip^d29;2N1_mm4QkASo z-L`GWWPCq$uCo;X_BmGIpJFBlhl<8~EG{vOD1o|X$aB9KPhWO_cKiU*$HWEgtf=fn zsO%9bp~D2c@?*K9jVN@_vhR03>M_8h!_~%aN!Cnr?s-!;U3SVfmhRwk11A^8Ns`@KeE}+ zN$H}a1U6E;*j5&~Og!xHdfK5M<~xka)x-0N)K_&e7AjMz`toDzasH+^1bZlC!n()crk9kg@$(Y{wdKvbuUd04N^8}t1iOgsKF zGa%%XWx@WoVaNC1!|&{5ZbkopFre-Lu(LCE5HWZBoE#W@er9W<>R=^oYxBvypN#x3 zq#LC8&q)GFP=5^-bpHj?LW=)-g+3_)Ylps!3^YQ{9~O9&K)xgy zMkCWaApU-MI~e^cV{Je75Qr7eF%&_H)BvfyKL=gIA>;OSq(y z052BFz3E(Prg~09>|_Z@!qj}@;8yxnw+#Ej0?Rk<y}4ghbD569B{9hSFr*^ygZ zr6j7P#gtZh6tMk6?4V$*Jgz+#&ug;yOr>=qdI#9U&^am2qoh4Jy}H2%a|#Fs{E(5r z%!ijh;VuGA6)W)cJZx+;9Bp1LMUzN~x_8lQ#D3+sL{be-Jyeo@@dv7XguJ&S5vrH` z>QxOMWn7N-T!D@1(@4>ZlL^y5>m#0!HKovs12GRav4z!>p(1~xok8+_{| z#Ae4{9#NLh#Vj2&JuIn5$d6t@__`o}umFo(n0QxUtd2GKCyE+erwXY?`cm*h&^9*8 zJ+8x6fRZI-e$CRygofIQN^dWysCxgkyr{(_oBwwSRxZora1(%(aC!5BTtj^+YuevI zx?)H#(xlALUp6QJ!=l9N__$cxBZ5p&7;qD3PsXRFVd<({Kh+mShFWJNpy`N@ab7?9 zv5=klvCJ4bx|-pvOO2-+G)6O?$&)ncA#Urze2rlBfp#htudhx-NeRnJ@u%^_bfw4o z4|{b8SkPV3b>Wera1W(+N@p9H>dc6{cnkh-sgr?e%(YkWvK+0YXVwk0=d`)}*47*B z5JGkEdVix!w7-<%r0JF~`ZMMPe;f0EQHuYHxya`puazyph*ZSb1mJAt^k4549BfS; zK7~T&lRb=W{s&t`DJ$B}s-eH1&&-wEOH1KWsKn0a(ZI+G!v&W4A*cl>qAvUv6pbUR z#(f#EKV8~hk&8oayBz4vaswc(?qw1vn`yC zZQDl2PCB-&Uu@g9ZQHhO+v(W0bNig{-k0;;`+wM@#@J)8r?qOYs#&vUna8ILxN7S{ zp1s41KnR8miQJtJtOr|+qk}wrLt+N*z#5o`TmD1)E&QD(Vh&pjZJ_J*0!8dy_ z>^=@v=J)C`x&gjqAYu`}t^S=DFCtc0MkBU2zf|69?xW`Ck~(6zLD)gSE{7n~6w8j_ zoH&~$ED2k5-yRa0!r8fMRy z;QjBYUaUnpd}mf%iVFPR%Dg9!d>g`01m~>2s))`W|5!kc+_&Y>wD@@C9%>-lE`WB0 zOIf%FVD^cj#2hCkFgi-fgzIfOi+ya)MZK@IZhHT5FVEaSbv-oDDs0W)pA0&^nM0TW zmgJmd7b1R7b0a`UwWJYZXp4AJPteYLH>@M|xZFKwm!t3D3&q~av?i)WvAKHE{RqpD{{%OhYkK?47}+}` zrR2(Iv9bhVa;cDzJ%6ntcSbx7v7J@Y4x&+eWSKZ*eR7_=CVIUSB$^lfYe@g+p|LD{ zPSpQmxx@b$%d!05|H}WzBT4_cq?@~dvy<7s&QWtieJ9)hd4)$SZz}#H2UTi$CkFWW|I)v_-NjuH!VypONC=1`A=rm_jfzQ8Fu~1r8i{q-+S_j$ z#u^t&Xnfi5tZtl@^!fUJhx@~Cg0*vXMK}D{>|$#T*+mj(J_@c{jXBF|rm4-8%Z2o! z2z0o(4%8KljCm^>6HDK!{jI7p+RAPcty_~GZ~R_+=+UzZ0qzOwD=;YeZt*?3%UGdr z`c|BPE;yUbnyARUl&XWSNJ<+uRt%!xPF&K;(l$^JcA_CMH6)FZt{>6ah$|(9$2fc~ z=CD00uHM{qv;{Zk9FR0~u|3|Eiqv9?z2#^GqylT5>6JNZwKqKBzzQpKU2_pmtD;CT zi%Ktau!Y2Tldfu&b0UgmF(SSBID)15*r08eoUe#bT_K-G4VecJL2Pa=6D1K6({zj6 za(2Z{r!FY5W^y{qZ}08+h9f>EKd&PN90f}Sc0ejf%kB4+f#T8Q1=Pj=~#pi$U zp#5rMR%W25>k?<$;$x72pkLibu1N|jX4cWjD3q^Pk3js!uK6h7!dlvw24crL|MZs_ zb%Y%?Fyp0bY0HkG^XyS76Ts*|Giw{31LR~+WU5NejqfPr73Rp!xQ1mLgq@mdWncLy z%8}|nzS4P&`^;zAR-&nm5f;D-%yNQPwq4N7&yULM8bkttkD)hVU>h>t47`{8?n2&4 zjEfL}UEagLUYwdx0sB2QXGeRmL?sZ%J!XM`$@ODc2!y|2#7hys=b$LrGbvvjx`Iqi z&RDDm3YBrlKhl`O@%%&rhLWZ*ABFz2nHu7k~3@e4)kO3%$=?GEFUcCF=6-1n!x^vmu+Ai*amgXH+Rknl6U>#9w;A} zn2xanZSDu`4%%x}+~FG{Wbi1jo@wqBc5(5Xl~d0KW(^Iu(U3>WB@-(&vn_PJt9{1`e9Iic@+{VPc`vP776L*viP{wYB2Iff8hB%E3|o zGMOu)tJX!`qJ}ZPzq7>=`*9TmETN7xwU;^AmFZ-ckZjV5B2T09pYliaqGFY|X#E-8 z20b>y?(r-Fn5*WZ-GsK}4WM>@TTqsxvSYWL6>18q8Q`~JO1{vLND2wg@58OaU!EvT z1|o+f1mVXz2EKAbL!Q=QWQKDZpV|jznuJ}@-)1&cdo z^&~b4Mx{*1gurlH;Vhk5g_cM&6LOHS2 zRkLfO#HabR1JD4Vc2t828dCUG#DL}f5QDSBg?o)IYYi@_xVwR2w_ntlpAW0NWk$F1 z$If?*lP&Ka1oWfl!)1c3fl`g*lMW3JOn#)R1+tfwrs`aiFUgz3;XIJ>{QFxLCkK30 zNS-)#DON3yb!7LBHQJ$)4y%TN82DC2-9tOIqzhZ27@WY^<6}vXCWcR5iN{LN8{0u9 zNXayqD=G|e?O^*ms*4P?G%o@J1tN9_76e}E#66mr89%W_&w4n66~R;X_vWD(oArwj z4CpY`)_mH2FvDuxgT+akffhX0b_slJJ*?Jn3O3~moqu2Fs1oL*>7m=oVek2bnprnW zixkaIFU%+3XhNA@@9hyhFwqsH2bM|`P?G>i<-gy>NflhrN{$9?LZ1ynSE_Mj0rADF zhOz4FnK}wpLmQuV zgO4_Oz9GBu_NN>cPLA=`SP^$gxAnj;WjJnBi%Q1zg`*^cG;Q)#3Gv@c^j6L{arv>- zAW%8WrSAVY1sj$=umcAf#ZgC8UGZGoamK}hR7j6}i8#np8ruUlvgQ$j+AQglFsQQq zOjyHf22pxh9+h#n$21&$h?2uq0>C9P?P=Juw0|;oE~c$H{#RGfa>| zj)Iv&uOnaf@foiBJ}_;zyPHcZt1U~nOcNB{)og8Btv+;f@PIT*xz$x!G?u0Di$lo7 zOugtQ$Wx|C($fyJTZE1JvR~i7LP{ zbdIwqYghQAJi9p}V&$=*2Azev$6K@pyblphgpv8^9bN!?V}{BkC!o#bl&AP!3DAjM zmWFsvn2fKWCfjcAQmE+=c3Y7j@#7|{;;0f~PIodmq*;W9Fiak|gil6$w3%b_Pr6K_ zJEG@&!J%DgBZJDCMn^7mk`JV0&l07Bt`1ymM|;a)MOWz*bh2#d{i?SDe9IcHs7 zjCrnyQ*Y5GzIt}>`bD91o#~5H?4_nckAgotN{2%!?wsSl|LVmJht$uhGa+HiH>;av z8c?mcMYM7;mvWr6noUR{)gE!=i7cZUY7e;HXa221KkRoc2UB>s$Y(k%NzTSEr>W(u z<(4mcc)4rB_&bPzX*1?*ra%VF}P1nwiP5cykJ&W{!OTlz&Td0pOkVp+wc z@k=-Hg=()hNg=Q!Ub%`BONH{ z_=ZFgetj@)NvppAK2>8r!KAgi>#%*7;O-o9MOOfQjV-n@BX6;Xw;I`%HBkk20v`qoVd0)}L6_49y1IhR z_OS}+eto}OPVRn*?UHC{eGyFU7JkPz!+gX4P>?h3QOwGS63fv4D1*no^6PveUeE5% zlehjv_3_^j^C({a2&RSoVlOn71D8WwMu9@Nb@=E_>1R*ve3`#TF(NA0?d9IR_tm=P zOP-x;gS*vtyE1Cm zG0L?2nRUFj#aLr-R1fX*$sXhad)~xdA*=hF3zPZhha<2O$Ps+F07w*3#MTe?)T8|A!P!v+a|ot{|^$q(TX`35O{WI0RbU zCj?hgOv=Z)xV?F`@HKI11IKtT^ocP78cqHU!YS@cHI@{fPD?YXL)?sD~9thOAv4JM|K8OlQhPXgnevF=F7GKD2#sZW*d za}ma31wLm81IZxX(W#A9mBvLZr|PoLnP>S4BhpK8{YV_}C|p<)4#yO{#ISbco92^3 zv&kCE(q9Wi;9%7>>PQ!zSkM%qqqLZW7O`VXvcj;WcJ`2~v?ZTYB@$Q&^CTfvy?1r^ z;Cdi+PTtmQwHX_7Kz?r#1>D zS5lWU(Mw_$B&`ZPmqxpIvK<~fbXq?x20k1~9az-Q!uR78mCgRj*eQ>zh3c$W}>^+w^dIr-u{@s30J=)1zF8?Wn|H`GS<=>Om|DjzC{}Jt?{!fSJe*@$H zg>wFnlT)k#T?LslW zu$^7Uy~$SQ21cE?3Ijl+bLfuH^U5P^$@~*UY#|_`uvAIe(+wD2eF}z_y!pvomuVO; zS^9fbdv)pcm-B@CW|Upm<7s|0+$@@<&*>$a{aW+oJ%f+VMO<#wa)7n|JL5egEgoBv zl$BY(NQjE0#*nv=!kMnp&{2Le#30b)Ql2e!VkPLK*+{jv77H7)xG7&=aPHL7LK9ER z5lfHxBI5O{-3S?GU4X6$yVk>lFn;ApnwZybdC-GAvaznGW-lScIls-P?Km2mF>%B2 zkcrXTk+__hj-3f48U%|jX9*|Ps41U_cd>2QW81Lz9}%`mTDIhE)jYI$q$ma7Y-`>% z8=u+Oftgcj%~TU}3nP8&h7k+}$D-CCgS~wtWvM|UU77r^pUw3YCV80Ou*+bH0!mf0 zxzUq4ed6y>oYFz7+l18PGGzhB^pqSt)si=9M>~0(Bx9*5r~W7sa#w+_1TSj3Jn9mW zMuG9BxN=}4645Cpa#SVKjFst;9UUY@O<|wpnZk$kE+to^4!?0@?Cwr3(>!NjYbu?x z1!U-?0_O?k!NdM^-rIQ8p)%?M+2xkhltt*|l=%z2WFJhme7*2xD~@zk#`dQR$6Lmd zb3LOD4fdt$Cq>?1<%&Y^wTWX=eHQ49Xl_lFUA(YQYHGHhd}@!VpYHHm=(1-O=yfK#kKe|2Xc*9}?BDFN zD7FJM-AjVi)T~OG)hpSWqH>vlb41V#^G2B_EvYlWhDB{Z;Q9-0)ja(O+By`31=biA zG&Fs#5!%_mHi|E4Nm$;vVQ!*>=_F;ZC=1DTPB#CICS5fL2T3XmzyHu?bI;m7D4@#; ztr~;dGYwb?m^VebuULtS4lkC_7>KCS)F@)0OdxZIFZp@FM_pHnJes8YOvwB|++#G( z&dm*OP^cz95Wi15vh`Q+yB>R{8zqEhz5of>Po$9LNE{xS<)lg2*roP*sQ}3r3t<}; zPbDl{lk{pox~2(XY5=qg0z!W-x^PJ`VVtz$git7?)!h>`91&&hESZy1KCJ2nS^yMH z!=Q$eTyRi68rKxdDsdt+%J_&lapa{ds^HV9Ngp^YDvtq&-Xp}60B_w@Ma>_1TTC;^ zpbe!#gH}#fFLkNo#|`jcn?5LeUYto%==XBk6Ik0kc4$6Z+L3x^4=M6OI1=z5u#M%0 z0E`kevJEpJjvvN>+g`?gtnbo$@p4VumliZV3Z%CfXXB&wPS^5C+7of2tyVkMwNWBiTE2 z8CdPu3i{*vR-I(NY5syRR}I1TJOV@DJy-Xmvxn^IInF>Tx2e)eE9jVSz69$6T`M9-&om!T+I znia!ZWJRB28o_srWlAxtz4VVft8)cYloIoVF=pL zugnk@vFLXQ_^7;%hn9x;Vq?lzg7%CQR^c#S)Oc-8d=q_!2ZVH764V z!wDKSgP}BrVV6SfCLZnYe-7f;igDs9t+K*rbMAKsp9L$Kh<6Z;e7;xxced zn=FGY<}CUz31a2G}$Q(`_r~75PzM4l_({Hg&b@d8&jC}B?2<+ed`f#qMEWi z`gm!STV9E4sLaQX+sp5Nu9*;9g12naf5?=P9p@H@f}dxYprH+3ju)uDFt^V{G0APn zS;16Dk{*fm6&BCg#2vo?7cbkkI4R`S9SSEJ=#KBk3rl69SxnCnS#{*$!^T9UUmO#&XXKjHKBqLdt^3yVvu8yn|{ zZ#%1CP)8t-PAz(+_g?xyq;C2<9<5Yy<~C74Iw(y>uUL$+$mp(DRcCWbCKiGCZw@?_ zdomfp+C5xt;j5L@VfhF*xvZdXwA5pcdsG>G<8II-|1dhAgzS&KArcb0BD4ZZ#WfiEY{hkCq5%z9@f|!EwTm;UEjKJsUo696V>h zy##eXYX}GUu%t{Gql8vVZKkNhQeQ4C%n|RmxL4ee5$cgwlU+?V7a?(jI#&3wid+Kz5+x^G!bb#$q>QpR#BZ}Xo5UW^ zD&I`;?(a}Oys7-`I^|AkN?{XLZNa{@27Dv^s4pGowuyhHuXc zuctKG2x0{WCvg_sGN^n9myJ}&FXyGmUQnW7fR$=bj$AHR88-q$D!*8MNB{YvTTEyS zn22f@WMdvg5~o_2wkjItJN@?mDZ9UUlat2zCh(zVE=dGi$rjXF7&}*sxac^%HFD`Y zTM5D3u5x**{bW!68DL1A!s&$2XG@ytB~dX-?BF9U@XZABO`a|LM1X3HWCllgl0+uL z04S*PX$%|^WAq%jkzp~%9HyYIF{Ym?k)j3nMwPZ=hlCg9!G+t>tf0o|J2%t1 ztC+`((dUplgm3`+0JN~}&FRRJ3?l*>Y&TfjS>!ShS`*MwO{WIbAZR#<%M|4c4^dY8 z{Rh;-!qhY=dz5JthbWoovLY~jNaw>%tS4gHVlt5epV8ekXm#==Po$)}mh^u*cE>q7*kvX&gq)(AHoItMYH6^s6f(deNw%}1=7O~bTHSj1rm2|Cq+3M z93djjdomWCTCYu!3Slx2bZVy#CWDozNedIHbqa|otsUl+ut?>a;}OqPfQA05Yim_2 zs@^BjPoFHOYNc6VbNaR5QZfSMh2S*`BGwcHMM(1@w{-4jVqE8Eu0Bi%d!E*^Rj?cR z7qgxkINXZR)K^=fh{pc0DCKtrydVbVILI>@Y0!Jm>x-xM!gu%dehm?cC6ok_msDVA*J#{75%4IZt}X|tIVPReZS#aCvuHkZxc zHVMtUhT(wp09+w9j9eRqz~LtuSNi2rQx_QgQ(}jBt7NqyT&ma61ldD(s9x%@q~PQl zp6N*?=N$BtvjQ_xIT{+vhb1>{pM0Arde0!X-y))A4znDrVx8yrP3B1(7bKPE5jR@5 zwpzwT4cu~_qUG#zYMZ_!2Tkl9zP>M%cy>9Y(@&VoB84#%>amTAH{(hL4cDYt!^{8L z645F>BWO6QaFJ-{C-i|-d%j7#&7)$X7pv#%9J6da#9FB5KyDhkA+~)G0^87!^}AP>XaCSScr;kL;Z%RSPD2CgoJ;gpYT5&6NUK$86$T?jRH=w8nI9Z534O?5fk{kd z`(-t$8W|#$3>xoMfXvV^-A(Q~$8SKDE^!T;J+rQXP71XZ(kCCbP%bAQ1|%$%Ov9_a zyC`QP3uPvFoBqr_+$HenHklqyIr>PU_Fk5$2C+0eYy^~7U&(!B&&P2%7#mBUhM!z> z_B$Ko?{Pf6?)gpYs~N*y%-3!1>o-4;@1Zz9VQHh)j5U1aL-Hyu@1d?X;jtDBNk*vMXPn@ z+u@wxHN*{uHR!*g*4Xo&w;5A+=Pf9w#PeZ^x@UD?iQ&${K2c}UQgLRik-rKM#Y5rdDphdcNTF~cCX&9ViRP}`>L)QA4zNXeG)KXFzSDa6 zd^St;inY6J_i=5mcGTx4_^Ys`M3l%Q==f>{8S1LEHn{y(kbxn5g1ezt4CELqy)~TV6{;VW>O9?5^ ztcoxHRa0jQY7>wwHWcxA-BCwzsP>63Kt&3fy*n#Cha687CQurXaRQnf5wc9o8v7Rw zNwGr2fac;Wr-Ldehn7tF^(-gPJwPt@VR1f;AmKgxN&YPL;j=0^xKM{!wuU|^mh3NE zy35quf}MeL!PU;|{OW_x$TBothLylT-J>_x6p}B_jW1L>k)ps6n%7Rh z96mPkJIM0QFNYUM2H}YF5bs%@Chs6#pEnloQhEl?J-)es!(SoJpEPoMTdgA14-#mC zghayD-DJWtUu`TD8?4mR)w5E`^EHbsz2EjH5aQLYRcF{l7_Q5?CEEvzDo(zjh|BKg z3aJl_n#j&eFHsUw4~lxqnr!6NL*se)6H=A+T1e3xUJGQrd}oSPwSy5+$tt{2t5J5@(lFxl43amsARG74iyNC}uuS zd2$=(r6RdamdGx^eatX@F2D8?U23tDpR+Os?0Gq2&^dF+$9wiWf?=mDWfjo4LfRwL zI#SRV9iSz>XCSgEj!cW&9H-njJopYiYuq|2w<5R2!nZ27DyvU4UDrHpoNQZiGPkp@ z1$h4H46Zn~eqdj$pWrv;*t!rTYTfZ1_bdkZmVVIRC21YeU$iS-*XMNK`#p8Z_DJx| zk3Jssf^XP7v0X?MWFO{rACltn$^~q(M9rMYoVxG$15N;nP)A98k^m3CJx8>6}NrUd@wp-E#$Q0uUDQT5GoiK_R{ z<{`g;8s>UFLpbga#DAf%qbfi`WN1J@6IA~R!YBT}qp%V-j!ybkR{uY0X|x)gmzE0J z&)=eHPjBxJvrZSOmt|)hC+kIMI;qgOnuL3mbNR0g^<%|>9x7>{}>a2qYSZAGPt4it?8 zNcLc!Gy0>$jaU?}ZWxK78hbhzE+etM`67*-*x4DN>1_&{@5t7_c*n(qz>&K{Y?10s zXsw2&nQev#SUSd|D8w7ZD2>E<%g^; zV{yE_O}gq?Q|zL|jdqB^zcx7vo(^})QW?QKacx$yR zhG|XH|8$vDZNIfuxr-sYFR{^csEI*IM#_gd;9*C+SysUFejP0{{z7@P?1+&_o6=7V|EJLQun^XEMS)w(=@eMi5&bbH*a0f;iC~2J74V2DZIlLUHD&>mlug5+v z6xBN~8-ovZylyH&gG#ptYsNlT?-tzOh%V#Y33zlsJ{AIju`CjIgf$@gr8}JugRq^c zAVQ3;&uGaVlVw}SUSWnTkH_6DISN&k2QLMBe9YU=sA+WiX@z)FoSYX`^k@B!j;ZeC zf&**P?HQG6Rk98hZ*ozn6iS-dG}V>jQhb3?4NJB*2F?6N7Nd;EOOo;xR7acylLaLy z9)^lykX39d@8@I~iEVar4jmjjLWhR0d=EB@%I;FZM$rykBNN~jf>#WbH4U{MqhhF6 zU??@fSO~4EbU4MaeQ_UXQcFyO*Rae|VAPLYMJEU`Q_Q_%s2*>$#S^)&7er+&`9L=1 z4q4ao07Z2Vsa%(nP!kJ590YmvrWg+YrgXYs_lv&B5EcoD`%uL79WyYA$0>>qi6ov7 z%`ia~J^_l{p39EY zv>>b}Qs8vxsu&WcXEt8B#FD%L%ZpcVtY!rqVTHe;$p9rbb5O{^rFMB>auLn-^;s+-&P1#h~mf~YLg$8M9 zZ4#87;e-Y6x6QO<{McUzhy(%*6| z)`D~A(TJ$>+0H+mct(jfgL4x%^oC^T#u(bL)`E2tBI#V1kSikAWmOOYrO~#-cc_8! zCe|@1&mN2{*ceeiBldHCdrURk4>V}79_*TVP3aCyV*5n@jiNbOm+~EQ_}1#->_tI@ zqXv+jj2#8xJtW508rzFrYcJxoek@iW6SR@1%a%Bux&;>25%`j3UI`0DaUr7l79`B1 zqqUARhW1^h6=)6?;@v>xrZNM;t}{yY3P@|L}ey@gG( z9r{}WoYN(9TW&dE2dEJIXkyHA4&pU6ki=rx&l2{DLGbVmg4%3Dlfvn!GB>EVaY_%3+Df{fBiqJV>~Xf8A0aqUjgpa} zoF8YXO&^_x*Ej}nw-$-F@(ddB>%RWoPUj?p8U{t0=n>gAI83y<9Ce@Q#3&(soJ{64 z37@Vij1}5fmzAuIUnXX`EYe;!H-yTVTmhAy;y8VZeB#vD{vw9~P#DiFiKQ|kWwGFZ z=jK;JX*A;Jr{#x?n8XUOLS;C%f|zj-7vXtlf_DtP7bpurBeX%Hjwr z4lI-2TdFpzkjgiv!8Vfv`=SP+s=^i3+N~1ELNWUbH|ytVu>EyPN_3(4TM^QE1swRo zoV7Y_g)a>28+hZG0e7g%@2^s>pzR4^fzR-El}ARTmtu!zjZLuX%>#OoU3}|rFjJg} zQ2TmaygxJ#sbHVyiA5KE+yH0LREWr%^C*yR|@gM$nK2P zo}M}PV0v))uJh&33N>#aU376@ZH79u(Yw`EQ2hM3SJs9f99+cO6_pNW$j$L-CtAfe zYfM)ccwD!P%LiBk!eCD?fHCGvgMQ%Q2oT_gmf?OY=A>&PaZQOq4eT=lwbaf}33LCH zFD|)lu{K7$8n9gX#w4~URjZxWm@wlH%oL#G|I~Fb-v^0L0TWu+`B+ZG!yII)w05DU z>GO?n(TN+B=>HdxVDSlIH76pta$_LhbBg;eZ`M7OGcqt||qi zogS72W1IN%=)5JCyOHWoFP7pOFK0L*OAh=i%&VW&4^LF@R;+K)t^S!96?}^+5QBIs zjJNTCh)?)4k^H^g1&jc>gysM`y^8Rm3qsvkr$9AeWwYpa$b22=yAd1t<*{ zaowSEFP+{y?Ob}8&cwfqoy4Pb9IA~VnM3u!trIK$&&0Op#Ql4j>(EW?UNUv#*iH1$ z^j>+W{afcd`{e&`-A{g}{JnIzYib)!T56IT@YEs{4|`sMpW3c8@UCoIJv`XsAw!XC z34|Il$LpW}CIHFC5e*)}00I5{%OL*WZRGzC0?_}-9{#ue?-ug^ zLE|uv-~6xnSs_2_&CN9{9vyc!Xgtn36_g^wI0C4s0s^;8+p?|mm;Odt3`2ZjwtK;l zfd6j)*Fr#53>C6Y8(N5?$H0ma;BCF3HCjUs7rpb2Kf*x3Xcj#O8mvs#&33i+McX zQpBxD8!O{5Y8D&0*QjD=Yhl9%M0)&_vk}bmN_Ud^BPN;H=U^bn&(csl-pkA+GyY0Z zKV7sU_4n;}uR78ouo8O%g*V;79KY?3d>k6%gpcmQsKk&@Vkw9yna_3asGt`0Hmj59 z%0yiF*`jXhByBI9QsD=+>big5{)BGe&+U2gAARGe3ID)xrid~QN_{I>k}@tzL!Md_ z&=7>TWciblF@EMC3t4-WX{?!m!G6$M$1S?NzF*2KHMP3Go4=#ZHkeIv{eEd;s-yD# z_jU^Ba06TZqvV|Yd;Z_sN%$X=!T+&?#p+OQIHS%!LO`Hx0q_Y0MyGYFNoM{W;&@0@ zLM^!X4KhdtsET5G<0+|q0oqVXMW~-7LW9Bg}=E$YtNh1#1D^6Mz(V9?2g~I1( zoz9Cz=8Hw98zVLwC2AQvp@pBeKyidn6Xu0-1SY1((^Hu*-!HxFUPs)yJ+i`^BC>PC zjwd0mygOVK#d2pRC9LxqGc6;Ui>f{YW9Bvb>33bp^NcnZoH~w9(lM5@JiIlfa-6|k ziy31UoMN%fvQfhi8^T+=yrP{QEyb-jK~>$A4SZT-N56NYEbpvO&yUme&pWKs3^94D zH{oXnUTb3T@H+RgzML*lejx`WAyw*?K7B-I(VJx($2!NXYm%3`=F~TbLv3H<{>D?A zJo-FDYdSA-(Y%;4KUP2SpHKAIcv9-ld(UEJE7=TKp|Gryn;72?0LHqAN^fk6%8PCW z{g_-t)G5uCIf0I`*F0ZNl)Z>))MaLMpXgqWgj-y;R+@A+AzDjsTqw2Mo9ULKA3c70 z!7SOkMtZb+MStH>9MnvNV0G;pwSW9HgP+`tg}e{ij0H6Zt5zJ7iw`hEnvye!XbA@!~#%vIkzowCOvq5I5@$3wtc*w2R$7!$*?}vg4;eDyJ_1=ixJuEp3pUS27W?qq(P^8$_lU!mRChT}ctvZz4p!X^ zOSp|JOAi~f?UkwH#9k{0smZ7-#=lK6X3OFEMl7%)WIcHb=#ZN$L=aD`#DZKOG4p4r zwlQ~XDZ`R-RbF&hZZhu3(67kggsM-F4Y_tI^PH8PMJRcs7NS9ogF+?bZB*fcpJ z=LTM4W=N9yepVvTj&Hu~0?*vR1HgtEvf8w%Q;U0^`2@e8{SwgX5d(cQ|1(!|i$km! zvY03MK}j`sff;*-%mN~ST>xU$6Bu?*Hm%l@0dk;j@%>}jsgDcQ)Hn*UfuThz9(ww_ zasV`rSrp_^bp-0sx>i35FzJwA!d6cZ5#5#nr@GcPEjNnFHIrtUYm1^Z$;{d&{hQV9 z6EfFHaIS}46p^5I-D_EcwwzUUuO}mqRh&T7r9sfw`)G^Q%oHxEs~+XoM?8e*{-&!7 z7$m$lg9t9KP9282eke608^Q2E%H-xm|oJ8=*SyEo} z@&;TQ3K)jgspgKHyGiKVMCz>xmC=H5Fy3!=TP)-R3|&1S-B)!6q50wfLHKM@7Bq6E z44CY%G;GY>tC`~yh!qv~YdXw! zSkquvYNs6k1r7>Eza?Vkkxo6XRS$W7EzL&A`o>=$HXgBp{L(i^$}t`NcnAxzbH8Ht z2!;`bhKIh`f1hIFcI5bHI=ueKdzmB9)!z$s-BT4ItyY|NaA_+o=jO%MU5as9 zc2)aLP>N%u>wlaXTK!p)r?+~)L+0eCGb5{8WIk7K52$nufnQ+m8YF+GQc&{^(zh-$ z#wyWV*Zh@d!b(WwXqvfhQX)^aoHTBkc;4ossV3&Ut*k>AI|m+{#kh4B!`3*<)EJVj zwrxK>99v^k4&Y&`Awm>|exo}NvewV%E+@vOc>5>%H#BK9uaE2$vje zWYM5fKuOTtn96B_2~~!xJPIcXF>E_;yO8AwpJ4)V`Hht#wbO3Ung~@c%%=FX4)q+9 z99#>VC2!4l`~0WHs9FI$Nz+abUq# zz`Of97})Su=^rGp2S$)7N3rQCj#0%2YO<R&p>$<#lgXcUj=4H_{oAYiT3 z44*xDn-$wEzRw7#@6aD)EGO$0{!C5Z^7#yl1o;k0PhN=aVUQu~eTQ^Xy{z8Ow6tk83 z4{5xe%(hx)%nD&|e*6sTWH`4W&U!Jae#U4TnICheJmsw{l|CH?UA{a6?2GNgpZLyzU2UlFu1ZVwlALmh_DOs03J^Cjh1im`E3?9&zvNmg(MuMw&0^Lu$(#CJ*q6DjlKsY-RMJ^8yIY|{SQZ*9~CH|u9L z`R78^r=EbbR*_>5?-)I+$6i}G)%mN(`!X72KaV(MNUP7Nv3MS9S|Pe!%N2AeOt5zG zVJ;jI4HZ$W->Ai_4X+`9c(~m=@ek*m`ZQbv3ryI-AD#AH=`x$~WeW~M{Js57(K7(v ze5`};LG|%C_tmd>bkufMWmAo&B+DT9ZV~h(4jg0>^aeAqL`PEUzJJtI8W1M!bQWpv zvN(d}E1@nlYa!L!!A*RN!(Q3F%J?5PvQ0udu?q-T)j3JKV~NL>KRb~w-lWc685uS6 z=S#aR&B8Sc8>cGJ!!--?kwsJTUUm`Jk?7`H z7PrO~xgBrSW2_tTlCq1LH8*!o?pj?qxy8}(=r_;G18POrFh#;buWR0qU24+XUaVZ0 z?(sXcr@-YqvkCmHr{U2oPogHL{r#3r49TeR<{SJX1pcUqyWPrkYz^X8#QW~?F)R5i z>p^!i<;qM8Nf{-fd6!_&V*e_9qP6q(s<--&1Ttj01j0w>bXY7y1W*%Auu&p|XSOH=)V7Bd4fUKh&T1)@cvqhuD-d=?w}O zjI%i(f|thk0Go*!d7D%0^ztBfE*V=(ZIN84f5HU}T9?ulmEYzT5usi=DeuI*d|;M~ zp_=Cx^!4k#=m_qSPBr5EK~E?3J{dWWPH&oCcNepYVqL?nh4D5ynfWip$m*YlZ8r^Z zuFEUL-nW!3qjRCLIWPT0x)FDL7>Yt7@8dA?R2kF@WE>ysMY+)lTsgNM#3VbXVGL}F z1O(>q>2a+_`6r5Xv$NZAnp=Kgnr3)cL(^=8ypEeOf3q8(HGe@7Tt59;yFl||w|mnO zHDxg2G3z8=(6wjj9kbcEY@Z0iOd7Gq5GiPS5% z*sF1J<#daxDV2Z8H>wxOF<;yKzMeTaSOp_|XkS9Sfn6Mpe9UBi1cSTieGG5$O;ZLIIJ60Y>SN4vC?=yE_CWlo(EEE$e4j?z&^FM%kNmRtlbEL^dPPgvs9sbK5fGw*r@ z+!EU@u$T8!nZh?Fdf_qk$VuHk^yVw`h`_#KoS*N%epIIOfQUy_&V}VWDGp3tplMbf z5Se1sJUC$7N0F1-9jdV2mmGK{-}fu|Nv;12jDy0<-kf^AmkDnu6j~TPWOgy1MT68|D z=4=50jVbUKdKaQgD`eWGr3I&^<6uhkjz$YwItY8%Yp9{z4-{6g{73<_b*@XJ4Nm3-3z z?BW3{aY_ccRjb@W1)i5nLg|7BnWS!B`_Uo9CWaE`Ij327QH?i)9A}4Ug4wmxVVa^b z-4+m%-wwOl7cKH7+=x&nrCrbEC)Q$fpg&V83#uEH;C=GNMz`ps@^RxK%T*8%OPnC` z{WO~J%nxYJ`x|N%?&i7?;{_8t^jM&=50HlaOQj8fS}_`moH$c;vI<|cruPFnpT8yU zS%rPOCUSd5Zdb(zwk`hqwTQn)*&n)uYsP*F_(~xEWq}C= zv30kFmZFwJZ@ELVX3?$dXQh|icO7UrL*_5G=I^xXjImz`ZPp>?g#tf(ej~KaIU0algsG!IS09;>?MvqGg#c{i+}qY|{P8W~O%#>|gFd z<1dr$-oxyRGN17yZo1OwLnzwYs0|;IS_nymNB0IlSzPQ%-r`?T=;_XQ^~&#}b|AB} zkNbN5uB?-sUB-T5QLlg%Uk3)uHB;>VIzGe9_J9 zaeISkQm!v(9d(0ML^b9fR^sfHFlH?7Mvddt37OuR{|O0{uv)(&-6<87W4 zyO>s!=cPgP3O&7xxU5DlIPw_o3O>6o6Qb?JWs3qw#p3sBc3g$?Dx zi(6D+DYgV;GrUis-CL%Qe{nvZnwaVXmbhH(|GFh|Q)k=1uvA$I@1DXI7bKlQ@8D6P zS?(*?><>)G49q0wr;NajpxP4W2G)kHl6^=Z>hrNEI4Mwd_$O6$1dXF;Q#hE(-eeW6 zz03GJF%Wl?HO=_ztv5*zRlcU~{+{k%#N59mgm~eK>P!QZ6E?#Cu^2)+K8m@ySvZ*5 z|HDT}BkF@3!l(0%75G=1u2hETXEj!^1Z$!)!lyGXlWD!_vqGE$Z)#cUVBqlORW>0^ zDjyVTxwKHKG|0}j-`;!R-p>}qQfBl(?($7pP<+Y8QE#M8SCDq~k<+>Q^Zf@cT_WdX3~BSe z+|KK|7OL5Hm5(NFP~j>Ct3*$wi0n0!xl=(C61`q&cec@mFlH(sy%+RH<=s)8aAPN`SfJdkAQjdv82G5iRdv8 zh{9wHUZaniSEpslXl^_ODh}mypC?b*9FzLjb~H@3DFSe;D(A-K3t3eOTB(m~I6C;(-lKAvit(70k`%@+O*Ztdz;}|_TS~B?Tpmi=QKC^m_ z2YpEaT3iiz*;T~ap1yiA)a`dKMwu`^UhIUeltNQ1Yjo=q@bI@&3zH?rVUg=IxLy-ni zyxDu%-Fr{H6owTjZU2O5>nDb=q&Jz_TjeSq%!2m40x&U6w~GQ({quPL73IsJS;f`$ zsuhioqCBj(gJ>2hoo)Gou7(WP*pX)f=Y=!=k!&1K?EYY%jJ~X&DnK{^saPQK<1BJ z_A`_{%ZozcB(3w$z^To^6d|XuT@=X~wtW!+{4ID@N{AB~J6AL5vuY>JwvWCNFKsKh zd}@>q@_WV#QZ&UJ0#?X(pXR!oyXOEG3rqzHbCzGLONDb042i$})fM@XF)uSP(DHUc z^&{|$*xe{cs?Gp8=B%RY3L7#$ve$?TWh>MZdxF1zH1v}1z+$Ov#G7?%D)bBCyDe*% zSeKSpETC2V1){II>@UwJi>4uBN+iAx+82E~gb|Cr&8E^i&)A!uv-g?jzH99wU}8+# z$nh>yvb;TwZmS@7LrvuCu_d0-WxFNI&C7%sWuTL%YU!l|I1{|->=dlOeHOCtUO#zkS3ESO8LHV4hTdQL5EdV zuWD33fFPH}HPrW^s$Qn1Xgp&AT6<-He{{4%eIu3rN=iK|9mURdKXfB&Q?qGok%!cs ze53UP{Z!TO-Y@q2;;k2avA3`lm4OoN4@S*k=UA)7H;qZ`d8`XaYFCv?Ba+uGW@r5v z&&{nf(24WSBOhc7!qF^@0cz;XcUynNaj6w2349;s!K{KVqs5yS{ z7VubS`2OzT^5#1~6Tt^RTvt9-J|D2F>y~>2;jeF>g`hx5l%B3H=aLExQihuYngzlnBTYOTHJQMzl>kwqN5JYs)Ej zblA@ntkUS~xi+}y6|(81helS}Q~&VB37qyV|S3Y=><^1wh%msQM?fz z<58MX(=|PSUKCF#)dbhR%D&xgCD?$aR0qen+wpp6 zst}vX18!Be96TD??j1HsHTUx(a&@F?=gT`Q$oJFFyrh^;zgz!(NlAHGn0cJy@us=w zNhC#l5G;H}+>49Nsh12=ZPO2r*2OBQe5kpb&1?*PIBFitK8}FUfb~S-#hKfF0o#&d z#3aPkB$9scYku&kA6{0xHnBV#&Wei5J>5T-XX-gUXEPo+9b7WL=*XESc(3BshL`aj zXp}QIp*40}oWJt*l043e8_5;H5PI5c)U&IEw5dF(4zjX0y_lk9 zAp@!mK>WUqHo)-jop=DoK>&no>kAD=^qIE7qis&_*4~ z6q^EF$D@R~3_xseCG>Ikb6Gfofb$g|75PPyyZN&tiRxqovo_k zO|HA|sgy#B<32gyU9x^&)H$1jvw@qp+1b(eGAb)O%O!&pyX@^nQd^9BQ4{(F8<}|A zhF&)xusQhtoXOOhic=8#Xtt5&slLia3c*a?dIeczyTbC#>FTfiLST57nc3@Y#v_Eg#VUv zT8cKH#f3=1PNj!Oroz_MAR*pow%Y0*6YCYmUy^7`^r|j23Q~^*TW#cU7CHf0eAD_0 zEWEVddxFgQ7=!nEBQ|ibaScslvhuUk^*%b#QUNrEB{3PG@uTxNwW}Bs4$nS9wc(~O zG7Iq>aMsYkcr!9#A;HNsJrwTDYkK8ikdj{M;N$sN6BqJ<8~z>T20{J8Z2rRUuH7~3 z=tgS`AgxbBOMg87UT4Lwge`*Y=01Dvk>)^{Iu+n6fuVX4%}>?3czOGR$0 zpp*wp>bsFFSV`V;r_m+TZns$ZprIi`OUMhe^cLE$2O+pP3nP!YB$ry}2THx2QJs3< za1;>d-AggCarrQ>&Z!d@;mW+!q6eXhb&`GbzUDSxpl8AJ#Cm#tuc)_xh(2NV=5XMs zrf_ozRYO$NkC=pKFX5OH8v1>0i9Z$ec`~Mf+_jQ68spn(CJwclDhEEkH2Qw;${J$clv__nUjn5jA0wCLEnu1j;v!0vB>Ri6m9`;R{JMS%^)4FC zU0Z44+u$I$w=Bj|iu4DT5h~sS`C*zbmX?@-crY}E+hy>}2~C0Nn(EKk@5^qO4@l@! z6O0lr%tzGC`D^)8xU3FnMZVm0kX1sBWhaQyzVoXFWwr%Ny?=2M{5s#5i7fTu3gEkG zc{(Pr$v=;`Y#&`y*J}#M9ux>0?xu!`$9cUKm#Bdd_&S#LPTS?ZPV6zN6>W6JTS~-LfjL{mB=b(KMk3 z2HjBSlJeyUVqDd=Mt!=hpYsvby2GL&3~zm;0{^nZJq+4vb?5HH4wufvr}IX42sHeK zm@x?HN$8TsTavXs)tLDFJtY9b)y~Tl@7z4^I8oUQq4JckH@~CVQ;FoK(+e0XAM>1O z(ei}h?)JQp>)d=6ng-BZF1Z5hsAKW@mXq+hU?r8I(*%`tnIIOXw7V6ZK(T9RFJJe@ zZS!aC+p)Gf2Ujc=a6hx4!A1Th%YH!Lb^xpI!Eu` zmJO{9rw){B1Ql18d%F%da+Tbu1()?o(zT7StYqK6_w`e+fjXq5L^y(0 z09QA6H4oFj59c2wR~{~>jUoDzDdKz}5#onYPJRwa`SUO)Pd4)?(ENBaFVLJr6Kvz= zhTtXqbx09C1z~~iZt;g^9_2nCZ{};-b4dQJbv8HsWHXPVg^@(*!@xycp#R?a|L!+` zY5w))JWV`Gls(=}shH0#r*;~>_+-P5Qc978+QUd>J%`fyn{*TsiG-dWMiJXNgwBaT zJ=wgYFt+1ACW)XwtNx)Q9tA2LPoB&DkL16P)ERWQlY4%Y`-5aM9mZ{eKPUgI!~J3Z zkMd5A_p&v?V-o-6TUa8BndiX?ooviev(DKw=*bBVOW|=zps9=Yl|-R5@yJe*BPzN}a0mUsLn{4LfjB_oxpv(mwq# zSY*%E{iB)sNvWfzg-B!R!|+x(Q|b@>{-~cFvdDHA{F2sFGA5QGiIWy#3?P2JIpPKg6ncI^)dvqe`_|N=8 '} + case $link in #( + /*) app_path=$link ;; #( + *) app_path=$APP_HOME$link ;; + esac +done + +# This is normally unused +# shellcheck disable=SC2034 +APP_BASE_NAME=${0##*/} +# Discard cd standard output in case $CDPATH is set (https://github.com/gradle/gradle/issues/25036) +APP_HOME=$( cd -P "${APP_HOME:-./}" > /dev/null && printf '%s\n' "$PWD" ) || exit + +# Use the maximum available, or set MAX_FD != -1 to use that value. +MAX_FD=maximum + +warn () { + echo "$*" +} >&2 + +die () { + echo + echo "$*" + echo + exit 1 +} >&2 + +# OS specific support (must be 'true' or 'false'). +cygwin=false +msys=false +darwin=false +nonstop=false +case "$( uname )" in #( + CYGWIN* ) cygwin=true ;; #( + Darwin* ) darwin=true ;; #( + MSYS* | MINGW* ) msys=true ;; #( + NONSTOP* ) nonstop=true ;; +esac + +CLASSPATH="\\\"\\\"" + + +# Determine the Java command to use to start the JVM. +if [ -n "$JAVA_HOME" ] ; then + if [ -x "$JAVA_HOME/jre/sh/java" ] ; then + # IBM's JDK on AIX uses strange locations for the executables + JAVACMD=$JAVA_HOME/jre/sh/java + else + JAVACMD=$JAVA_HOME/bin/java + fi + if [ ! -x "$JAVACMD" ] ; then + die "ERROR: JAVA_HOME is set to an invalid directory: $JAVA_HOME + +Please set the JAVA_HOME variable in your environment to match the +location of your Java installation." + fi +else + JAVACMD=java + if ! command -v java >/dev/null 2>&1 + then + die "ERROR: JAVA_HOME is not set and no 'java' command could be found in your PATH. + +Please set the JAVA_HOME variable in your environment to match the +location of your Java installation." + fi +fi + +# Increase the maximum file descriptors if we can. +if ! "$cygwin" && ! "$darwin" && ! "$nonstop" ; then + case $MAX_FD in #( + max*) + # In POSIX sh, ulimit -H is undefined. That's why the result is checked to see if it worked. + # shellcheck disable=SC2039,SC3045 + MAX_FD=$( ulimit -H -n ) || + warn "Could not query maximum file descriptor limit" + esac + case $MAX_FD in #( + '' | soft) :;; #( + *) + # In POSIX sh, ulimit -n is undefined. That's why the result is checked to see if it worked. + # shellcheck disable=SC2039,SC3045 + ulimit -n "$MAX_FD" || + warn "Could not set maximum file descriptor limit to $MAX_FD" + esac +fi + +# Collect all arguments for the java command, stacking in reverse order: +# * args from the command line +# * the main class name +# * -classpath +# * -D...appname settings +# * --module-path (only if needed) +# * DEFAULT_JVM_OPTS, JAVA_OPTS, and GRADLE_OPTS environment variables. + +# For Cygwin or MSYS, switch paths to Windows format before running java +if "$cygwin" || "$msys" ; then + APP_HOME=$( cygpath --path --mixed "$APP_HOME" ) + CLASSPATH=$( cygpath --path --mixed "$CLASSPATH" ) + + JAVACMD=$( cygpath --unix "$JAVACMD" ) + + # Now convert the arguments - kludge to limit ourselves to /bin/sh + for arg do + if + case $arg in #( + -*) false ;; # don't mess with options #( + /?*) t=${arg#/} t=/${t%%/*} # looks like a POSIX filepath + [ -e "$t" ] ;; #( + *) false ;; + esac + then + arg=$( cygpath --path --ignore --mixed "$arg" ) + fi + # Roll the args list around exactly as many times as the number of + # args, so each arg winds up back in the position where it started, but + # possibly modified. + # + # NB: a `for` loop captures its iteration list before it begins, so + # changing the positional parameters here affects neither the number of + # iterations, nor the values presented in `arg`. + shift # remove old arg + set -- "$@" "$arg" # push replacement arg + done +fi + + +# Add default JVM options here. You can also use JAVA_OPTS and GRADLE_OPTS to pass JVM options to this script. +DEFAULT_JVM_OPTS='"-Xmx64m" "-Xms64m"' + +# Collect all arguments for the java command: +# * DEFAULT_JVM_OPTS, JAVA_OPTS, and optsEnvironmentVar are not allowed to contain shell fragments, +# and any embedded shellness will be escaped. +# * For example: A user cannot expect ${Hostname} to be expanded, as it is an environment variable and will be +# treated as '${Hostname}' itself on the command line. + +set -- \ + "-Dorg.gradle.appname=$APP_BASE_NAME" \ + -classpath "$CLASSPATH" \ + -jar "$APP_HOME/gradle/wrapper/gradle-wrapper.jar" \ + "$@" + +# Stop when "xargs" is not available. +if ! command -v xargs >/dev/null 2>&1 +then + die "xargs is not available" +fi + +# Use "xargs" to parse quoted args. +# +# With -n1 it outputs one arg per line, with the quotes and backslashes removed. +# +# In Bash we could simply go: +# +# readarray ARGS < <( xargs -n1 <<<"$var" ) && +# set -- "${ARGS[@]}" "$@" +# +# but POSIX shell has neither arrays nor command substitution, so instead we +# post-process each arg (as a line of input to sed) to backslash-escape any +# character that might be a shell metacharacter, then use eval to reverse +# that process (while maintaining the separation between arguments), and wrap +# the whole thing up as a single "set" statement. +# +# This will of course break if any of these variables contains a newline or +# an unmatched quote. +# + +eval "set -- $( + printf '%s\n' "$DEFAULT_JVM_OPTS $JAVA_OPTS $GRADLE_OPTS" | + xargs -n1 | + sed ' s~[^-[:alnum:]+,./:=@_]~\\&~g; ' | + tr '\n' ' ' + )" '"$@"' + +exec "$JAVACMD" "$@" diff --git a/gradlew.bat b/gradlew.bat new file mode 100644 index 0000000..5eed7ee --- /dev/null +++ b/gradlew.bat @@ -0,0 +1,94 @@ +@rem +@rem Copyright 2015 the original author or authors. +@rem +@rem Licensed under the Apache License, Version 2.0 (the "License"); +@rem you may not use this file except in compliance with the License. +@rem You may obtain a copy of the License at +@rem +@rem https://www.apache.org/licenses/LICENSE-2.0 +@rem +@rem Unless required by applicable law or agreed to in writing, software +@rem distributed under the License is distributed on an "AS IS" BASIS, +@rem WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. +@rem See the License for the specific language governing permissions and +@rem limitations under the License. +@rem +@rem SPDX-License-Identifier: Apache-2.0 +@rem + +@if "%DEBUG%"=="" @echo off +@rem ########################################################################## +@rem +@rem Gradle startup script for Windows +@rem +@rem ########################################################################## + +@rem Set local scope for the variables with windows NT shell +if "%OS%"=="Windows_NT" setlocal + +set DIRNAME=%~dp0 +if "%DIRNAME%"=="" set DIRNAME=. +@rem This is normally unused +set APP_BASE_NAME=%~n0 +set APP_HOME=%DIRNAME% + +@rem Resolve any "." and ".." in APP_HOME to make it shorter. +for %%i in ("%APP_HOME%") do set APP_HOME=%%~fi + +@rem Add default JVM options here. You can also use JAVA_OPTS and GRADLE_OPTS to pass JVM options to this script. +set DEFAULT_JVM_OPTS="-Xmx64m" "-Xms64m" + +@rem Find java.exe +if defined JAVA_HOME goto findJavaFromJavaHome + +set JAVA_EXE=java.exe +%JAVA_EXE% -version >NUL 2>&1 +if %ERRORLEVEL% equ 0 goto execute + +echo. 1>&2 +echo ERROR: JAVA_HOME is not set and no 'java' command could be found in your PATH. 1>&2 +echo. 1>&2 +echo Please set the JAVA_HOME variable in your environment to match the 1>&2 +echo location of your Java installation. 1>&2 + +goto fail + +:findJavaFromJavaHome +set JAVA_HOME=%JAVA_HOME:"=% +set JAVA_EXE=%JAVA_HOME%/bin/java.exe + +if exist "%JAVA_EXE%" goto execute + +echo. 1>&2 +echo ERROR: JAVA_HOME is set to an invalid directory: %JAVA_HOME% 1>&2 +echo. 1>&2 +echo Please set the JAVA_HOME variable in your environment to match the 1>&2 +echo location of your Java installation. 1>&2 + +goto fail + +:execute +@rem Setup the command line + +set CLASSPATH= + + +@rem Execute Gradle +"%JAVA_EXE%" %DEFAULT_JVM_OPTS% %JAVA_OPTS% %GRADLE_OPTS% "-Dorg.gradle.appname=%APP_BASE_NAME%" -classpath "%CLASSPATH%" -jar "%APP_HOME%\gradle\wrapper\gradle-wrapper.jar" %* + +:end +@rem End local scope for the variables with windows NT shell +if %ERRORLEVEL% equ 0 goto mainEnd + +:fail +rem Set variable GRADLE_EXIT_CONSOLE if you need the _script_ return code instead of +rem the _cmd.exe /c_ return code! +set EXIT_CODE=%ERRORLEVEL% +if %EXIT_CODE% equ 0 set EXIT_CODE=1 +if not ""=="%GRADLE_EXIT_CONSOLE%" exit %EXIT_CODE% +exit /b %EXIT_CODE% + +:mainEnd +if "%OS%"=="Windows_NT" endlocal + +:omega diff --git a/run.sh b/run.sh new file mode 100755 index 0000000..0374615 --- /dev/null +++ b/run.sh @@ -0,0 +1,3 @@ +#!/usr/bin/env sh +BIN_DIR="$(dirname "$0")/build/install/compiler/bin" +$BIN_DIR/compiler "$@" diff --git a/settings.gradle.kts b/settings.gradle.kts new file mode 100644 index 0000000..040499b --- /dev/null +++ b/settings.gradle.kts @@ -0,0 +1,5 @@ +rootProject.name = "compiler" // in case you want to change the name: it is used by run.sh too + +plugins { + id("org.gradle.toolchains.foojay-resolver-convention") version "0.10.0" +} \ No newline at end of file diff --git a/src/main/java/edu/kit/kastel/vads/compiler/Main.java b/src/main/java/edu/kit/kastel/vads/compiler/Main.java new file mode 100644 index 0000000..ac9f909 --- /dev/null +++ b/src/main/java/edu/kit/kastel/vads/compiler/Main.java @@ -0,0 +1,61 @@ +package edu.kit.kastel.vads.compiler; + +import edu.kit.kastel.vads.compiler.backend.aasm.CodeGenerator; +import edu.kit.kastel.vads.compiler.ir.IrGraph; +import edu.kit.kastel.vads.compiler.ir.SsaTranslation; +import edu.kit.kastel.vads.compiler.ir.optimize.LocalValueNumbering; +import edu.kit.kastel.vads.compiler.lexer.Lexer; +import edu.kit.kastel.vads.compiler.parser.ParseException; +import edu.kit.kastel.vads.compiler.parser.Parser; +import edu.kit.kastel.vads.compiler.parser.TokenSource; +import edu.kit.kastel.vads.compiler.parser.ast.FunctionTree; +import edu.kit.kastel.vads.compiler.parser.ast.ProgramTree; +import edu.kit.kastel.vads.compiler.semantic.SemanticAnalysis; +import edu.kit.kastel.vads.compiler.semantic.SemanticException; + +import java.io.IOException; +import java.nio.file.Files; +import java.nio.file.Path; +import java.util.ArrayList; +import java.util.List; + +public class Main { + public static void main(String[] args) throws IOException { + if (args.length != 2) { + System.err.println("Invalid arguments: Expected one input file and one output file"); + System.exit(3); + } + Path input = Path.of(args[0]); + Path output = Path.of(args[1]); + ProgramTree program = lexAndParse(input); + try { + new SemanticAnalysis(program).analyze(); + } catch (SemanticException e) { + e.printStackTrace(); + System.exit(2); + return; + } + List graphs = new ArrayList<>(); + for (FunctionTree function : program.topLevelTrees()) { + SsaTranslation translation = new SsaTranslation(function, new LocalValueNumbering()); + graphs.add(translation.translate()); + } + + // TODO: generate assembly and invoke gcc instead of generating abstract assembly + String s = new CodeGenerator().generateCode(graphs); + Files.writeString(output, s); + } + + private static ProgramTree lexAndParse(Path input) throws IOException { + try { + Lexer lexer = Lexer.forString(Files.readString(input)); + TokenSource tokenSource = new TokenSource(lexer); + Parser parser = new Parser(tokenSource); + return parser.parseProgram(); + } catch (ParseException e) { + e.printStackTrace(); + System.exit(1); + throw new AssertionError("unreachable"); + } + } +} \ No newline at end of file diff --git a/src/main/java/edu/kit/kastel/vads/compiler/Position.java b/src/main/java/edu/kit/kastel/vads/compiler/Position.java new file mode 100644 index 0000000..a9fffcc --- /dev/null +++ b/src/main/java/edu/kit/kastel/vads/compiler/Position.java @@ -0,0 +1,13 @@ +package edu.kit.kastel.vads.compiler; + +public sealed interface Position { + int line(); + int column(); + + record SimplePosition(int line, int column) implements Position { + @Override + public String toString() { + return line() + ":" + column(); + } + } +} diff --git a/src/main/java/edu/kit/kastel/vads/compiler/Span.java b/src/main/java/edu/kit/kastel/vads/compiler/Span.java new file mode 100644 index 0000000..fb877ca --- /dev/null +++ b/src/main/java/edu/kit/kastel/vads/compiler/Span.java @@ -0,0 +1,20 @@ +package edu.kit.kastel.vads.compiler; + +public sealed interface Span { + Position start(); + Position end(); + + Span merge(Span later); + + record SimpleSpan(Position start, Position end) implements Span { + @Override + public Span merge(Span later) { + return new SimpleSpan(start(), later.end()); + } + + @Override + public String toString() { + return "[" + start() + "|" + end() + "]"; + } + } +} diff --git a/src/main/java/edu/kit/kastel/vads/compiler/backend/aasm/AasmRegisterAllocator.java b/src/main/java/edu/kit/kastel/vads/compiler/backend/aasm/AasmRegisterAllocator.java new file mode 100644 index 0000000..759f644 --- /dev/null +++ b/src/main/java/edu/kit/kastel/vads/compiler/backend/aasm/AasmRegisterAllocator.java @@ -0,0 +1,43 @@ +package edu.kit.kastel.vads.compiler.backend.aasm; + +import edu.kit.kastel.vads.compiler.backend.regalloc.Register; +import edu.kit.kastel.vads.compiler.backend.regalloc.RegisterAllocator; +import edu.kit.kastel.vads.compiler.ir.IrGraph; +import edu.kit.kastel.vads.compiler.ir.node.Block; +import edu.kit.kastel.vads.compiler.ir.node.Node; +import edu.kit.kastel.vads.compiler.ir.node.ProjNode; +import edu.kit.kastel.vads.compiler.ir.node.ReturnNode; +import edu.kit.kastel.vads.compiler.ir.node.StartNode; + +import java.util.HashMap; +import java.util.HashSet; +import java.util.Map; +import java.util.Set; + +public class AasmRegisterAllocator implements RegisterAllocator { + private int id; + private final Map registers = new HashMap<>(); + + @Override + public Map allocateRegisters(IrGraph graph) { + Set visited = new HashSet<>(); + visited.add(graph.endBlock()); + scan(graph.endBlock(), visited); + return Map.copyOf(this.registers); + } + + private void scan(Node node, Set visited) { + for (Node predecessor : node.predecessors()) { + if (visited.add(predecessor)) { + scan(predecessor, visited); + } + } + if (needsRegister(node)) { + this.registers.put(node, new VirtualRegister(this.id++)); + } + } + + private static boolean needsRegister(Node node) { + return !(node instanceof ProjNode || node instanceof StartNode || node instanceof Block || node instanceof ReturnNode); + } +} diff --git a/src/main/java/edu/kit/kastel/vads/compiler/backend/aasm/CodeGenerator.java b/src/main/java/edu/kit/kastel/vads/compiler/backend/aasm/CodeGenerator.java new file mode 100644 index 0000000..7a9b177 --- /dev/null +++ b/src/main/java/edu/kit/kastel/vads/compiler/backend/aasm/CodeGenerator.java @@ -0,0 +1,89 @@ +package edu.kit.kastel.vads.compiler.backend.aasm; + +import edu.kit.kastel.vads.compiler.backend.regalloc.Register; +import edu.kit.kastel.vads.compiler.ir.IrGraph; +import edu.kit.kastel.vads.compiler.ir.node.AddNode; +import edu.kit.kastel.vads.compiler.ir.node.BinaryOperationNode; +import edu.kit.kastel.vads.compiler.ir.node.Block; +import edu.kit.kastel.vads.compiler.ir.node.ConstIntNode; +import edu.kit.kastel.vads.compiler.ir.node.DivNode; +import edu.kit.kastel.vads.compiler.ir.node.ModNode; +import edu.kit.kastel.vads.compiler.ir.node.MulNode; +import edu.kit.kastel.vads.compiler.ir.node.Node; +import edu.kit.kastel.vads.compiler.ir.node.Phi; +import edu.kit.kastel.vads.compiler.ir.node.ProjNode; +import edu.kit.kastel.vads.compiler.ir.node.ReturnNode; +import edu.kit.kastel.vads.compiler.ir.node.StartNode; +import edu.kit.kastel.vads.compiler.ir.node.SubNode; + +import java.util.HashSet; +import java.util.List; +import java.util.Map; +import java.util.Set; + +import static edu.kit.kastel.vads.compiler.ir.util.NodeSupport.predecessorSkipProj; + +public class CodeGenerator { + + public String generateCode(List program) { + StringBuilder builder = new StringBuilder(); + for (IrGraph graph : program) { + AasmRegisterAllocator allocator = new AasmRegisterAllocator(); + Map registers = allocator.allocateRegisters(graph); + builder.append("function ") + .append(graph.name()) + .append(" {\n"); + generateForGraph(graph, builder, registers); + builder.append("}"); + } + return builder.toString(); + } + + private void generateForGraph(IrGraph graph, StringBuilder builder, Map registers) { + Set visited = new HashSet<>(); + scan(graph.endBlock(), visited, builder, registers); + } + + private void scan(Node node, Set visited, StringBuilder builder, Map registers) { + for (Node predecessor : node.predecessors()) { + if (visited.add(predecessor)) { + scan(predecessor, visited, builder, registers); + } + } + + switch (node) { + case AddNode add -> binary(builder, registers, add, "add"); + case SubNode sub -> binary(builder, registers, sub, "sub"); + case MulNode mul -> binary(builder, registers, mul, "mul"); + case DivNode div -> binary(builder, registers, div, "div"); + case ModNode mod -> binary(builder, registers, mod, "mod"); + case ReturnNode r -> builder.repeat(" ", 2).append("ret ") + .append(registers.get(predecessorSkipProj(r, ReturnNode.RESULT))); + case ConstIntNode c -> builder.repeat(" ", 2) + .append(registers.get(c)) + .append(" = const ") + .append(c.value()); + case Phi _ -> throw new UnsupportedOperationException("phi"); + case Block _, ProjNode _, StartNode _ -> { + // do nothing, skip line break + return; + } + } + builder.append("\n"); + } + + private static void binary( + StringBuilder builder, + Map registers, + BinaryOperationNode node, + String opcode + ) { + builder.repeat(" ", 2).append(registers.get(node)) + .append(" = ") + .append(opcode) + .append(" ") + .append(registers.get(predecessorSkipProj(node, BinaryOperationNode.LEFT))) + .append(" ") + .append(registers.get(predecessorSkipProj(node, BinaryOperationNode.RIGHT))); + } +} diff --git a/src/main/java/edu/kit/kastel/vads/compiler/backend/aasm/VirtualRegister.java b/src/main/java/edu/kit/kastel/vads/compiler/backend/aasm/VirtualRegister.java new file mode 100644 index 0000000..0121a6d --- /dev/null +++ b/src/main/java/edu/kit/kastel/vads/compiler/backend/aasm/VirtualRegister.java @@ -0,0 +1,10 @@ +package edu.kit.kastel.vads.compiler.backend.aasm; + +import edu.kit.kastel.vads.compiler.backend.regalloc.Register; + +public record VirtualRegister(int id) implements Register { + @Override + public String toString() { + return "%" + id(); + } +} diff --git a/src/main/java/edu/kit/kastel/vads/compiler/backend/regalloc/Register.java b/src/main/java/edu/kit/kastel/vads/compiler/backend/regalloc/Register.java new file mode 100644 index 0000000..426fc5e --- /dev/null +++ b/src/main/java/edu/kit/kastel/vads/compiler/backend/regalloc/Register.java @@ -0,0 +1,4 @@ +package edu.kit.kastel.vads.compiler.backend.regalloc; + +public interface Register { +} diff --git a/src/main/java/edu/kit/kastel/vads/compiler/backend/regalloc/RegisterAllocator.java b/src/main/java/edu/kit/kastel/vads/compiler/backend/regalloc/RegisterAllocator.java new file mode 100644 index 0000000..210d6b6 --- /dev/null +++ b/src/main/java/edu/kit/kastel/vads/compiler/backend/regalloc/RegisterAllocator.java @@ -0,0 +1,11 @@ +package edu.kit.kastel.vads.compiler.backend.regalloc; + +import edu.kit.kastel.vads.compiler.ir.IrGraph; +import edu.kit.kastel.vads.compiler.ir.node.Node; + +import java.util.Map; + +public interface RegisterAllocator { + + Map allocateRegisters(IrGraph graph); +} diff --git a/src/main/java/edu/kit/kastel/vads/compiler/ir/GraphConstructor.java b/src/main/java/edu/kit/kastel/vads/compiler/ir/GraphConstructor.java new file mode 100644 index 0000000..66f8e10 --- /dev/null +++ b/src/main/java/edu/kit/kastel/vads/compiler/ir/GraphConstructor.java @@ -0,0 +1,192 @@ +package edu.kit.kastel.vads.compiler.ir; + +import edu.kit.kastel.vads.compiler.ir.node.AddNode; +import edu.kit.kastel.vads.compiler.ir.node.Block; +import edu.kit.kastel.vads.compiler.ir.node.ConstIntNode; +import edu.kit.kastel.vads.compiler.ir.node.DivNode; +import edu.kit.kastel.vads.compiler.ir.node.ModNode; +import edu.kit.kastel.vads.compiler.ir.node.MulNode; +import edu.kit.kastel.vads.compiler.ir.node.Node; +import edu.kit.kastel.vads.compiler.ir.node.Phi; +import edu.kit.kastel.vads.compiler.ir.node.ProjNode; +import edu.kit.kastel.vads.compiler.ir.node.ReturnNode; +import edu.kit.kastel.vads.compiler.ir.node.StartNode; +import edu.kit.kastel.vads.compiler.ir.node.SubNode; +import edu.kit.kastel.vads.compiler.ir.optimize.Optimizer; +import edu.kit.kastel.vads.compiler.parser.symbol.Name; + +import java.util.HashMap; +import java.util.HashSet; +import java.util.Map; +import java.util.Set; + +class GraphConstructor { + + private final Optimizer optimizer; + private final IrGraph graph; + private final Map> currentDef = new HashMap<>(); + private final Map> incompletePhis = new HashMap<>(); + private final Map currentSideEffect = new HashMap<>(); + private final Map incompleteSideEffectPhis = new HashMap<>(); + private final Set sealedBlocks = new HashSet<>(); + private Block currentBlock; + + public GraphConstructor(Optimizer optimizer, String name) { + this.optimizer = optimizer; + this.graph = new IrGraph(name); + this.currentBlock = this.graph.startBlock(); + // the start block never gets any more predecessors + sealBlock(this.currentBlock); + } + + public Node newStart() { + assert currentBlock() == this.graph.startBlock() : "start must be in start block"; + return new StartNode(currentBlock()); + } + + public Node newAdd(Node left, Node right) { + return this.optimizer.transform(new AddNode(currentBlock(), left, right)); + } + public Node newSub(Node left, Node right) { + return this.optimizer.transform(new SubNode(currentBlock(), left, right)); + } + + public Node newMul(Node left, Node right) { + return this.optimizer.transform(new MulNode(currentBlock(), left, right)); + } + + public Node newDiv(Node left, Node right) { + return this.optimizer.transform(new DivNode(currentBlock(), left, right, readCurrentSideEffect())); + } + + public Node newMod(Node left, Node right) { + return this.optimizer.transform(new ModNode(currentBlock(), left, right, readCurrentSideEffect())); + } + + public Node newReturn(Node result) { + return new ReturnNode(currentBlock(), readCurrentSideEffect(), result); + } + + public Node newConstInt(int value) { + // always move const into start block, this allows better deduplication + // and resultingly in better value numbering + return this.optimizer.transform(new ConstIntNode(this.graph.startBlock(), value)); + } + + public Node newSideEffectProj(Node node) { + return new ProjNode(currentBlock(), node, ProjNode.SimpleProjectionInfo.SIDE_EFFECT); + } + + public Node newResultProj(Node node) { + return new ProjNode(currentBlock(), node, ProjNode.SimpleProjectionInfo.RESULT); + } + + public Block currentBlock() { + return this.currentBlock; + } + + public Phi newPhi() { + // don't transform phi directly, it is not ready yet + return new Phi(currentBlock()); + } + + public IrGraph graph() { + return this.graph; + } + + void writeVariable(Name variable, Block block, Node value) { + this.currentDef.computeIfAbsent(variable, _ -> new HashMap<>()).put(block, value); + } + + Node readVariable(Name variable, Block block) { + Node node = this.currentDef.getOrDefault(variable, Map.of()).get(block); + if (node != null) { + return node; + } + return readVariableRecursive(variable, block); + } + + + private Node readVariableRecursive(Name variable, Block block) { + Node val; + if (!this.sealedBlocks.contains(block)) { + val = newPhi(); + this.incompletePhis.computeIfAbsent(block, _ -> new HashMap<>()).put(variable, (Phi) val); + } else if (block.predecessors().size() == 1) { + val = readVariable(variable, block.predecessors().getFirst().block()); + } else { + val = newPhi(); + writeVariable(variable, block, val); + val = addPhiOperands(variable, (Phi) val); + } + writeVariable(variable, block, val); + return val; + } + + Node addPhiOperands(Name variable, Phi phi) { + for (Node pred : phi.block().predecessors()) { + phi.appendOperand(readVariable(variable, pred.block())); + } + return tryRemoveTrivialPhi(phi); + } + + Node tryRemoveTrivialPhi(Phi phi) { + // TODO: the paper shows how to remove trivial phis. + // as this is not a problem in Lab 1 and it is just + // a simplification, we recommend to implement this + // part yourself. + return phi; + } + + void sealBlock(Block block) { + for (Map.Entry entry : this.incompletePhis.getOrDefault(block, Map.of()).entrySet()) { + addPhiOperands(entry.getKey(), entry.getValue()); + } + this.sealedBlocks.add(block); + } + + public void writeCurrentSideEffect(Node node) { + writeSideEffect(currentBlock(), node); + } + + private void writeSideEffect(Block block, Node node) { + this.currentSideEffect.put(block, node); + } + + public Node readCurrentSideEffect() { + return readSideEffect(currentBlock()); + } + + private Node readSideEffect(Block block) { + Node node = this.currentSideEffect.get(block); + if (node != null) { + return node; + } + return readSideEffectRecursive(block); + } + + private Node readSideEffectRecursive(Block block) { + Node val; + if (!this.sealedBlocks.contains(block)) { + val = newPhi(); + Phi old = this.incompleteSideEffectPhis.put(block, (Phi) val); + assert old == null : "double readSideEffectRecursive for " + block; + } else if (block.predecessors().size() == 1) { + val = readSideEffect(block.predecessors().getFirst().block()); + } else { + val = newPhi(); + writeSideEffect(block, val); + val = addPhiOperands((Phi) val); + } + writeSideEffect(block, val); + return val; + } + + Node addPhiOperands(Phi phi) { + for (Node pred : phi.block().predecessors()) { + phi.appendOperand(readSideEffect(pred.block())); + } + return tryRemoveTrivialPhi(phi); + } + +} diff --git a/src/main/java/edu/kit/kastel/vads/compiler/ir/IrGraph.java b/src/main/java/edu/kit/kastel/vads/compiler/ir/IrGraph.java new file mode 100644 index 0000000..bcf391b --- /dev/null +++ b/src/main/java/edu/kit/kastel/vads/compiler/ir/IrGraph.java @@ -0,0 +1,53 @@ +package edu.kit.kastel.vads.compiler.ir; + +import edu.kit.kastel.vads.compiler.ir.node.Block; +import edu.kit.kastel.vads.compiler.ir.node.Node; + +import java.util.IdentityHashMap; +import java.util.LinkedHashSet; +import java.util.Map; +import java.util.SequencedSet; +import java.util.Set; + +public class IrGraph { + private final Map> successors = new IdentityHashMap<>(); + private final Block startBlock; + private final Block endBlock; + private final String name; + + public IrGraph(String name) { + this.name = name; + this.startBlock = new Block(this); + this.endBlock = new Block(this); + } + + public void registerSuccessor(Node node, Node successor) { + this.successors.computeIfAbsent(node, _ -> new LinkedHashSet<>()).add(successor); + } + + public void removeSuccessor(Node node, Node oldSuccessor) { + this.successors.computeIfAbsent(node, _ -> new LinkedHashSet<>()).remove(oldSuccessor); + } + + /// {@return the set of nodes that have the given node as one of their inputs} + public Set successors(Node node) { + SequencedSet successors = this.successors.get(node); + if (successors == null) { + return Set.of(); + } + return Set.copyOf(successors); + } + + public Block startBlock() { + return this.startBlock; + } + + public Block endBlock() { + return this.endBlock; + } + + /// {@return the name of this graph} + public String name() { + return name; + } +} diff --git a/src/main/java/edu/kit/kastel/vads/compiler/ir/SsaTranslation.java b/src/main/java/edu/kit/kastel/vads/compiler/ir/SsaTranslation.java new file mode 100644 index 0000000..dac150f --- /dev/null +++ b/src/main/java/edu/kit/kastel/vads/compiler/ir/SsaTranslation.java @@ -0,0 +1,227 @@ +package edu.kit.kastel.vads.compiler.ir; + +import edu.kit.kastel.vads.compiler.ir.node.Block; +import edu.kit.kastel.vads.compiler.ir.node.DivNode; +import edu.kit.kastel.vads.compiler.ir.node.ModNode; +import edu.kit.kastel.vads.compiler.ir.node.Node; +import edu.kit.kastel.vads.compiler.ir.optimize.Optimizer; +import edu.kit.kastel.vads.compiler.ir.util.DebugInfo; +import edu.kit.kastel.vads.compiler.ir.util.DebugInfoHelper; +import edu.kit.kastel.vads.compiler.parser.ast.AssignmentTree; +import edu.kit.kastel.vads.compiler.parser.ast.BinaryOperationTree; +import edu.kit.kastel.vads.compiler.parser.ast.BlockTree; +import edu.kit.kastel.vads.compiler.parser.ast.DeclarationTree; +import edu.kit.kastel.vads.compiler.parser.ast.FunctionTree; +import edu.kit.kastel.vads.compiler.parser.ast.IdentExpressionTree; +import edu.kit.kastel.vads.compiler.parser.ast.LValueIdentTree; +import edu.kit.kastel.vads.compiler.parser.ast.LiteralTree; +import edu.kit.kastel.vads.compiler.parser.ast.NameTree; +import edu.kit.kastel.vads.compiler.parser.ast.NegateTree; +import edu.kit.kastel.vads.compiler.parser.ast.ProgramTree; +import edu.kit.kastel.vads.compiler.parser.ast.ReturnTree; +import edu.kit.kastel.vads.compiler.parser.ast.StatementTree; +import edu.kit.kastel.vads.compiler.parser.ast.Tree; +import edu.kit.kastel.vads.compiler.parser.ast.TypeTree; +import edu.kit.kastel.vads.compiler.parser.symbol.Name; +import edu.kit.kastel.vads.compiler.parser.visitor.Visitor; + +import java.util.ArrayDeque; +import java.util.Deque; +import java.util.Optional; +import java.util.function.BinaryOperator; + +/// SSA translation as described in +/// [`Simple and Efficient Construction of Static Single Assignment Form`](https://compilers.cs.uni-saarland.de/papers/bbhlmz13cc.pdf). +/// +/// This implementation also tracks side effect edges that can be used to avoid reordering of operations that cannot be +/// reordered. +/// +/// We recommend to read the paper to better understand the mechanics implemented here. +public class SsaTranslation { + private final FunctionTree function; + private final GraphConstructor constructor; + + public SsaTranslation(FunctionTree function, Optimizer optimizer) { + this.function = function; + this.constructor = new GraphConstructor(optimizer, function.name().name().asString()); + } + + public IrGraph translate() { + var visitor = new SsaTranslationVisitor(); + this.function.accept(visitor, this); + return this.constructor.graph(); + } + + private void writeVariable(Name variable, Block block, Node value) { + this.constructor.writeVariable(variable, block, value); + } + + private Node readVariable(Name variable, Block block) { + return this.constructor.readVariable(variable, block); + } + + private Block currentBlock() { + return this.constructor.currentBlock(); + } + + private static class SsaTranslationVisitor implements Visitor> { + + @SuppressWarnings("OptionalUsedAsFieldOrParameterType") + private static final Optional NOT_AN_EXPRESSION = Optional.empty(); + + private final Deque debugStack = new ArrayDeque<>(); + + private void pushSpan(Tree tree) { + this.debugStack.push(DebugInfoHelper.getDebugInfo()); + DebugInfoHelper.setDebugInfo(new DebugInfo.SourceInfo(tree.span())); + } + + private void popSpan() { + DebugInfoHelper.setDebugInfo(this.debugStack.pop()); + } + + @Override + public Optional visit(AssignmentTree assignmentTree, SsaTranslation data) { + pushSpan(assignmentTree); + BinaryOperator desugar = switch (assignmentTree.operator().type()) { + case ASSIGN_MINUS -> data.constructor::newSub; + case ASSIGN_PLUS -> data.constructor::newAdd; + case ASSIGN_MUL -> data.constructor::newMul; + case ASSIGN_DIV -> (lhs, rhs) -> projResultDivMod(data, data.constructor.newDiv(lhs, rhs)); + case ASSIGN_MOD -> (lhs, rhs) -> projResultDivMod(data, data.constructor.newMod(lhs, rhs)); + case ASSIGN -> null; + default -> + throw new IllegalArgumentException("not an assignment operator " + assignmentTree.operator()); + }; + + switch (assignmentTree.lValue()) { + case LValueIdentTree(var name) -> { + Node rhs = assignmentTree.expression().accept(this, data).orElseThrow(); + if (desugar != null) { + rhs = desugar.apply(data.readVariable(name.name(), data.currentBlock()), rhs); + } + data.writeVariable(name.name(), data.currentBlock(), rhs); + } + } + popSpan(); + return NOT_AN_EXPRESSION; + } + + @Override + public Optional visit(BinaryOperationTree binaryOperationTree, SsaTranslation data) { + pushSpan(binaryOperationTree); + Node lhs = binaryOperationTree.lhs().accept(this, data).orElseThrow(); + Node rhs = binaryOperationTree.rhs().accept(this, data).orElseThrow(); + Node res = switch (binaryOperationTree.operatorType()) { + case MINUS -> data.constructor.newSub(lhs, rhs); + case PLUS -> data.constructor.newAdd(lhs, rhs); + case MUL -> data.constructor.newMul(lhs, rhs); + case DIV -> projResultDivMod(data, data.constructor.newDiv(lhs, rhs)); + case MOD -> projResultDivMod(data, data.constructor.newMod(lhs, rhs)); + default -> + throw new IllegalArgumentException("not a binary expression operator " + binaryOperationTree.operatorType()); + }; + popSpan(); + return Optional.of(res); + } + + @Override + public Optional visit(BlockTree blockTree, SsaTranslation data) { + pushSpan(blockTree); + for (StatementTree statement : blockTree.statements()) { + statement.accept(this, data); + } + popSpan(); + return NOT_AN_EXPRESSION; + } + + @Override + public Optional visit(DeclarationTree declarationTree, SsaTranslation data) { + pushSpan(declarationTree); + if (declarationTree.initializer() != null) { + Node rhs = declarationTree.initializer().accept(this, data).orElseThrow(); + data.writeVariable(declarationTree.name().name(), data.currentBlock(), rhs); + } + popSpan(); + return NOT_AN_EXPRESSION; + } + + @Override + public Optional visit(FunctionTree functionTree, SsaTranslation data) { + pushSpan(functionTree); + Node start = data.constructor.newStart(); + data.constructor.writeCurrentSideEffect(data.constructor.newSideEffectProj(start)); + functionTree.body().accept(this, data); + popSpan(); + return NOT_AN_EXPRESSION; + } + + @Override + public Optional visit(IdentExpressionTree identExpressionTree, SsaTranslation data) { + pushSpan(identExpressionTree); + Node value = data.readVariable(identExpressionTree.name().name(), data.currentBlock()); + popSpan(); + return Optional.of(value); + } + + @Override + public Optional visit(LiteralTree literalTree, SsaTranslation data) { + pushSpan(literalTree); + Node node = data.constructor.newConstInt((int) literalTree.value()); + popSpan(); + return Optional.of(node); + } + + @Override + public Optional visit(LValueIdentTree lValueIdentTree, SsaTranslation data) { + return NOT_AN_EXPRESSION; + } + + @Override + public Optional visit(NameTree nameTree, SsaTranslation data) { + return NOT_AN_EXPRESSION; + } + + @Override + public Optional visit(NegateTree negateTree, SsaTranslation data) { + pushSpan(negateTree); + Node node = negateTree.expression().accept(this, data).orElseThrow(); + Node res = data.constructor.newSub(data.constructor.newConstInt(0), node); + popSpan(); + return Optional.of(res); + } + + @Override + public Optional visit(ProgramTree programTree, SsaTranslation data) { + throw new UnsupportedOperationException(); + } + + @Override + public Optional visit(ReturnTree returnTree, SsaTranslation data) { + pushSpan(returnTree); + Node node = returnTree.expression().accept(this, data).orElseThrow(); + Node ret = data.constructor.newReturn(node); + data.constructor.graph().endBlock().addPredecessor(ret); + popSpan(); + return NOT_AN_EXPRESSION; + } + + @Override + public Optional visit(TypeTree typeTree, SsaTranslation data) { + throw new UnsupportedOperationException(); + } + + private Node projResultDivMod(SsaTranslation data, Node divMod) { + // make sure we actually have a div or a mod, as optimizations could + // have changed it to something else already + if (!(divMod instanceof DivNode || divMod instanceof ModNode)) { + return divMod; + } + Node projSideEffect = data.constructor.newSideEffectProj(divMod); + data.constructor.writeCurrentSideEffect(projSideEffect); + return data.constructor.newResultProj(divMod); + } + } + + +} diff --git a/src/main/java/edu/kit/kastel/vads/compiler/ir/node/AddNode.java b/src/main/java/edu/kit/kastel/vads/compiler/ir/node/AddNode.java new file mode 100644 index 0000000..57bea90 --- /dev/null +++ b/src/main/java/edu/kit/kastel/vads/compiler/ir/node/AddNode.java @@ -0,0 +1,19 @@ +package edu.kit.kastel.vads.compiler.ir.node; + +public final class AddNode extends BinaryOperationNode { + + public AddNode(Block block, Node left, Node right) { + super(block, left, right); + } + + @SuppressWarnings("EqualsDoesntCheckParameterClass") // we do, but not here + @Override + public boolean equals(Object obj) { + return commutativeEquals(this, obj); + } + + @Override + public int hashCode() { + return commutativeHashCode(this); + } +} diff --git a/src/main/java/edu/kit/kastel/vads/compiler/ir/node/BinaryOperationNode.java b/src/main/java/edu/kit/kastel/vads/compiler/ir/node/BinaryOperationNode.java new file mode 100644 index 0000000..3715618 --- /dev/null +++ b/src/main/java/edu/kit/kastel/vads/compiler/ir/node/BinaryOperationNode.java @@ -0,0 +1,50 @@ +package edu.kit.kastel.vads.compiler.ir.node; + +public sealed abstract class BinaryOperationNode extends Node permits AddNode, DivNode, ModNode, MulNode, SubNode { + public static final int LEFT = 0; + public static final int RIGHT = 1; + + protected BinaryOperationNode(Block block, Node left, Node right) { + super(block, left, right); + } + + protected BinaryOperationNode(Block block, Node left, Node right, Node sideEffect) { + super(block, left, right, sideEffect); + } + + protected static int commutativeHashCode(BinaryOperationNode node) { + int h = node.block().hashCode(); + // commutative operation: we want h(op(x, y)) == h(op(y, x)) + h += 31 * (node.predecessor(LEFT).hashCode() ^ node.predecessor(RIGHT).hashCode()); + return h; + } + + protected static boolean commutativeEquals(BinaryOperationNode a, Object bObj) { + if (!(bObj instanceof BinaryOperationNode b)) { + return false; + } + if (a.getClass() != b.getClass()) { + return false; + } + if (a.predecessor(LEFT) == b.predecessor(LEFT) && a.predecessor(RIGHT) == b.predecessor(RIGHT)) { + return true; + } + // commutative operation: op(x, y) == op(y, x) + return a.predecessor(LEFT) == b.predecessor(RIGHT) && a.predecessor(RIGHT) == b.predecessor(LEFT); + } + + @Override + public boolean equals(Object obj) { + if (!(obj instanceof BinaryOperationNode binOp)) { + return false; + } + return obj.getClass() == this.getClass() + && this.predecessor(LEFT) == binOp.predecessor(LEFT) + && this.predecessor(RIGHT) == binOp.predecessor(RIGHT); + } + + @Override + public int hashCode() { + return (this.predecessor(LEFT).hashCode() * 31 + this.predecessor(RIGHT).hashCode()) ^ this.getClass().hashCode(); + } +} diff --git a/src/main/java/edu/kit/kastel/vads/compiler/ir/node/Block.java b/src/main/java/edu/kit/kastel/vads/compiler/ir/node/Block.java new file mode 100644 index 0000000..e168cdc --- /dev/null +++ b/src/main/java/edu/kit/kastel/vads/compiler/ir/node/Block.java @@ -0,0 +1,11 @@ +package edu.kit.kastel.vads.compiler.ir.node; + +import edu.kit.kastel.vads.compiler.ir.IrGraph; + +public final class Block extends Node { + + public Block(IrGraph graph) { + super(graph); + } + +} diff --git a/src/main/java/edu/kit/kastel/vads/compiler/ir/node/ConstIntNode.java b/src/main/java/edu/kit/kastel/vads/compiler/ir/node/ConstIntNode.java new file mode 100644 index 0000000..a5426a9 --- /dev/null +++ b/src/main/java/edu/kit/kastel/vads/compiler/ir/node/ConstIntNode.java @@ -0,0 +1,32 @@ +package edu.kit.kastel.vads.compiler.ir.node; + +public final class ConstIntNode extends Node { + private final int value; + + public ConstIntNode(Block block, int value) { + super(block); + this.value = value; + } + + public int value() { + return this.value; + } + + @Override + public boolean equals(Object obj) { + if (obj instanceof ConstIntNode c) { + return this.block() == c.block() && c.value == this.value; + } + return false; + } + + @Override + public int hashCode() { + return this.value; + } + + @Override + protected String info() { + return "[" + this.value + "]"; + } +} diff --git a/src/main/java/edu/kit/kastel/vads/compiler/ir/node/DivNode.java b/src/main/java/edu/kit/kastel/vads/compiler/ir/node/DivNode.java new file mode 100644 index 0000000..a4a6ca7 --- /dev/null +++ b/src/main/java/edu/kit/kastel/vads/compiler/ir/node/DivNode.java @@ -0,0 +1,15 @@ +package edu.kit.kastel.vads.compiler.ir.node; + +public final class DivNode extends BinaryOperationNode { + public static final int SIDE_EFFECT = 2; + public DivNode(Block block, Node left, Node right, Node sideEffect) { + super(block, left, right, sideEffect); + } + + @Override + public boolean equals(Object obj) { + // side effect, must be very careful with value numbering. + // this is the most conservative approach + return obj == this; + } +} diff --git a/src/main/java/edu/kit/kastel/vads/compiler/ir/node/ModNode.java b/src/main/java/edu/kit/kastel/vads/compiler/ir/node/ModNode.java new file mode 100644 index 0000000..ccfadb7 --- /dev/null +++ b/src/main/java/edu/kit/kastel/vads/compiler/ir/node/ModNode.java @@ -0,0 +1,15 @@ +package edu.kit.kastel.vads.compiler.ir.node; + +public final class ModNode extends BinaryOperationNode { + public static final int SIDE_EFFECT = 2; + public ModNode(Block block, Node left, Node right, Node sideEffect) { + super(block, left, right, sideEffect); + } + + @Override + public boolean equals(Object obj) { + // side effect, must be very careful with value numbering. + // this is the most conservative approach + return obj == this; + } +} diff --git a/src/main/java/edu/kit/kastel/vads/compiler/ir/node/MulNode.java b/src/main/java/edu/kit/kastel/vads/compiler/ir/node/MulNode.java new file mode 100644 index 0000000..7915233 --- /dev/null +++ b/src/main/java/edu/kit/kastel/vads/compiler/ir/node/MulNode.java @@ -0,0 +1,18 @@ +package edu.kit.kastel.vads.compiler.ir.node; + +public final class MulNode extends BinaryOperationNode { + public MulNode(Block block, Node left, Node right) { + super(block, left, right); + } + + @SuppressWarnings("EqualsDoesntCheckParameterClass") // we do, but not here + @Override + public boolean equals(Object obj) { + return commutativeEquals(this, obj); + } + + @Override + public int hashCode() { + return commutativeHashCode(this); + } +} diff --git a/src/main/java/edu/kit/kastel/vads/compiler/ir/node/Node.java b/src/main/java/edu/kit/kastel/vads/compiler/ir/node/Node.java new file mode 100644 index 0000000..cd54aad --- /dev/null +++ b/src/main/java/edu/kit/kastel/vads/compiler/ir/node/Node.java @@ -0,0 +1,73 @@ +package edu.kit.kastel.vads.compiler.ir.node; + +import edu.kit.kastel.vads.compiler.ir.util.DebugInfo; +import edu.kit.kastel.vads.compiler.ir.IrGraph; +import edu.kit.kastel.vads.compiler.ir.util.DebugInfoHelper; + +import java.util.ArrayList; +import java.util.List; + +/// The base class for all nodes. +public sealed abstract class Node permits BinaryOperationNode, Block, ConstIntNode, Phi, ProjNode, ReturnNode, StartNode { + private final IrGraph graph; + private final Block block; + private final List predecessors = new ArrayList<>(); + private final DebugInfo debugInfo; + + protected Node(Block block, Node... predecessors) { + this.graph = block.graph(); + this.block = block; + this.predecessors.addAll(List.of(predecessors)); + for (Node predecessor : predecessors) { + graph.registerSuccessor(predecessor, this); + } + this.debugInfo = DebugInfoHelper.getDebugInfo(); + } + + protected Node(IrGraph graph) { + assert this.getClass() == Block.class : "must be used by Block only"; + this.graph = graph; + this.block = (Block) this; + this.debugInfo = DebugInfo.NoInfo.INSTANCE; + } + + public final IrGraph graph() { + return this.graph; + } + + public final Block block() { + return this.block; + } + + public final List predecessors() { + return List.copyOf(this.predecessors); + } + + public final void setPredecessor(int idx, Node node) { + this.graph.removeSuccessor(this.predecessors.get(idx), this); + this.predecessors.set(idx, node); + this.graph.registerSuccessor(node, this); + } + + public final void addPredecessor(Node node) { + this.predecessors.add(node); + this.graph.registerSuccessor(node, this); + } + + public final Node predecessor(int idx) { + return this.predecessors.get(idx); + } + + @Override + public final String toString() { + return (this.getClass().getSimpleName().replace("Node", "") + " " + info()).stripTrailing(); + } + + protected String info() { + return ""; + } + + public DebugInfo debugInfo() { + return debugInfo; + } +} diff --git a/src/main/java/edu/kit/kastel/vads/compiler/ir/node/Phi.java b/src/main/java/edu/kit/kastel/vads/compiler/ir/node/Phi.java new file mode 100644 index 0000000..2f183cf --- /dev/null +++ b/src/main/java/edu/kit/kastel/vads/compiler/ir/node/Phi.java @@ -0,0 +1,11 @@ +package edu.kit.kastel.vads.compiler.ir.node; + +public final class Phi extends Node { + public Phi(Block block) { + super(block); + } + + public void appendOperand(Node node) { + addPredecessor(node); + } +} diff --git a/src/main/java/edu/kit/kastel/vads/compiler/ir/node/ProjNode.java b/src/main/java/edu/kit/kastel/vads/compiler/ir/node/ProjNode.java new file mode 100644 index 0000000..041c2b5 --- /dev/null +++ b/src/main/java/edu/kit/kastel/vads/compiler/ir/node/ProjNode.java @@ -0,0 +1,24 @@ +package edu.kit.kastel.vads.compiler.ir.node; + +public final class ProjNode extends Node { + public static final int IN = 0; + private final ProjectionInfo projectionInfo; + + public ProjNode(Block block, Node in, ProjectionInfo projectionInfo) { + super(block, in); + this.projectionInfo = projectionInfo; + } + + @Override + protected String info() { + return this.projectionInfo.toString(); + } + + public sealed interface ProjectionInfo { + + } + + public enum SimpleProjectionInfo implements ProjectionInfo { + RESULT, SIDE_EFFECT + } +} diff --git a/src/main/java/edu/kit/kastel/vads/compiler/ir/node/ReturnNode.java b/src/main/java/edu/kit/kastel/vads/compiler/ir/node/ReturnNode.java new file mode 100644 index 0000000..ced3252 --- /dev/null +++ b/src/main/java/edu/kit/kastel/vads/compiler/ir/node/ReturnNode.java @@ -0,0 +1,9 @@ +package edu.kit.kastel.vads.compiler.ir.node; + +public final class ReturnNode extends Node { + public static final int SIDE_EFFECT = 0; + public static final int RESULT = 1; + public ReturnNode(Block block, Node sideEffect, Node result) { + super(block, sideEffect, result); + } +} diff --git a/src/main/java/edu/kit/kastel/vads/compiler/ir/node/StartNode.java b/src/main/java/edu/kit/kastel/vads/compiler/ir/node/StartNode.java new file mode 100644 index 0000000..9f0c16b --- /dev/null +++ b/src/main/java/edu/kit/kastel/vads/compiler/ir/node/StartNode.java @@ -0,0 +1,7 @@ +package edu.kit.kastel.vads.compiler.ir.node; + +public final class StartNode extends Node { + public StartNode(Block block) { + super(block); + } +} diff --git a/src/main/java/edu/kit/kastel/vads/compiler/ir/node/SubNode.java b/src/main/java/edu/kit/kastel/vads/compiler/ir/node/SubNode.java new file mode 100644 index 0000000..c0ede85 --- /dev/null +++ b/src/main/java/edu/kit/kastel/vads/compiler/ir/node/SubNode.java @@ -0,0 +1,7 @@ +package edu.kit.kastel.vads.compiler.ir.node; + +public final class SubNode extends BinaryOperationNode { + public SubNode(Block block, Node left, Node right) { + super(block, left, right); + } +} diff --git a/src/main/java/edu/kit/kastel/vads/compiler/ir/optimize/LocalValueNumbering.java b/src/main/java/edu/kit/kastel/vads/compiler/ir/optimize/LocalValueNumbering.java new file mode 100644 index 0000000..2f98b71 --- /dev/null +++ b/src/main/java/edu/kit/kastel/vads/compiler/ir/optimize/LocalValueNumbering.java @@ -0,0 +1,20 @@ +package edu.kit.kastel.vads.compiler.ir.optimize; + +import edu.kit.kastel.vads.compiler.ir.node.Node; + +import java.util.HashMap; +import java.util.Map; + +/// This depends on [Node#equals(java.lang.Object)] and [Node#hashCode()] methods. +/// As long as they take the block into account, it is only local, but replacement +/// is extremely simple. +/// When using classes like [HashMap] or [java.util.HashSet] without this optimization, +/// the [Node#equals(java.lang.Object)] and [Node#hashCode()] methods must be adjusted. +public class LocalValueNumbering implements Optimizer { + private final Map knownNodes = new HashMap<>(); + + @Override + public Node transform(Node node) { + return this.knownNodes.computeIfAbsent(node, n -> n); + } +} diff --git a/src/main/java/edu/kit/kastel/vads/compiler/ir/optimize/Optimizer.java b/src/main/java/edu/kit/kastel/vads/compiler/ir/optimize/Optimizer.java new file mode 100644 index 0000000..d561a8f --- /dev/null +++ b/src/main/java/edu/kit/kastel/vads/compiler/ir/optimize/Optimizer.java @@ -0,0 +1,9 @@ +package edu.kit.kastel.vads.compiler.ir.optimize; + +import edu.kit.kastel.vads.compiler.ir.node.Node; + +/// An interface that allows replacing a node with a more optimal one. +public interface Optimizer { + + Node transform(Node node); +} diff --git a/src/main/java/edu/kit/kastel/vads/compiler/ir/util/DebugInfo.java b/src/main/java/edu/kit/kastel/vads/compiler/ir/util/DebugInfo.java new file mode 100644 index 0000000..a2b93a9 --- /dev/null +++ b/src/main/java/edu/kit/kastel/vads/compiler/ir/util/DebugInfo.java @@ -0,0 +1,12 @@ +package edu.kit.kastel.vads.compiler.ir.util; + +import edu.kit.kastel.vads.compiler.Span; + +/// Provides information to ease debugging +public sealed interface DebugInfo { + enum NoInfo implements DebugInfo { + INSTANCE + } + + record SourceInfo(Span span) implements DebugInfo {} +} diff --git a/src/main/java/edu/kit/kastel/vads/compiler/ir/util/DebugInfoHelper.java b/src/main/java/edu/kit/kastel/vads/compiler/ir/util/DebugInfoHelper.java new file mode 100644 index 0000000..b01c573 --- /dev/null +++ b/src/main/java/edu/kit/kastel/vads/compiler/ir/util/DebugInfoHelper.java @@ -0,0 +1,16 @@ +package edu.kit.kastel.vads.compiler.ir.util; + +/// This is a dirty trick as we don't have Scoped Values. +/// It allows tracking debug info without having to pass it +/// down all the layers. +public final class DebugInfoHelper { + private static DebugInfo debugInfo = DebugInfo.NoInfo.INSTANCE; + + public static void setDebugInfo(DebugInfo debugInfo) { + DebugInfoHelper.debugInfo = debugInfo; + } + + public static DebugInfo getDebugInfo() { + return debugInfo; + } +} diff --git a/src/main/java/edu/kit/kastel/vads/compiler/ir/util/GraphVizPrinter.java b/src/main/java/edu/kit/kastel/vads/compiler/ir/util/GraphVizPrinter.java new file mode 100644 index 0000000..4c4a084 --- /dev/null +++ b/src/main/java/edu/kit/kastel/vads/compiler/ir/util/GraphVizPrinter.java @@ -0,0 +1,144 @@ +package edu.kit.kastel.vads.compiler.ir.util; + +import edu.kit.kastel.vads.compiler.Span; +import edu.kit.kastel.vads.compiler.ir.IrGraph; +import edu.kit.kastel.vads.compiler.ir.node.Block; +import edu.kit.kastel.vads.compiler.ir.node.Node; + +import java.util.ArrayList; +import java.util.Collections; +import java.util.HashMap; +import java.util.HashSet; +import java.util.IdentityHashMap; +import java.util.List; +import java.util.Map; +import java.util.Set; + +/// Outputs a DOT format string to visualize an [IrGraph]. +public class GraphVizPrinter { + private final Map> clusters = new HashMap<>(); + private final List edges = new ArrayList<>(); + private final Map ids = new HashMap<>(); + private final StringBuilder builder = new StringBuilder(); + private final IrGraph graph; + private int counter = 0; + + public GraphVizPrinter(IrGraph graph) { + this.graph = graph; + } + + public static String print(IrGraph graph) { + GraphVizPrinter printer = new GraphVizPrinter(graph); + printer.prepare(graph.endBlock(), new HashSet<>()); + printer.print(); + return printer.builder.toString(); + } + + private void prepare(Node node, Set seen) { + if (!seen.add(node)) { + return; + } + + if (!(node instanceof Block)) { + this.clusters.computeIfAbsent(node.block(), _ -> Collections.newSetFromMap(new IdentityHashMap<>())) + .add(node); + } + int idx = 0; + for (Node predecessor : node.predecessors()) { + this.edges.add(new Edge(predecessor, node, idx++)); + prepare(predecessor, seen); + } + if (node == this.graph.endBlock()) { + this.clusters.put(this.graph.endBlock(), Set.of()); + } + } + + private void print() { + this.builder.append("digraph \"") + .append(this.graph.name()) + .append("\"") + .append(""" + { + compound=true; + layout=dot; + node [shape=box]; + splines=ortho; + overlap=false; + + """); + + this.clusters.forEach((block, nodes) -> { + this.builder.append(" subgraph cluster_") + .append(idFor(block)) + .append(" {\n") + .repeat(" ", 8) + .append("c_").append(idFor(block)) + .append(" [width=0, height=0, fixedsize=true, style=invis];\n"); + if (block == this.graph.endBlock()) { + this.builder.repeat(" ", 8) + .append("label=End;\n"); + } + for (Node node : nodes) { + this.builder.repeat(" ", 8) + .append(idFor(node)) + .append(" [label=\"") + .append(labelFor(node)) + .append("\""); + if (node.debugInfo() instanceof DebugInfo.SourceInfo(Span span)) { + this.builder.append(", tooltip=\"") + .append("source span: ") + .append(span) + .append("\""); + } + this.builder.append("];\n"); + } + this.builder.append(" }\n\n"); + }); + + for (Edge edge : this.edges) { + this.builder.repeat(" ", 4) + .append(nameFor(edge.from())) + .append(" -> ") + .append(nameFor(edge.to())) + .append(" [") + .append("label=") + .append(edge.idx()); + + if (edge.from() instanceof Block b) { + this.builder.append(", ") + .append("ltail=") + .append("cluster_") + .append(idFor(b)); + } + if (edge.to() instanceof Block b) { + this.builder.append(", ") + .append("lhead=") + .append("cluster_") + .append(idFor(b)); + } + + this.builder.append("];\n"); + } + + this.builder.append("}"); + + } + + private int idFor(Node node) { + return this.ids.computeIfAbsent(node, _ -> this.counter++); + } + + private String nameFor(Node node) { + if (node instanceof Block) { + return "c_" + idFor(node); + } + return String.valueOf(idFor(node)); + } + + private String labelFor(Node node) { + return node.toString(); + } + + record Edge(Node from, Node to, int idx) { + } +} diff --git a/src/main/java/edu/kit/kastel/vads/compiler/ir/util/NodeSupport.java b/src/main/java/edu/kit/kastel/vads/compiler/ir/util/NodeSupport.java new file mode 100644 index 0000000..586d5c2 --- /dev/null +++ b/src/main/java/edu/kit/kastel/vads/compiler/ir/util/NodeSupport.java @@ -0,0 +1,18 @@ +package edu.kit.kastel.vads.compiler.ir.util; + +import edu.kit.kastel.vads.compiler.ir.node.Node; +import edu.kit.kastel.vads.compiler.ir.node.ProjNode; + +public final class NodeSupport { + private NodeSupport() { + + } + + public static Node predecessorSkipProj(Node node, int predIdx) { + Node pred = node.predecessor(predIdx); + if (pred instanceof ProjNode) { + return pred.predecessor(ProjNode.IN); + } + return pred; + } +} diff --git a/src/main/java/edu/kit/kastel/vads/compiler/lexer/ErrorToken.java b/src/main/java/edu/kit/kastel/vads/compiler/lexer/ErrorToken.java new file mode 100644 index 0000000..67f4cfb --- /dev/null +++ b/src/main/java/edu/kit/kastel/vads/compiler/lexer/ErrorToken.java @@ -0,0 +1,10 @@ +package edu.kit.kastel.vads.compiler.lexer; + +import edu.kit.kastel.vads.compiler.Span; + +public record ErrorToken(String value, Span span) implements Token { + @Override + public String asString() { + return value(); + } +} diff --git a/src/main/java/edu/kit/kastel/vads/compiler/lexer/Identifier.java b/src/main/java/edu/kit/kastel/vads/compiler/lexer/Identifier.java new file mode 100644 index 0000000..70e3f49 --- /dev/null +++ b/src/main/java/edu/kit/kastel/vads/compiler/lexer/Identifier.java @@ -0,0 +1,10 @@ +package edu.kit.kastel.vads.compiler.lexer; + +import edu.kit.kastel.vads.compiler.Span; + +public record Identifier(String value, Span span) implements Token { + @Override + public String asString() { + return value(); + } +} diff --git a/src/main/java/edu/kit/kastel/vads/compiler/lexer/Keyword.java b/src/main/java/edu/kit/kastel/vads/compiler/lexer/Keyword.java new file mode 100644 index 0000000..418686f --- /dev/null +++ b/src/main/java/edu/kit/kastel/vads/compiler/lexer/Keyword.java @@ -0,0 +1,15 @@ +package edu.kit.kastel.vads.compiler.lexer; + +import edu.kit.kastel.vads.compiler.Span; + +public record Keyword(KeywordType type, Span span) implements Token { + @Override + public boolean isKeyword(KeywordType keywordType) { + return type() == keywordType; + } + + @Override + public String asString() { + return type().keyword(); + } +} diff --git a/src/main/java/edu/kit/kastel/vads/compiler/lexer/KeywordType.java b/src/main/java/edu/kit/kastel/vads/compiler/lexer/KeywordType.java new file mode 100644 index 0000000..1f64913 --- /dev/null +++ b/src/main/java/edu/kit/kastel/vads/compiler/lexer/KeywordType.java @@ -0,0 +1,41 @@ +package edu.kit.kastel.vads.compiler.lexer; + +public enum KeywordType { + STRUCT("struct"), + IF("if"), + ELSE("else"), + WHILE("while"), + FOR("for"), + CONTINUE("continue"), + BREAK("break"), + RETURN("return"), + ASSERT("assert"), + TRUE("true"), + FALSE("false"), + NULL("NULL"), + PRINT("print"), + READ("read"), + ALLOC("alloc"), + ALLOC_ARRAY("alloc_array"), + INT("int"), + BOOL("bool"), + VOID("void"), + CHAR("char"), + STRING("string"), + ; + + private final String keyword; + + KeywordType(String keyword) { + this.keyword = keyword; + } + + public String keyword() { + return keyword; + } + + @Override + public String toString() { + return keyword(); + } +} diff --git a/src/main/java/edu/kit/kastel/vads/compiler/lexer/Lexer.java b/src/main/java/edu/kit/kastel/vads/compiler/lexer/Lexer.java new file mode 100644 index 0000000..b6324bc --- /dev/null +++ b/src/main/java/edu/kit/kastel/vads/compiler/lexer/Lexer.java @@ -0,0 +1,215 @@ +package edu.kit.kastel.vads.compiler.lexer; + +import edu.kit.kastel.vads.compiler.Position; +import edu.kit.kastel.vads.compiler.Span; +import edu.kit.kastel.vads.compiler.lexer.Operator.OperatorType; +import edu.kit.kastel.vads.compiler.lexer.Separator.SeparatorType; +import org.jspecify.annotations.Nullable; + +import java.util.Optional; + +public class Lexer { + private final String source; + private int pos; + private int lineStart; + private int line; + + private Lexer(String source) { + this.source = source; + } + + public static Lexer forString(String source) { + return new Lexer(source); + } + + public Optional nextToken() { + ErrorToken error = skipWhitespace(); + if (error != null) { + return Optional.of(error); + } + if (this.pos >= this.source.length()) { + return Optional.empty(); + } + Token t = switch (peek()) { + case '(' -> separator(SeparatorType.PAREN_OPEN); + case ')' -> separator(SeparatorType.PAREN_CLOSE); + case '{' -> separator(SeparatorType.BRACE_OPEN); + case '}' -> separator(SeparatorType.BRACE_CLOSE); + case ';' -> separator(SeparatorType.SEMICOLON); + case '-' -> singleOrAssign(OperatorType.MINUS, OperatorType.ASSIGN_MINUS); + case '+' -> singleOrAssign(OperatorType.PLUS, OperatorType.ASSIGN_PLUS); + case '*' -> singleOrAssign(OperatorType.MUL, OperatorType.ASSIGN_MUL); + case '/' -> singleOrAssign(OperatorType.DIV, OperatorType.ASSIGN_DIV); + case '%' -> singleOrAssign(OperatorType.MOD, OperatorType.ASSIGN_MOD); + case '=' -> new Operator(OperatorType.ASSIGN, buildSpan(1)); + default -> { + if (isIdentifierChar(peek())) { + if (isNumeric(peek())) { + yield lexNumber(); + } + yield lexIdentifierOrKeyword(); + } + yield new ErrorToken(String.valueOf(peek()), buildSpan(1)); + } + }; + + return Optional.of(t); + } + + private @Nullable ErrorToken skipWhitespace() { + enum CommentType { + SINGLE_LINE, + MULTI_LINE + } + CommentType currentCommentType = null; + int multiLineCommentDepth = 0; + int commentStart = -1; + while (hasMore(0)) { + switch (peek()) { + case ' ', '\t' -> this.pos++; + case '\n', '\r' -> { + this.pos++; + this.lineStart = this.pos; + this.line++; + if (currentCommentType == CommentType.SINGLE_LINE) { + currentCommentType = null; + } + } + case '/' -> { + if (currentCommentType == CommentType.SINGLE_LINE) { + this.pos++; + continue; + } + if (hasMore(1)) { + if (peek(1) == '/' && currentCommentType == null) { + currentCommentType = CommentType.SINGLE_LINE; + } else if (peek(1) == '*') { + currentCommentType = CommentType.MULTI_LINE; + multiLineCommentDepth++; + } else { + return null; + } + commentStart = this.pos; + this.pos += 2; + continue; + } + // are we in a multi line comment of any depth? + if (multiLineCommentDepth > 0) { + this.pos++; + continue; + } + return null; + } + default -> { + if (currentCommentType == CommentType.MULTI_LINE) { + if (peek() == '*' && hasMore(1) && peek(1) == '/') { + this.pos += 2; + multiLineCommentDepth--; + currentCommentType = multiLineCommentDepth == 0 ? null : CommentType.MULTI_LINE; + } else { + this.pos++; + } + continue; + } else if (currentCommentType == CommentType.SINGLE_LINE) { + this.pos++; + continue; + } + return null; + } + } + } + if (!hasMore(0) && currentCommentType == CommentType.MULTI_LINE) { + return new ErrorToken(this.source.substring(commentStart), buildSpan(0)); + } + return null; + } + + private Separator separator(SeparatorType parenOpen) { + return new Separator(parenOpen, buildSpan(1)); + } + + private Token lexIdentifierOrKeyword() { + int off = 1; + while (hasMore(off) && isIdentifierChar(peek(off))) { + off++; + } + String id = this.source.substring(this.pos, this.pos + off); + // This is a naive solution. Using a better data structure (hashmap, trie) likely performs better. + for (KeywordType value : KeywordType.values()) { + if (value.keyword().equals(id)) { + return new Keyword(value, buildSpan(off)); + } + } + return new Identifier(id, buildSpan(off)); + } + + private Token lexNumber() { + if (isHexPrefix()) { + int off = 2; + while (hasMore(off) && isHex(peek(off))) { + off++; + } + if (off == 2) { + // 0x without any further hex digits + return new ErrorToken(this.source.substring(this.pos, this.pos + off), buildSpan(2)); + } + return new NumberLiteral(this.source.substring(this.pos, this.pos + off), 16, buildSpan(off)); + } + int off = 1; + while (hasMore(off) && isNumeric(peek(off))) { + off++; + } + if (peek() == '0' && off > 1) { + // leading zero is not allowed + return new ErrorToken(this.source.substring(this.pos, this.pos + off), buildSpan(off)); + } + return new NumberLiteral(this.source.substring(this.pos, this.pos + off), 10, buildSpan(off)); + } + + private boolean isHexPrefix() { + return peek() == '0' && hasMore(1) && (peek(1) == 'x' || peek(1) == 'X'); + } + + private boolean isIdentifierChar(char c) { + return c == '_' + || c >= 'a' && c <= 'z' + || c >= 'A' && c <= 'Z' + || c >= '0' && c <= '9'; + } + + private boolean isNumeric(char c) { + return c >= '0' && c <= '9'; + } + + private boolean isHex(char c) { + return isNumeric(c) || (c >= 'a' && c <= 'f') || (c >= 'A' && c <= 'F'); + } + + private Token singleOrAssign(OperatorType single, OperatorType assign) { + if (hasMore(1) && peek(1) == '=') { + return new Operator(assign, buildSpan(2)); + } + return new Operator(single, buildSpan(1)); + } + + private Span buildSpan(int proceed) { + int start = this.pos; + this.pos += proceed; + Position.SimplePosition s = new Position.SimplePosition(this.line, start - this.lineStart); + Position.SimplePosition e = new Position.SimplePosition(this.line, start - this.lineStart + proceed); + return new Span.SimpleSpan(s, e); + } + + private char peek() { + return this.source.charAt(this.pos); + } + + private boolean hasMore(int offset) { + return this.pos + offset < this.source.length(); + } + + private char peek(int offset) { + return this.source.charAt(this.pos + offset); + } + +} diff --git a/src/main/java/edu/kit/kastel/vads/compiler/lexer/NumberLiteral.java b/src/main/java/edu/kit/kastel/vads/compiler/lexer/NumberLiteral.java new file mode 100644 index 0000000..2f333ed --- /dev/null +++ b/src/main/java/edu/kit/kastel/vads/compiler/lexer/NumberLiteral.java @@ -0,0 +1,10 @@ +package edu.kit.kastel.vads.compiler.lexer; + +import edu.kit.kastel.vads.compiler.Span; + +public record NumberLiteral(String value, int base, Span span) implements Token { + @Override + public String asString() { + return value(); + } +} diff --git a/src/main/java/edu/kit/kastel/vads/compiler/lexer/Operator.java b/src/main/java/edu/kit/kastel/vads/compiler/lexer/Operator.java new file mode 100644 index 0000000..eabd054 --- /dev/null +++ b/src/main/java/edu/kit/kastel/vads/compiler/lexer/Operator.java @@ -0,0 +1,42 @@ +package edu.kit.kastel.vads.compiler.lexer; + +import edu.kit.kastel.vads.compiler.Span; + +public record Operator(OperatorType type, Span span) implements Token { + + @Override + public boolean isOperator(OperatorType operatorType) { + return type() == operatorType; + } + + @Override + public String asString() { + return type().toString(); + } + + public enum OperatorType { + ASSIGN_MINUS("-="), + MINUS("-"), + ASSIGN_PLUS("+="), + PLUS("+"), + MUL("*"), + ASSIGN_MUL("*="), + ASSIGN_DIV("/="), + DIV("/"), + ASSIGN_MOD("%="), + MOD("%"), + ASSIGN("="), + ; + + private final String value; + + OperatorType(String value) { + this.value = value; + } + + @Override + public String toString() { + return this.value; + } + } +} diff --git a/src/main/java/edu/kit/kastel/vads/compiler/lexer/Separator.java b/src/main/java/edu/kit/kastel/vads/compiler/lexer/Separator.java new file mode 100644 index 0000000..61c49ed --- /dev/null +++ b/src/main/java/edu/kit/kastel/vads/compiler/lexer/Separator.java @@ -0,0 +1,35 @@ +package edu.kit.kastel.vads.compiler.lexer; + +import edu.kit.kastel.vads.compiler.Span; + +public record Separator(SeparatorType type, Span span) implements Token { + + @Override + public boolean isSeparator(SeparatorType separatorType) { + return type() == separatorType; + } + + @Override + public String asString() { + return type().toString(); + } + + public enum SeparatorType { + PAREN_OPEN("("), + PAREN_CLOSE(")"), + BRACE_OPEN("{"), + BRACE_CLOSE("}"), + SEMICOLON(";"); + + private final String value; + + SeparatorType(String value) { + this.value = value; + } + + @Override + public String toString() { + return this.value; + } + } +} diff --git a/src/main/java/edu/kit/kastel/vads/compiler/lexer/Token.java b/src/main/java/edu/kit/kastel/vads/compiler/lexer/Token.java new file mode 100644 index 0000000..1a8546a --- /dev/null +++ b/src/main/java/edu/kit/kastel/vads/compiler/lexer/Token.java @@ -0,0 +1,22 @@ +package edu.kit.kastel.vads.compiler.lexer; + +import edu.kit.kastel.vads.compiler.Span; + +public sealed interface Token permits ErrorToken, Identifier, Keyword, NumberLiteral, Operator, Separator { + + Span span(); + + default boolean isKeyword(KeywordType keywordType) { + return false; + } + + default boolean isOperator(Operator.OperatorType operatorType) { + return false; + } + + default boolean isSeparator(Separator.SeparatorType separatorType) { + return false; + } + + String asString(); +} diff --git a/src/main/java/edu/kit/kastel/vads/compiler/parser/ParseException.java b/src/main/java/edu/kit/kastel/vads/compiler/parser/ParseException.java new file mode 100644 index 0000000..7d03dfd --- /dev/null +++ b/src/main/java/edu/kit/kastel/vads/compiler/parser/ParseException.java @@ -0,0 +1,7 @@ +package edu.kit.kastel.vads.compiler.parser; + +public class ParseException extends RuntimeException { + public ParseException(String message) { + super(message); + } +} diff --git a/src/main/java/edu/kit/kastel/vads/compiler/parser/Parser.java b/src/main/java/edu/kit/kastel/vads/compiler/parser/Parser.java new file mode 100644 index 0000000..4b09d47 --- /dev/null +++ b/src/main/java/edu/kit/kastel/vads/compiler/parser/Parser.java @@ -0,0 +1,201 @@ +package edu.kit.kastel.vads.compiler.parser; + +import edu.kit.kastel.vads.compiler.lexer.Identifier; +import edu.kit.kastel.vads.compiler.lexer.Keyword; +import edu.kit.kastel.vads.compiler.lexer.KeywordType; +import edu.kit.kastel.vads.compiler.lexer.NumberLiteral; +import edu.kit.kastel.vads.compiler.lexer.Operator; +import edu.kit.kastel.vads.compiler.lexer.Operator.OperatorType; +import edu.kit.kastel.vads.compiler.lexer.Separator; +import edu.kit.kastel.vads.compiler.lexer.Separator.SeparatorType; +import edu.kit.kastel.vads.compiler.Span; +import edu.kit.kastel.vads.compiler.lexer.Token; +import edu.kit.kastel.vads.compiler.parser.ast.AssignmentTree; +import edu.kit.kastel.vads.compiler.parser.ast.BinaryOperationTree; +import edu.kit.kastel.vads.compiler.parser.ast.BlockTree; +import edu.kit.kastel.vads.compiler.parser.ast.DeclarationTree; +import edu.kit.kastel.vads.compiler.parser.ast.ExpressionTree; +import edu.kit.kastel.vads.compiler.parser.ast.FunctionTree; +import edu.kit.kastel.vads.compiler.parser.ast.IdentExpressionTree; +import edu.kit.kastel.vads.compiler.parser.ast.LValueIdentTree; +import edu.kit.kastel.vads.compiler.parser.ast.LValueTree; +import edu.kit.kastel.vads.compiler.parser.ast.LiteralTree; +import edu.kit.kastel.vads.compiler.parser.ast.NameTree; +import edu.kit.kastel.vads.compiler.parser.ast.NegateTree; +import edu.kit.kastel.vads.compiler.parser.ast.ProgramTree; +import edu.kit.kastel.vads.compiler.parser.ast.ReturnTree; +import edu.kit.kastel.vads.compiler.parser.ast.StatementTree; +import edu.kit.kastel.vads.compiler.parser.ast.TypeTree; +import edu.kit.kastel.vads.compiler.parser.symbol.Name; +import edu.kit.kastel.vads.compiler.parser.type.BasicType; + +import java.util.ArrayList; +import java.util.List; + +public class Parser { + private final TokenSource tokenSource; + + public Parser(TokenSource tokenSource) { + this.tokenSource = tokenSource; + } + + public ProgramTree parseProgram() { + return new ProgramTree(List.of(parseFunction())); + } + + private FunctionTree parseFunction() { + Keyword returnType = this.tokenSource.expectKeyword(KeywordType.INT); + Identifier identifier = this.tokenSource.expectIdentifier(); + this.tokenSource.expectSeparator(SeparatorType.PAREN_OPEN); + this.tokenSource.expectSeparator(SeparatorType.PAREN_CLOSE); + BlockTree body = parseBlock(); + return new FunctionTree( + new TypeTree(BasicType.INT, returnType.span()), + name(identifier), + body + ); + } + + private BlockTree parseBlock() { + Separator bodyOpen = this.tokenSource.expectSeparator(SeparatorType.BRACE_OPEN); + List statements = new ArrayList<>(); + while (!(this.tokenSource.peek() instanceof Separator sep && sep.type() == SeparatorType.BRACE_CLOSE)) { + statements.add(parseStatement()); + } + Separator bodyClose = this.tokenSource.expectSeparator(SeparatorType.BRACE_CLOSE); + return new BlockTree(statements, bodyOpen.span().merge(bodyClose.span())); + } + + private StatementTree parseStatement() { + StatementTree statement; + if (this.tokenSource.peek().isKeyword(KeywordType.INT)) { + statement = parseDeclaration(); + } else if (this.tokenSource.peek().isKeyword(KeywordType.RETURN)) { + statement = parseReturn(); + } else { + statement = parseSimple(); + } + this.tokenSource.expectSeparator(SeparatorType.SEMICOLON); + return statement; + } + + private StatementTree parseDeclaration() { + Keyword type = this.tokenSource.expectKeyword(KeywordType.INT); + Identifier ident = this.tokenSource.expectIdentifier(); + ExpressionTree expr = null; + if (this.tokenSource.peek().isOperator(OperatorType.ASSIGN)) { + this.tokenSource.expectOperator(OperatorType.ASSIGN); + expr = parseExpression(); + } + return new DeclarationTree(new TypeTree(BasicType.INT, type.span()), name(ident), expr); + } + + private StatementTree parseSimple() { + LValueTree lValue = parseLValue(); + Operator assignmentOperator = parseAssignmentOperator(); + ExpressionTree expression = parseExpression(); + return new AssignmentTree(lValue, assignmentOperator, expression); + } + + private Operator parseAssignmentOperator() { + if (this.tokenSource.peek() instanceof Operator op) { + return switch (op.type()) { + case ASSIGN, ASSIGN_DIV, ASSIGN_MINUS, ASSIGN_MOD, ASSIGN_MUL, ASSIGN_PLUS -> { + this.tokenSource.consume(); + yield op; + } + default -> throw new ParseException("expected assignment but got " + op.type()); + }; + } + throw new ParseException("expected assignment but got " + this.tokenSource.peek()); + } + + private LValueTree parseLValue() { + if (this.tokenSource.peek().isSeparator(SeparatorType.PAREN_OPEN)) { + this.tokenSource.expectSeparator(SeparatorType.PAREN_OPEN); + LValueTree inner = parseLValue(); + this.tokenSource.expectSeparator(SeparatorType.PAREN_CLOSE); + return inner; + } + Identifier identifier = this.tokenSource.expectIdentifier(); + return new LValueIdentTree(name(identifier)); + } + + private StatementTree parseReturn() { + Keyword ret = this.tokenSource.expectKeyword(KeywordType.RETURN); + ExpressionTree expression = parseExpression(); + return new ReturnTree(expression, ret.span().start()); + } + + private ExpressionTree parseExpression() { + ExpressionTree lhs = parseTerm(); + while (true) { + if (this.tokenSource.peek() instanceof Operator(var type, _) + && (type == OperatorType.PLUS || type == OperatorType.MINUS)) { + this.tokenSource.consume(); + lhs = new BinaryOperationTree(lhs, parseTerm(), type); + } else { + return lhs; + } + } + } + + private ExpressionTree parseTerm() { + ExpressionTree lhs = parseFactor(); + while (true) { + if (this.tokenSource.peek() instanceof Operator(var type, _) + && (type == OperatorType.MUL || type == OperatorType.DIV || type == OperatorType.MOD)) { + this.tokenSource.consume(); + lhs = new BinaryOperationTree(lhs, parseFactor(), type); + } else { + return lhs; + } + } + } + + private ExpressionTree parseFactor() { + return switch (this.tokenSource.peek()) { + case Separator(var type, _) when type == SeparatorType.PAREN_OPEN -> { + this.tokenSource.consume(); + ExpressionTree expression = parseExpression(); + this.tokenSource.expectSeparator(SeparatorType.PAREN_CLOSE); + yield expression; + } + case Operator(var type, _) when type == OperatorType.MINUS -> { + Span span = this.tokenSource.consume().span(); + yield new NegateTree(parseFactor(), span); + } + case Identifier ident -> { + this.tokenSource.consume(); + yield new IdentExpressionTree(name(ident)); + } + case NumberLiteral(String value, int base, Span span) -> { + this.tokenSource.consume(); + yield new LiteralTree(parseValue(value, base), span); + } + case Token t -> throw new ParseException("invalid factor " + t); + }; + } + + private static long parseValue(String value, int base) { + int begin = 0; + int end = value.length(); + if (base == 16) { + begin = 2; // ignore 0x + } + long l; + try { + l = Long.parseLong(value, begin, end, base); + } catch (NumberFormatException _) { + throw new ParseException("invalid int literal " + value); + } + if (l < 0 || l > Integer.toUnsignedLong(Integer.MIN_VALUE)) { + throw new ParseException("invalid int literal " + value); + } + return l; + } + + private static NameTree name(Identifier ident) { + return new NameTree(Name.forIdentifier(ident), ident.span()); + } +} diff --git a/src/main/java/edu/kit/kastel/vads/compiler/parser/Printer.java b/src/main/java/edu/kit/kastel/vads/compiler/parser/Printer.java new file mode 100644 index 0000000..f4d4d82 --- /dev/null +++ b/src/main/java/edu/kit/kastel/vads/compiler/parser/Printer.java @@ -0,0 +1,138 @@ +package edu.kit.kastel.vads.compiler.parser; + +import edu.kit.kastel.vads.compiler.parser.ast.AssignmentTree; +import edu.kit.kastel.vads.compiler.parser.ast.BinaryOperationTree; +import edu.kit.kastel.vads.compiler.parser.ast.BlockTree; +import edu.kit.kastel.vads.compiler.parser.ast.IdentExpressionTree; +import edu.kit.kastel.vads.compiler.parser.ast.LValueIdentTree; +import edu.kit.kastel.vads.compiler.parser.ast.LiteralTree; +import edu.kit.kastel.vads.compiler.parser.ast.NameTree; +import edu.kit.kastel.vads.compiler.parser.ast.NegateTree; +import edu.kit.kastel.vads.compiler.parser.ast.ReturnTree; +import edu.kit.kastel.vads.compiler.parser.ast.Tree; +import edu.kit.kastel.vads.compiler.parser.ast.DeclarationTree; +import edu.kit.kastel.vads.compiler.parser.ast.FunctionTree; +import edu.kit.kastel.vads.compiler.parser.ast.ProgramTree; +import edu.kit.kastel.vads.compiler.parser.ast.StatementTree; +import edu.kit.kastel.vads.compiler.parser.ast.TypeTree; + +import java.util.List; + +/// This is a utility class to help with debugging the parser. +public class Printer { + + private final Tree ast; + private final StringBuilder builder = new StringBuilder(); + private boolean requiresIndent; + private int indentDepth; + + public Printer(Tree ast) { + this.ast = ast; + } + + public static String print(Tree ast) { + Printer printer = new Printer(ast); + printer.printRoot(); + return printer.builder.toString(); + } + + private void printRoot() { + printTree(this.ast); + } + + private void printTree(Tree tree) { + switch (tree) { + case BlockTree(List statements, _) -> { + print("{"); + lineBreak(); + this.indentDepth++; + for (StatementTree statement : statements) { + printTree(statement); + } + this.indentDepth--; + print("}"); + } + case FunctionTree(var returnType, var name, var body) -> { + printTree(returnType); + space(); + printTree(name); + print("()"); + space(); + printTree(body); + } + case NameTree(var name, _) -> print(name.asString()); + case ProgramTree(var topLevelTrees) -> { + for (FunctionTree function : topLevelTrees) { + printTree(function); + lineBreak(); + } + } + case TypeTree(var type, _) -> print(type.asString()); + case BinaryOperationTree(var lhs, var rhs, var op) -> { + print("("); + printTree(lhs); + print(")"); + space(); + this.builder.append(op); + space(); + print("("); + printTree(rhs); + print(")"); + } + case LiteralTree(var value, _) -> this.builder.append(value); + case NegateTree(var expression, _) -> { + print("-("); + printTree(expression); + print(")"); + } + case AssignmentTree(var lValue, var op, var expression) -> { + printTree(lValue); + space(); + this.builder.append(op); + space(); + printTree(expression); + semicolon(); + } + case DeclarationTree(var type, var name, var initializer) -> { + printTree(type); + space(); + printTree(name); + if (initializer != null) { + print(" = "); + printTree(initializer); + } + semicolon(); + } + case ReturnTree(var expr, _) -> { + print("return "); + printTree(expr); + semicolon(); + } + case LValueIdentTree(var name) -> printTree(name); + case IdentExpressionTree(var name) -> printTree(name); + } + } + + private void print(String str) { + if (this.requiresIndent) { + this.requiresIndent = false; + this.builder.append(" ".repeat(4 * this.indentDepth)); + } + this.builder.append(str); + } + + private void lineBreak() { + this.builder.append("\n"); + this.requiresIndent = true; + } + + private void semicolon() { + this.builder.append(";"); + lineBreak(); + } + + private void space() { + this.builder.append(" "); + } + +} diff --git a/src/main/java/edu/kit/kastel/vads/compiler/parser/TokenSource.java b/src/main/java/edu/kit/kastel/vads/compiler/parser/TokenSource.java new file mode 100644 index 0000000..7790c0a --- /dev/null +++ b/src/main/java/edu/kit/kastel/vads/compiler/parser/TokenSource.java @@ -0,0 +1,83 @@ +package edu.kit.kastel.vads.compiler.parser; + +import edu.kit.kastel.vads.compiler.lexer.Identifier; +import edu.kit.kastel.vads.compiler.lexer.Keyword; +import edu.kit.kastel.vads.compiler.lexer.KeywordType; +import edu.kit.kastel.vads.compiler.lexer.Lexer; +import edu.kit.kastel.vads.compiler.lexer.Operator; +import edu.kit.kastel.vads.compiler.lexer.Operator.OperatorType; +import edu.kit.kastel.vads.compiler.lexer.Separator; +import edu.kit.kastel.vads.compiler.lexer.Separator.SeparatorType; +import edu.kit.kastel.vads.compiler.lexer.Token; + +import java.util.List; +import java.util.Optional; +import java.util.stream.Stream; + +public class TokenSource { + private final List tokens; + private int idx; + + public TokenSource(Lexer lexer) { + this.tokens = Stream.generate(lexer::nextToken) + .takeWhile(Optional::isPresent) + .map(Optional::orElseThrow) + .toList(); + } + + TokenSource(List tokens) { + this.tokens = List.copyOf(tokens); + } + + public Token peek() { + expectHasMore(); + return this.tokens.get(this.idx); + } + + public Keyword expectKeyword(KeywordType type) { + Token token = peek(); + if (!(token instanceof Keyword kw) || kw.type() != type) { + throw new ParseException("expected keyword '" + type + "' but got " + token); + } + this.idx++; + return kw; + } + + public Separator expectSeparator(SeparatorType type) { + Token token = peek(); + if (!(token instanceof Separator sep) || sep.type() != type) { + throw new ParseException("expected separator '" + type + "' but got " + token); + } + this.idx++; + return sep; + } + + public Operator expectOperator(OperatorType type) { + Token token = peek(); + if (!(token instanceof Operator op) || op.type() != type) { + throw new ParseException("expected operator '" + type + "' but got " + token); + } + this.idx++; + return op; + } + public Identifier expectIdentifier() { + Token token = peek(); + if (!(token instanceof Identifier ident)) { + throw new ParseException("expected identifier but got " + token); + } + this.idx++; + return ident; + } + + public Token consume() { + Token token = peek(); + this.idx++; + return token; + } + + private void expectHasMore() { + if (this.idx >= this.tokens.size()) { + throw new ParseException("reached end of file"); + } + } +} diff --git a/src/main/java/edu/kit/kastel/vads/compiler/parser/ast/AssignmentTree.java b/src/main/java/edu/kit/kastel/vads/compiler/parser/ast/AssignmentTree.java new file mode 100644 index 0000000..ead94e4 --- /dev/null +++ b/src/main/java/edu/kit/kastel/vads/compiler/parser/ast/AssignmentTree.java @@ -0,0 +1,17 @@ +package edu.kit.kastel.vads.compiler.parser.ast; + +import edu.kit.kastel.vads.compiler.lexer.Operator; +import edu.kit.kastel.vads.compiler.Span; +import edu.kit.kastel.vads.compiler.parser.visitor.Visitor; + +public record AssignmentTree(LValueTree lValue, Operator operator, ExpressionTree expression) implements StatementTree { + @Override + public Span span() { + return lValue().span().merge(expression().span()); + } + + @Override + public R accept(Visitor visitor, T data) { + return visitor.visit(this, data); + } +} diff --git a/src/main/java/edu/kit/kastel/vads/compiler/parser/ast/BinaryOperationTree.java b/src/main/java/edu/kit/kastel/vads/compiler/parser/ast/BinaryOperationTree.java new file mode 100644 index 0000000..df7483a --- /dev/null +++ b/src/main/java/edu/kit/kastel/vads/compiler/parser/ast/BinaryOperationTree.java @@ -0,0 +1,19 @@ +package edu.kit.kastel.vads.compiler.parser.ast; + +import edu.kit.kastel.vads.compiler.lexer.Operator; +import edu.kit.kastel.vads.compiler.Span; +import edu.kit.kastel.vads.compiler.parser.visitor.Visitor; + +public record BinaryOperationTree( + ExpressionTree lhs, ExpressionTree rhs, Operator.OperatorType operatorType +) implements ExpressionTree { + @Override + public Span span() { + return lhs().span().merge(rhs().span()); + } + + @Override + public R accept(Visitor visitor, T data) { + return visitor.visit(this, data); + } +} diff --git a/src/main/java/edu/kit/kastel/vads/compiler/parser/ast/BlockTree.java b/src/main/java/edu/kit/kastel/vads/compiler/parser/ast/BlockTree.java new file mode 100644 index 0000000..01110fd --- /dev/null +++ b/src/main/java/edu/kit/kastel/vads/compiler/parser/ast/BlockTree.java @@ -0,0 +1,18 @@ +package edu.kit.kastel.vads.compiler.parser.ast; + +import edu.kit.kastel.vads.compiler.Span; +import edu.kit.kastel.vads.compiler.parser.visitor.Visitor; + +import java.util.List; + +public record BlockTree(List statements, Span span) implements StatementTree { + + public BlockTree { + statements = List.copyOf(statements); + } + + @Override + public R accept(Visitor visitor, T data) { + return visitor.visit(this, data); + } +} diff --git a/src/main/java/edu/kit/kastel/vads/compiler/parser/ast/DeclarationTree.java b/src/main/java/edu/kit/kastel/vads/compiler/parser/ast/DeclarationTree.java new file mode 100644 index 0000000..f857b32 --- /dev/null +++ b/src/main/java/edu/kit/kastel/vads/compiler/parser/ast/DeclarationTree.java @@ -0,0 +1,20 @@ +package edu.kit.kastel.vads.compiler.parser.ast; + +import edu.kit.kastel.vads.compiler.Span; +import edu.kit.kastel.vads.compiler.parser.visitor.Visitor; +import org.jspecify.annotations.Nullable; + +public record DeclarationTree(TypeTree type, NameTree name, @Nullable ExpressionTree initializer) implements StatementTree { + @Override + public Span span() { + if (initializer() != null) { + return type().span().merge(initializer().span()); + } + return type().span().merge(name().span()); + } + + @Override + public R accept(Visitor visitor, T data) { + return visitor.visit(this, data); + } +} diff --git a/src/main/java/edu/kit/kastel/vads/compiler/parser/ast/ExpressionTree.java b/src/main/java/edu/kit/kastel/vads/compiler/parser/ast/ExpressionTree.java new file mode 100644 index 0000000..3e30afa --- /dev/null +++ b/src/main/java/edu/kit/kastel/vads/compiler/parser/ast/ExpressionTree.java @@ -0,0 +1,4 @@ +package edu.kit.kastel.vads.compiler.parser.ast; + +public sealed interface ExpressionTree extends Tree permits BinaryOperationTree, IdentExpressionTree, LiteralTree, NegateTree { +} diff --git a/src/main/java/edu/kit/kastel/vads/compiler/parser/ast/FunctionTree.java b/src/main/java/edu/kit/kastel/vads/compiler/parser/ast/FunctionTree.java new file mode 100644 index 0000000..ff66ae5 --- /dev/null +++ b/src/main/java/edu/kit/kastel/vads/compiler/parser/ast/FunctionTree.java @@ -0,0 +1,16 @@ +package edu.kit.kastel.vads.compiler.parser.ast; + +import edu.kit.kastel.vads.compiler.Span; +import edu.kit.kastel.vads.compiler.parser.visitor.Visitor; + +public record FunctionTree(TypeTree returnType, NameTree name, BlockTree body) implements Tree { + @Override + public Span span() { + return new Span.SimpleSpan(returnType().span().start(), body().span().end()); + } + + @Override + public R accept(Visitor visitor, T data) { + return visitor.visit(this, data); + } +} diff --git a/src/main/java/edu/kit/kastel/vads/compiler/parser/ast/IdentExpressionTree.java b/src/main/java/edu/kit/kastel/vads/compiler/parser/ast/IdentExpressionTree.java new file mode 100644 index 0000000..d2f0939 --- /dev/null +++ b/src/main/java/edu/kit/kastel/vads/compiler/parser/ast/IdentExpressionTree.java @@ -0,0 +1,16 @@ +package edu.kit.kastel.vads.compiler.parser.ast; + +import edu.kit.kastel.vads.compiler.Span; +import edu.kit.kastel.vads.compiler.parser.visitor.Visitor; + +public record IdentExpressionTree(NameTree name) implements ExpressionTree { + @Override + public Span span() { + return name().span(); + } + + @Override + public R accept(Visitor visitor, T data) { + return visitor.visit(this, data); + } +} diff --git a/src/main/java/edu/kit/kastel/vads/compiler/parser/ast/LValueIdentTree.java b/src/main/java/edu/kit/kastel/vads/compiler/parser/ast/LValueIdentTree.java new file mode 100644 index 0000000..332d8af --- /dev/null +++ b/src/main/java/edu/kit/kastel/vads/compiler/parser/ast/LValueIdentTree.java @@ -0,0 +1,16 @@ +package edu.kit.kastel.vads.compiler.parser.ast; + +import edu.kit.kastel.vads.compiler.Span; +import edu.kit.kastel.vads.compiler.parser.visitor.Visitor; + +public record LValueIdentTree(NameTree name) implements LValueTree { + @Override + public Span span() { + return name().span(); + } + + @Override + public R accept(Visitor visitor, T data) { + return visitor.visit(this, data); + } +} diff --git a/src/main/java/edu/kit/kastel/vads/compiler/parser/ast/LValueTree.java b/src/main/java/edu/kit/kastel/vads/compiler/parser/ast/LValueTree.java new file mode 100644 index 0000000..13f6dd2 --- /dev/null +++ b/src/main/java/edu/kit/kastel/vads/compiler/parser/ast/LValueTree.java @@ -0,0 +1,4 @@ +package edu.kit.kastel.vads.compiler.parser.ast; + +public sealed interface LValueTree extends Tree permits LValueIdentTree { +} diff --git a/src/main/java/edu/kit/kastel/vads/compiler/parser/ast/LiteralTree.java b/src/main/java/edu/kit/kastel/vads/compiler/parser/ast/LiteralTree.java new file mode 100644 index 0000000..68dca65 --- /dev/null +++ b/src/main/java/edu/kit/kastel/vads/compiler/parser/ast/LiteralTree.java @@ -0,0 +1,11 @@ +package edu.kit.kastel.vads.compiler.parser.ast; + +import edu.kit.kastel.vads.compiler.Span; +import edu.kit.kastel.vads.compiler.parser.visitor.Visitor; + +public record LiteralTree(long value, Span span) implements ExpressionTree { + @Override + public R accept(Visitor visitor, T data) { + return visitor.visit(this, data); + } +} diff --git a/src/main/java/edu/kit/kastel/vads/compiler/parser/ast/NameTree.java b/src/main/java/edu/kit/kastel/vads/compiler/parser/ast/NameTree.java new file mode 100644 index 0000000..bf45c10 --- /dev/null +++ b/src/main/java/edu/kit/kastel/vads/compiler/parser/ast/NameTree.java @@ -0,0 +1,12 @@ +package edu.kit.kastel.vads.compiler.parser.ast; + +import edu.kit.kastel.vads.compiler.Span; +import edu.kit.kastel.vads.compiler.parser.symbol.Name; +import edu.kit.kastel.vads.compiler.parser.visitor.Visitor; + +public record NameTree(Name name, Span span) implements Tree { + @Override + public R accept(Visitor visitor, T data) { + return visitor.visit(this, data); + } +} diff --git a/src/main/java/edu/kit/kastel/vads/compiler/parser/ast/NegateTree.java b/src/main/java/edu/kit/kastel/vads/compiler/parser/ast/NegateTree.java new file mode 100644 index 0000000..d7d602a --- /dev/null +++ b/src/main/java/edu/kit/kastel/vads/compiler/parser/ast/NegateTree.java @@ -0,0 +1,16 @@ +package edu.kit.kastel.vads.compiler.parser.ast; + +import edu.kit.kastel.vads.compiler.Span; +import edu.kit.kastel.vads.compiler.parser.visitor.Visitor; + +public record NegateTree(ExpressionTree expression, Span minusPos) implements ExpressionTree { + @Override + public Span span() { + return minusPos().merge(expression().span()); + } + + @Override + public R accept(Visitor visitor, T data) { + return visitor.visit(this, data); + } +} diff --git a/src/main/java/edu/kit/kastel/vads/compiler/parser/ast/ProgramTree.java b/src/main/java/edu/kit/kastel/vads/compiler/parser/ast/ProgramTree.java new file mode 100644 index 0000000..eb1f9bc --- /dev/null +++ b/src/main/java/edu/kit/kastel/vads/compiler/parser/ast/ProgramTree.java @@ -0,0 +1,24 @@ +package edu.kit.kastel.vads.compiler.parser.ast; + +import edu.kit.kastel.vads.compiler.Span; +import edu.kit.kastel.vads.compiler.parser.visitor.Visitor; + +import java.util.List; + +public record ProgramTree(List topLevelTrees) implements Tree { + public ProgramTree { + assert !topLevelTrees.isEmpty() : "must be non-empty"; + topLevelTrees = List.copyOf(topLevelTrees); + } + @Override + public Span span() { + var first = topLevelTrees.getFirst(); + var last = topLevelTrees.getLast(); + return new Span.SimpleSpan(first.span().start(), last.span().end()); + } + + @Override + public R accept(Visitor visitor, T data) { + return visitor.visit(this, data); + } +} diff --git a/src/main/java/edu/kit/kastel/vads/compiler/parser/ast/ReturnTree.java b/src/main/java/edu/kit/kastel/vads/compiler/parser/ast/ReturnTree.java new file mode 100644 index 0000000..6d506a0 --- /dev/null +++ b/src/main/java/edu/kit/kastel/vads/compiler/parser/ast/ReturnTree.java @@ -0,0 +1,17 @@ +package edu.kit.kastel.vads.compiler.parser.ast; + +import edu.kit.kastel.vads.compiler.Position; +import edu.kit.kastel.vads.compiler.Span; +import edu.kit.kastel.vads.compiler.parser.visitor.Visitor; + +public record ReturnTree(ExpressionTree expression, Position start) implements StatementTree { + @Override + public Span span() { + return new Span.SimpleSpan(start(), expression().span().end()); + } + + @Override + public R accept(Visitor visitor, T data) { + return visitor.visit(this, data); + } +} diff --git a/src/main/java/edu/kit/kastel/vads/compiler/parser/ast/StatementTree.java b/src/main/java/edu/kit/kastel/vads/compiler/parser/ast/StatementTree.java new file mode 100644 index 0000000..604d985 --- /dev/null +++ b/src/main/java/edu/kit/kastel/vads/compiler/parser/ast/StatementTree.java @@ -0,0 +1,4 @@ +package edu.kit.kastel.vads.compiler.parser.ast; + +public sealed interface StatementTree extends Tree permits AssignmentTree, BlockTree, DeclarationTree, ReturnTree { +} diff --git a/src/main/java/edu/kit/kastel/vads/compiler/parser/ast/Tree.java b/src/main/java/edu/kit/kastel/vads/compiler/parser/ast/Tree.java new file mode 100644 index 0000000..05fde8a --- /dev/null +++ b/src/main/java/edu/kit/kastel/vads/compiler/parser/ast/Tree.java @@ -0,0 +1,11 @@ +package edu.kit.kastel.vads.compiler.parser.ast; + +import edu.kit.kastel.vads.compiler.Span; +import edu.kit.kastel.vads.compiler.parser.visitor.Visitor; + +public sealed interface Tree permits ExpressionTree, FunctionTree, LValueTree, NameTree, ProgramTree, StatementTree, TypeTree { + + Span span(); + + R accept(Visitor visitor, T data); +} diff --git a/src/main/java/edu/kit/kastel/vads/compiler/parser/ast/TypeTree.java b/src/main/java/edu/kit/kastel/vads/compiler/parser/ast/TypeTree.java new file mode 100644 index 0000000..49f8017 --- /dev/null +++ b/src/main/java/edu/kit/kastel/vads/compiler/parser/ast/TypeTree.java @@ -0,0 +1,12 @@ +package edu.kit.kastel.vads.compiler.parser.ast; + +import edu.kit.kastel.vads.compiler.Span; +import edu.kit.kastel.vads.compiler.parser.type.Type; +import edu.kit.kastel.vads.compiler.parser.visitor.Visitor; + +public record TypeTree(Type type, Span span) implements Tree { + @Override + public R accept(Visitor visitor, T data) { + return visitor.visit(this, data); + } +} diff --git a/src/main/java/edu/kit/kastel/vads/compiler/parser/symbol/IdentName.java b/src/main/java/edu/kit/kastel/vads/compiler/parser/symbol/IdentName.java new file mode 100644 index 0000000..07cc94e --- /dev/null +++ b/src/main/java/edu/kit/kastel/vads/compiler/parser/symbol/IdentName.java @@ -0,0 +1,8 @@ +package edu.kit.kastel.vads.compiler.parser.symbol; + +record IdentName(String identifier) implements Name { + @Override + public String asString() { + return identifier(); + } +} diff --git a/src/main/java/edu/kit/kastel/vads/compiler/parser/symbol/KeywordName.java b/src/main/java/edu/kit/kastel/vads/compiler/parser/symbol/KeywordName.java new file mode 100644 index 0000000..4f4d298 --- /dev/null +++ b/src/main/java/edu/kit/kastel/vads/compiler/parser/symbol/KeywordName.java @@ -0,0 +1,10 @@ +package edu.kit.kastel.vads.compiler.parser.symbol; + +import edu.kit.kastel.vads.compiler.lexer.KeywordType; + +record KeywordName(KeywordType type) implements Name { + @Override + public String asString() { + return type().keyword(); + } +} diff --git a/src/main/java/edu/kit/kastel/vads/compiler/parser/symbol/Name.java b/src/main/java/edu/kit/kastel/vads/compiler/parser/symbol/Name.java new file mode 100644 index 0000000..39d8cae --- /dev/null +++ b/src/main/java/edu/kit/kastel/vads/compiler/parser/symbol/Name.java @@ -0,0 +1,17 @@ +package edu.kit.kastel.vads.compiler.parser.symbol; + +import edu.kit.kastel.vads.compiler.lexer.Identifier; +import edu.kit.kastel.vads.compiler.lexer.Keyword; + +public sealed interface Name permits IdentName, KeywordName { + + static Name forKeyword(Keyword keyword) { + return new KeywordName(keyword.type()); + } + + static Name forIdentifier(Identifier identifier) { + return new IdentName(identifier.value()); + } + + String asString(); +} diff --git a/src/main/java/edu/kit/kastel/vads/compiler/parser/type/BasicType.java b/src/main/java/edu/kit/kastel/vads/compiler/parser/type/BasicType.java new file mode 100644 index 0000000..5e93e4a --- /dev/null +++ b/src/main/java/edu/kit/kastel/vads/compiler/parser/type/BasicType.java @@ -0,0 +1,12 @@ +package edu.kit.kastel.vads.compiler.parser.type; + +import java.util.Locale; + +public enum BasicType implements Type { + INT; + + @Override + public String asString() { + return name().toLowerCase(Locale.ROOT); + } +} diff --git a/src/main/java/edu/kit/kastel/vads/compiler/parser/type/Type.java b/src/main/java/edu/kit/kastel/vads/compiler/parser/type/Type.java new file mode 100644 index 0000000..72d914c --- /dev/null +++ b/src/main/java/edu/kit/kastel/vads/compiler/parser/type/Type.java @@ -0,0 +1,5 @@ +package edu.kit.kastel.vads.compiler.parser.type; + +public sealed interface Type permits BasicType { + String asString(); +} diff --git a/src/main/java/edu/kit/kastel/vads/compiler/parser/visitor/NoOpVisitor.java b/src/main/java/edu/kit/kastel/vads/compiler/parser/visitor/NoOpVisitor.java new file mode 100644 index 0000000..1bd9521 --- /dev/null +++ b/src/main/java/edu/kit/kastel/vads/compiler/parser/visitor/NoOpVisitor.java @@ -0,0 +1,85 @@ +package edu.kit.kastel.vads.compiler.parser.visitor; + +import edu.kit.kastel.vads.compiler.parser.ast.AssignmentTree; +import edu.kit.kastel.vads.compiler.parser.ast.BinaryOperationTree; +import edu.kit.kastel.vads.compiler.parser.ast.BlockTree; +import edu.kit.kastel.vads.compiler.parser.ast.DeclarationTree; +import edu.kit.kastel.vads.compiler.parser.ast.FunctionTree; +import edu.kit.kastel.vads.compiler.parser.ast.IdentExpressionTree; +import edu.kit.kastel.vads.compiler.parser.ast.LValueIdentTree; +import edu.kit.kastel.vads.compiler.parser.ast.LiteralTree; +import edu.kit.kastel.vads.compiler.parser.ast.NameTree; +import edu.kit.kastel.vads.compiler.parser.ast.NegateTree; +import edu.kit.kastel.vads.compiler.parser.ast.ProgramTree; +import edu.kit.kastel.vads.compiler.parser.ast.ReturnTree; +import edu.kit.kastel.vads.compiler.parser.ast.TypeTree; + +/// A visitor that does nothing and returns [Unit#INSTANCE] by default. +/// This can be used to implement operations only for specific tree types. +public interface NoOpVisitor extends Visitor { + + @Override + default Unit visit(AssignmentTree assignmentTree, T data) { + return Unit.INSTANCE; + } + + @Override + default Unit visit(BinaryOperationTree binaryOperationTree, T data) { + return Unit.INSTANCE; + } + + @Override + default Unit visit(BlockTree blockTree, T data) { + return Unit.INSTANCE; + } + + @Override + default Unit visit(DeclarationTree declarationTree, T data) { + return Unit.INSTANCE; + } + + @Override + default Unit visit(FunctionTree functionTree, T data) { + return Unit.INSTANCE; + } + + @Override + default Unit visit(IdentExpressionTree identExpressionTree, T data) { + return Unit.INSTANCE; + } + + @Override + default Unit visit(LiteralTree literalTree, T data) { + return Unit.INSTANCE; + } + + @Override + default Unit visit(LValueIdentTree lValueIdentTree, T data) { + return Unit.INSTANCE; + } + + @Override + default Unit visit(NameTree nameTree, T data) { + return Unit.INSTANCE; + } + + @Override + default Unit visit(NegateTree negateTree, T data) { + return Unit.INSTANCE; + } + + @Override + default Unit visit(ProgramTree programTree, T data) { + return Unit.INSTANCE; + } + + @Override + default Unit visit(ReturnTree returnTree, T data) { + return Unit.INSTANCE; + } + + @Override + default Unit visit(TypeTree typeTree, T data) { + return Unit.INSTANCE; + } +} diff --git a/src/main/java/edu/kit/kastel/vads/compiler/parser/visitor/RecursivePostorderVisitor.java b/src/main/java/edu/kit/kastel/vads/compiler/parser/visitor/RecursivePostorderVisitor.java new file mode 100644 index 0000000..5d94125 --- /dev/null +++ b/src/main/java/edu/kit/kastel/vads/compiler/parser/visitor/RecursivePostorderVisitor.java @@ -0,0 +1,134 @@ +package edu.kit.kastel.vads.compiler.parser.visitor; + +import edu.kit.kastel.vads.compiler.parser.ast.AssignmentTree; +import edu.kit.kastel.vads.compiler.parser.ast.BinaryOperationTree; +import edu.kit.kastel.vads.compiler.parser.ast.BlockTree; +import edu.kit.kastel.vads.compiler.parser.ast.DeclarationTree; +import edu.kit.kastel.vads.compiler.parser.ast.FunctionTree; +import edu.kit.kastel.vads.compiler.parser.ast.IdentExpressionTree; +import edu.kit.kastel.vads.compiler.parser.ast.LValueIdentTree; +import edu.kit.kastel.vads.compiler.parser.ast.LiteralTree; +import edu.kit.kastel.vads.compiler.parser.ast.NameTree; +import edu.kit.kastel.vads.compiler.parser.ast.NegateTree; +import edu.kit.kastel.vads.compiler.parser.ast.ProgramTree; +import edu.kit.kastel.vads.compiler.parser.ast.ReturnTree; +import edu.kit.kastel.vads.compiler.parser.ast.StatementTree; +import edu.kit.kastel.vads.compiler.parser.ast.TypeTree; + +/// A visitor that traverses a tree in postorder +/// @param a type for additional data +/// @param a type for a return type +public class RecursivePostorderVisitor implements Visitor { + private final Visitor visitor; + + public RecursivePostorderVisitor(Visitor visitor) { + this.visitor = visitor; + } + + @Override + public R visit(AssignmentTree assignmentTree, T data) { + R r = assignmentTree.lValue().accept(this, data); + r = assignmentTree.expression().accept(this, accumulate(data, r)); + r = this.visitor.visit(assignmentTree, accumulate(data, r)); + return r; + } + + @Override + public R visit(BinaryOperationTree binaryOperationTree, T data) { + R r = binaryOperationTree.lhs().accept(this, data); + r = binaryOperationTree.rhs().accept(this, accumulate(data, r)); + r = this.visitor.visit(binaryOperationTree, accumulate(data, r)); + return r; + } + + @Override + public R visit(BlockTree blockTree, T data) { + R r; + T d = data; + for (StatementTree statement : blockTree.statements()) { + r = statement.accept(this, d); + d = accumulate(d, r); + } + r = this.visitor.visit(blockTree, d); + return r; + } + + @Override + public R visit(DeclarationTree declarationTree, T data) { + R r = declarationTree.type().accept(this, data); + r = declarationTree.name().accept(this, accumulate(data, r)); + if (declarationTree.initializer() != null) { + r = declarationTree.initializer().accept(this, accumulate(data, r)); + } + r = this.visitor.visit(declarationTree, accumulate(data, r)); + return r; + } + + @Override + public R visit(FunctionTree functionTree, T data) { + R r = functionTree.returnType().accept(this, data); + r = functionTree.name().accept(this, accumulate(data, r)); + r = functionTree.body().accept(this, accumulate(data, r)); + r = this.visitor.visit(functionTree, accumulate(data, r)); + return r; + } + + @Override + public R visit(IdentExpressionTree identExpressionTree, T data) { + R r = identExpressionTree.name().accept(this, data); + r = this.visitor.visit(identExpressionTree, accumulate(data, r)); + return r; + } + + @Override + public R visit(LiteralTree literalTree, T data) { + return this.visitor.visit(literalTree, data); + } + + @Override + public R visit(LValueIdentTree lValueIdentTree, T data) { + R r = lValueIdentTree.name().accept(this, data); + r = this.visitor.visit(lValueIdentTree, accumulate(data, r)); + return r; + } + + @Override + public R visit(NameTree nameTree, T data) { + return this.visitor.visit(nameTree, data); + } + + @Override + public R visit(NegateTree negateTree, T data) { + R r = negateTree.expression().accept(this, data); + r = this.visitor.visit(negateTree, accumulate(data, r)); + return r; + } + + @Override + public R visit(ProgramTree programTree, T data) { + R r; + T d = data; + for (FunctionTree tree : programTree.topLevelTrees()) { + r = tree.accept(this, d); + d = accumulate(data, r); + } + r = this.visitor.visit(programTree, d); + return r; + } + + @Override + public R visit(ReturnTree returnTree, T data) { + R r = returnTree.expression().accept(this, data); + r = this.visitor.visit(returnTree, accumulate(data, r)); + return r; + } + + @Override + public R visit(TypeTree typeTree, T data) { + return this.visitor.visit(typeTree, data); + } + + protected T accumulate(T data, R value) { + return data; + } +} diff --git a/src/main/java/edu/kit/kastel/vads/compiler/parser/visitor/Unit.java b/src/main/java/edu/kit/kastel/vads/compiler/parser/visitor/Unit.java new file mode 100644 index 0000000..7df0c60 --- /dev/null +++ b/src/main/java/edu/kit/kastel/vads/compiler/parser/visitor/Unit.java @@ -0,0 +1,5 @@ +package edu.kit.kastel.vads.compiler.parser.visitor; + +public enum Unit { + INSTANCE +} diff --git a/src/main/java/edu/kit/kastel/vads/compiler/parser/visitor/Visitor.java b/src/main/java/edu/kit/kastel/vads/compiler/parser/visitor/Visitor.java new file mode 100644 index 0000000..bbc7208 --- /dev/null +++ b/src/main/java/edu/kit/kastel/vads/compiler/parser/visitor/Visitor.java @@ -0,0 +1,44 @@ +package edu.kit.kastel.vads.compiler.parser.visitor; + +import edu.kit.kastel.vads.compiler.parser.ast.AssignmentTree; +import edu.kit.kastel.vads.compiler.parser.ast.BinaryOperationTree; +import edu.kit.kastel.vads.compiler.parser.ast.BlockTree; +import edu.kit.kastel.vads.compiler.parser.ast.DeclarationTree; +import edu.kit.kastel.vads.compiler.parser.ast.FunctionTree; +import edu.kit.kastel.vads.compiler.parser.ast.IdentExpressionTree; +import edu.kit.kastel.vads.compiler.parser.ast.LValueIdentTree; +import edu.kit.kastel.vads.compiler.parser.ast.LiteralTree; +import edu.kit.kastel.vads.compiler.parser.ast.NameTree; +import edu.kit.kastel.vads.compiler.parser.ast.NegateTree; +import edu.kit.kastel.vads.compiler.parser.ast.ProgramTree; +import edu.kit.kastel.vads.compiler.parser.ast.ReturnTree; +import edu.kit.kastel.vads.compiler.parser.ast.TypeTree; + +public interface Visitor { + + R visit(AssignmentTree assignmentTree, T data); + + R visit(BinaryOperationTree binaryOperationTree, T data); + + R visit(BlockTree blockTree, T data); + + R visit(DeclarationTree declarationTree, T data); + + R visit(FunctionTree functionTree, T data); + + R visit(IdentExpressionTree identExpressionTree, T data); + + R visit(LiteralTree literalTree, T data); + + R visit(LValueIdentTree lValueIdentTree, T data); + + R visit(NameTree nameTree, T data); + + R visit(NegateTree negateTree, T data); + + R visit(ProgramTree programTree, T data); + + R visit(ReturnTree returnTree, T data); + + R visit(TypeTree typeTree, T data); +} diff --git a/src/main/java/edu/kit/kastel/vads/compiler/semantic/Namespace.java b/src/main/java/edu/kit/kastel/vads/compiler/semantic/Namespace.java new file mode 100644 index 0000000..d96baa8 --- /dev/null +++ b/src/main/java/edu/kit/kastel/vads/compiler/semantic/Namespace.java @@ -0,0 +1,26 @@ +package edu.kit.kastel.vads.compiler.semantic; + +import edu.kit.kastel.vads.compiler.parser.ast.NameTree; +import edu.kit.kastel.vads.compiler.parser.symbol.Name; +import org.jspecify.annotations.Nullable; + +import java.util.HashMap; +import java.util.Map; +import java.util.function.BinaryOperator; + +public class Namespace { + + private final Map content; + + public Namespace() { + this.content = new HashMap<>(); + } + + public void put(NameTree name, T value, BinaryOperator merger) { + this.content.merge(name.name(), value, merger); + } + + public @Nullable T get(NameTree name) { + return this.content.get(name.name()); + } +} diff --git a/src/main/java/edu/kit/kastel/vads/compiler/semantic/ReturnAnalysis.java b/src/main/java/edu/kit/kastel/vads/compiler/semantic/ReturnAnalysis.java new file mode 100644 index 0000000..41b0161 --- /dev/null +++ b/src/main/java/edu/kit/kastel/vads/compiler/semantic/ReturnAnalysis.java @@ -0,0 +1,30 @@ +package edu.kit.kastel.vads.compiler.semantic; + +import edu.kit.kastel.vads.compiler.parser.ast.FunctionTree; +import edu.kit.kastel.vads.compiler.parser.ast.ReturnTree; +import edu.kit.kastel.vads.compiler.parser.visitor.NoOpVisitor; +import edu.kit.kastel.vads.compiler.parser.visitor.Unit; + +/// Checks that functions return. +/// Currently only works for straight-line code. +class ReturnAnalysis implements NoOpVisitor { + + static class ReturnState { + boolean returns = false; + } + + @Override + public Unit visit(ReturnTree returnTree, ReturnState data) { + data.returns = true; + return NoOpVisitor.super.visit(returnTree, data); + } + + @Override + public Unit visit(FunctionTree functionTree, ReturnState data) { + if (!data.returns) { + throw new SemanticException("function " + functionTree.name() + " does not return"); + } + data.returns = false; + return NoOpVisitor.super.visit(functionTree, data); + } +} diff --git a/src/main/java/edu/kit/kastel/vads/compiler/semantic/SemanticAnalysis.java b/src/main/java/edu/kit/kastel/vads/compiler/semantic/SemanticAnalysis.java new file mode 100644 index 0000000..d4f243d --- /dev/null +++ b/src/main/java/edu/kit/kastel/vads/compiler/semantic/SemanticAnalysis.java @@ -0,0 +1,19 @@ +package edu.kit.kastel.vads.compiler.semantic; + +import edu.kit.kastel.vads.compiler.parser.ast.ProgramTree; +import edu.kit.kastel.vads.compiler.parser.visitor.RecursivePostorderVisitor; + +public class SemanticAnalysis { + + private final ProgramTree program; + + public SemanticAnalysis(ProgramTree program) { + this.program = program; + } + + public void analyze() { + this.program.accept(new RecursivePostorderVisitor<>(new VariableStatusAnalysis()), new Namespace<>()); + this.program.accept(new RecursivePostorderVisitor<>(new ReturnAnalysis()), new ReturnAnalysis.ReturnState()); + } + +} diff --git a/src/main/java/edu/kit/kastel/vads/compiler/semantic/SemanticException.java b/src/main/java/edu/kit/kastel/vads/compiler/semantic/SemanticException.java new file mode 100644 index 0000000..eb26650 --- /dev/null +++ b/src/main/java/edu/kit/kastel/vads/compiler/semantic/SemanticException.java @@ -0,0 +1,7 @@ +package edu.kit.kastel.vads.compiler.semantic; + +public class SemanticException extends RuntimeException { + public SemanticException(String message) { + super(message); + } +} diff --git a/src/main/java/edu/kit/kastel/vads/compiler/semantic/VariableStatusAnalysis.java b/src/main/java/edu/kit/kastel/vads/compiler/semantic/VariableStatusAnalysis.java new file mode 100644 index 0000000..e8a8ba5 --- /dev/null +++ b/src/main/java/edu/kit/kastel/vads/compiler/semantic/VariableStatusAnalysis.java @@ -0,0 +1,68 @@ +package edu.kit.kastel.vads.compiler.semantic; + +import edu.kit.kastel.vads.compiler.parser.ast.AssignmentTree; +import edu.kit.kastel.vads.compiler.parser.ast.DeclarationTree; +import edu.kit.kastel.vads.compiler.parser.ast.IdentExpressionTree; +import edu.kit.kastel.vads.compiler.parser.ast.LValueIdentTree; +import edu.kit.kastel.vads.compiler.parser.ast.NameTree; +import edu.kit.kastel.vads.compiler.parser.visitor.NoOpVisitor; +import edu.kit.kastel.vads.compiler.parser.visitor.Unit; +import org.jspecify.annotations.Nullable; + +import java.util.Locale; + +/// Checks that variables are +/// - declared before assignment +/// - not declared twice +/// - not initialized twice +/// - assigned before referenced +class VariableStatusAnalysis implements NoOpVisitor> { + + @Override + public Unit visit(AssignmentTree assignmentTree, Namespace data) { + switch (assignmentTree.lValue()) { + case LValueIdentTree(var name) -> { + VariableStatus status = data.get(name); + checkInitialized(name, status); + } + } + return NoOpVisitor.super.visit(assignmentTree, data); + } + + private static void checkInitialized(NameTree name, @Nullable VariableStatus status) { + if (status == null) { + throw new SemanticException("Variable " + name + " must be declared before assignment"); + } + } + + @Override + public Unit visit(DeclarationTree declarationTree, Namespace data) { + VariableStatus status = declarationTree.initializer() == null + ? VariableStatus.DECLARED + : VariableStatus.INITIALIZED; + data.put(declarationTree.name(), status, (existing, replacement) -> { + if (existing.ordinal() >= replacement.ordinal()) { + throw new SemanticException("variable is already " + existing + ". Cannot be " + replacement + " here."); + } + return replacement; + }); + return NoOpVisitor.super.visit(declarationTree, data); + } + + @Override + public Unit visit(IdentExpressionTree identExpressionTree, Namespace data) { + VariableStatus status = data.get(identExpressionTree.name()); + checkInitialized(identExpressionTree.name(), status); + return NoOpVisitor.super.visit(identExpressionTree, data); + } + + enum VariableStatus { + DECLARED, + INITIALIZED; + + @Override + public String toString() { + return name().toLowerCase(Locale.ROOT); + } + } +} diff --git a/src/main/java/module-info.java b/src/main/java/module-info.java new file mode 100644 index 0000000..8553864 --- /dev/null +++ b/src/main/java/module-info.java @@ -0,0 +1,7 @@ +import org.jspecify.annotations.NullMarked; + +@NullMarked +module edu.kit.kastel.vads.compiler { + requires org.jspecify; + requires java.xml; +} \ No newline at end of file