Compare commits
45 Commits
code-gener
...
f673612f54
Author | SHA1 | Date | |
---|---|---|---|
f673612f54 | |||
|
9760e39a29 | ||
|
93e17e5415 | ||
|
b151edc2fd | ||
|
c0d8ab8399 | ||
|
f50bb7efd7 | ||
|
51a390752b | ||
|
3114064038 | ||
|
745db43b34 | ||
|
e0286e0840 | ||
|
ebef717141 | ||
|
3de54afa93 | ||
|
30d3cfa44a | ||
efa1a21655 | |||
3fb11e5d7e | |||
|
c6e61defce | ||
|
dbde4e8047 | ||
5a12d61623 | |||
f5bccab651 | |||
0de5c3e993 | |||
3628a0a4d8 | |||
36f0683240 | |||
|
97aadb9ba8 | ||
|
e5dcbb8f99 | ||
e96f30fe19 | |||
64b15af6ef | |||
4ff6854094 | |||
0a9cc7655a | |||
7e66b5b8e3 | |||
d835a98e6f | |||
240913d422 | |||
4bee432294 | |||
0cf4715782 | |||
|
3c0f7e857a | ||
|
2b7e0d0d42 | ||
|
bd61a0e595 | ||
|
24407a5c1c | ||
195440e9d9 | |||
6fa57cf319 | |||
1de6add080 | |||
c315966219 | |||
c2c4974c76 | |||
|
85e0cf3807 | ||
|
6f3fb02666 | ||
|
435697053a |
6
.gitignore
vendored
6
.gitignore
vendored
@@ -77,10 +77,10 @@ fabric.properties
|
|||||||
.idea/caches/build_file_checksums.ser
|
.idea/caches/build_file_checksums.ser
|
||||||
|
|
||||||
/target
|
/target
|
||||||
src/main/resources/logs/RaupenLog.log
|
src/main/resources/logs/miniCompilerLog.log
|
||||||
src/main/resources/output/CompilerInput.class
|
src/main/resources/output/CompilerInput.class
|
||||||
src/test/resources/output/javac/CompilerInput$Test.class
|
src/test/resources/output/javac/CompilerInput$Test.class
|
||||||
src/test/resources/output/javac/CompilerInput.class
|
src/test/resources/output/javac/CompilerInput.class
|
||||||
src/test/resources/output/raupenpiler/CompilerInput.class
|
src/test/resources/output/miniCompiler/CompilerInput.class
|
||||||
src/test/resources/output/raupenpiler/CompilerInput$Test.class
|
src/test/resources/output/miniCompiler/CompilerInput$Test.class
|
||||||
.idea/inspectionProfiles/Project_Default.xml
|
.idea/inspectionProfiles/Project_Default.xml
|
||||||
|
37
Makefile
Normal file
37
Makefile
Normal file
@@ -0,0 +1,37 @@
|
|||||||
|
### IntelliJs play buttons do not work. Run in "src/test" folder with "make" command to run all
|
||||||
|
### Or run only parts with "make compile-javac", "make clean" etc.
|
||||||
|
|
||||||
|
all: compile-javac compile-miniCompiler
|
||||||
|
|
||||||
|
compile-javac:
|
||||||
|
#javac -d src/test/resources/output/javac src/test/resources/input/CompilerInput.java
|
||||||
|
|
||||||
|
compile-miniCompiler:
|
||||||
|
cd ../.. ; mvn -DskipTests install
|
||||||
|
cd ../.. ; mvn exec:java -DgenJar=true -DgenClass=true -Dexec.mainClass="main.Main" -Dexec.args="'src/main/resources/input/CompilerInput.java' 'src/main/resources/output'"
|
||||||
|
# cp src/main/resources/output/CompilerInput.class src/test/resources/output/miniCompiler
|
||||||
|
|
||||||
|
test-miniCompiler:
|
||||||
|
# move the compiled class to the test/main folder
|
||||||
|
mv src/main/resources/output/CompilerInput.class src/test/java/main/
|
||||||
|
# compile the test class
|
||||||
|
javac src/test/java/main/EndToEndTester.java
|
||||||
|
# run the test class
|
||||||
|
java -cp src/test/java/main EndToEndTester
|
||||||
|
|
||||||
|
clean:
|
||||||
|
# clean main output folders
|
||||||
|
rm -f src/main/resources/output/*.class
|
||||||
|
rm -f src/main/resources/output/*.jar
|
||||||
|
# clean resources output folders
|
||||||
|
rm -f src/test/resources/output/javac/*.class
|
||||||
|
rm -f src/test/resources/output/miniCompiler/*.class
|
||||||
|
rm -f src/test/resources/output/miniCompiler/*.jar
|
||||||
|
# clean logs
|
||||||
|
rm -f src/main/resources/logs/*
|
||||||
|
# clean test/java/main folders from .class files for End-to-End tests
|
||||||
|
rm -f src/test/java/main/*.class
|
||||||
|
# clean javac output from every folder
|
||||||
|
rm -f src/test/resources/input/*/*.class
|
||||||
|
# clean test results from maven surefire plugin
|
||||||
|
rm -f ../../target/surefire-reports/*.txt
|
BIN
Parser_Dokumentation.pdf
Normal file
BIN
Parser_Dokumentation.pdf
Normal file
Binary file not shown.
133
README.md
Normal file
133
README.md
Normal file
@@ -0,0 +1,133 @@
|
|||||||
|
# "Nicht Haskel 2.0" Java Compiler
|
||||||
|
|
||||||
|
Realisation of a subset of the Java Standard Compiler in the course Compiler Construction of the 4th semester Computer Science at the Duale Hochschule Stuttgart (Horb).
|
||||||
|
|
||||||
|
This project aims to provide a simplified version of the Java compiler, focusing on key language features and demonstrating the principles of compiler construction.
|
||||||
|
|
||||||
|
## Realised Java syntax
|
||||||
|
|
||||||
|
- **Data types**: `int`, `boolean`, `char`
|
||||||
|
- **Access modifier**: `public`, `protected`, `private`
|
||||||
|
- **Operators**: `=` `+` `-` `*` `%` `/` `>` `<` `>=` `<=` `==` `!=` `!` `&&` `||` `++` `--`
|
||||||
|
- **Keywords**: `class`, `this`, `while`, `do`, `if`, `else`, `for`, `return`, `new`, `switch`, `case`, `break`, `default`, `:`
|
||||||
|
- **Statements**:
|
||||||
|
- `if` ... `if else` ... `else`;
|
||||||
|
- `while` ... ;
|
||||||
|
- `do` ... `while`;
|
||||||
|
- `for`;
|
||||||
|
- **Comments**:
|
||||||
|
- Single line: `// comment`
|
||||||
|
- Multi-line: `/* comment */`
|
||||||
|
- **Further functions**:
|
||||||
|
- All methods are overloadable
|
||||||
|
- High maintainability and expandability through implementation of the visitor pattern
|
||||||
|
- Logging Input and Outputs
|
||||||
|
- Error Handling in the Semantic Check
|
||||||
|
|
||||||
|
## Project Structure
|
||||||
|
|
||||||
|
```plain
|
||||||
|
src/
|
||||||
|
└── main/
|
||||||
|
├── java/
|
||||||
|
│ ├── ast/ -> Defining the structure of the AST
|
||||||
|
│ ├── bytecode/ -> Generate Java bytecode
|
||||||
|
│ ├── main/ -> Running the compiler
|
||||||
|
│ ├── parser/
|
||||||
|
│ │ ├── astBuilder/ -> Builder creating the AST
|
||||||
|
│ │ ├── generated/ -> Antlr generated grammar
|
||||||
|
│ │ └── grammar/ -> Antlr grammar
|
||||||
|
│ ├── semantic/ -> Running the semantic check
|
||||||
|
│ └── visitor/ -> Visitor interface
|
||||||
|
└── resources/
|
||||||
|
test/
|
||||||
|
└── java/
|
||||||
|
│ ├── main/ -> Running E2E tests
|
||||||
|
│ ├── parser/ -> Performs tests on the parser
|
||||||
|
│ ├── semantic/ -> Performs tests on the semantic check
|
||||||
|
└── resources/ -> Ressources for running the Tests
|
||||||
|
```
|
||||||
|
|
||||||
|
## Class-Diagramm AST
|
||||||
|
|
||||||
|

|
||||||
|
|
||||||
|
## Distribution of the realisation
|
||||||
|
|
||||||
|
### i22030 & i22035
|
||||||
|
Ausführliche Beschreibung der Parser Umsetzung: 
|
||||||
|
Parser:
|
||||||
|
- Grammar -> (src/main/java/parser/grammar)
|
||||||
|
- Scanner
|
||||||
|
- Parser
|
||||||
|
- Abstract Syntax Tree (AST) -> (src/main/java/ast)
|
||||||
|
- AstBuilder -> (src/main/java/parser/astBuilder)
|
||||||
|
|
||||||
|
Parser tests:
|
||||||
|
- ParserTests -> (src/test/java/parser)
|
||||||
|
- TestCases -> (src/test/resources/input/singeFeatureTests)
|
||||||
|
|
||||||
|
Other:
|
||||||
|
- Documentation -> (README.md)
|
||||||
|
- Ast Class-Diagramm -> (ast.png)
|
||||||
|
- PowerPoint
|
||||||
|
|
||||||
|
### i22005
|
||||||
|
Semantic check:
|
||||||
|
- Set all types and check whether types have been used correctly
|
||||||
|
- Contexts -> (src/main/java/semantic/context)
|
||||||
|
- Exceptions Handling -> (src/main/java/semantic/exceptions)
|
||||||
|
|
||||||
|
Semantic Tests:
|
||||||
|
- Typing and Type checking -> (src/test/java/semantic/EndToTypedAstTest)
|
||||||
|
- Exception and feature test -> (src/test/resources/input/typedAstExceptionsTests)
|
||||||
|
|
||||||
|
### i22007
|
||||||
|
Bytecode generation:
|
||||||
|
- Complete bytecode generation -> (src/mein/java/bytecode)
|
||||||
|
|
||||||
|
### i22011
|
||||||
|
Tests and execution:
|
||||||
|
- Makefile
|
||||||
|
- Running Compiler -> (src/main/main)
|
||||||
|
- Running E2E tests -> (src/test/main)
|
||||||
|
- Typing and Type checking -> (src/test/java/semantic/EndToTypedAstTest)
|
||||||
|
|
||||||
|
|
||||||
|
## Used Tools
|
||||||
|
|
||||||
|
- [Maven 4.0](https://maven.apache.org/index.html)
|
||||||
|
- Used for automating the build process and managing dependencies.
|
||||||
|
- [ANTLR4 v.13.1](https://www.antlr.org/)
|
||||||
|
- Used to parse the input Java code into the Abstract Syntax Tree.
|
||||||
|
|
||||||
|
## How to run the compiler
|
||||||
|
### Possibilities
|
||||||
|
### 1. Start miniCompiler using make:
|
||||||
|
Make needs to be installed
|
||||||
|
```bash
|
||||||
|
cd .\src\test\ ; make clean compile-miniCompiler
|
||||||
|
```
|
||||||
|
|
||||||
|
### 2. Start miniCompiler using jar:
|
||||||
|
If you do not have the .jar, download it [here](https://gitea.hb.dhbw-stuttgart.de/i22005/NichtHaskell2.0/src/branch/Endabgabe/src) or compile it using mvn package or make first
|
||||||
|
```
|
||||||
|
java.exe -DgenJar=bool -DgenClass=bool -jar path_to_jar\jarName.jar 'path_to_input_file.java' 'path_to_output_directory'
|
||||||
|
```
|
||||||
|
|
||||||
|
Example (jar needs to be in the target directory)
|
||||||
|
```bash
|
||||||
|
java.exe -DgenJar=true -DgenClass=true -jar .\target\JavaCompiler-1.0-jar-with-dependencies.jar 'src/main/resources/input/CompilerInput.java' 'src/main/resources/output'
|
||||||
|
```
|
||||||
|
|
||||||
|
- set DgenJar true, to generate the jar, false for no jar
|
||||||
|
|
||||||
|
```
|
||||||
|
DgenJar=true
|
||||||
|
```
|
||||||
|
|
||||||
|
- set DgenClass true, to generate class files, false for no class files
|
||||||
|
|
||||||
|
```
|
||||||
|
DgenClass=true
|
||||||
|
```
|
68
readme.md
68
readme.md
@@ -1,68 +0,0 @@
|
|||||||
# "Nicht Haskel 2.0" Java Compiler
|
|
||||||
|
|
||||||
Realisation of a subset of the Java Standard Compiler in the course Compiler Construction of the 4th semester Computer Science at the Duale Hochschule Suttgart (Horb).
|
|
||||||
|
|
||||||
This project aims to provide a simplified version of the Java compiler, focusing on key language features and demonstrating the principles of compiler construction.
|
|
||||||
|
|
||||||
## Realised Java syntax
|
|
||||||
|
|
||||||
- **Data types**: `int`, `boolean`, `char`
|
|
||||||
- **Access modifier**: `public`, `protected`, `private`
|
|
||||||
- **Operators**: `=` `+` `-` `*` `%` `/` `>` `<` `>=` `<=` `==` `!=` `!` `&&` `||` `++` `--`
|
|
||||||
- **Keywords**: `class`, `this`, `while`, `do`, `if`, `else`, `for`, `return`, `new`, `switch`, `case`, `break`, `default`, `:`
|
|
||||||
- **Statements**:
|
|
||||||
- `if` ... `if else` ... `else`;
|
|
||||||
- `while` ... ;
|
|
||||||
- `do` ... `while`;
|
|
||||||
- `for`;
|
|
||||||
- `switch` ... `case` ... ;
|
|
||||||
- **Comments**:
|
|
||||||
- Single line: `// comment`
|
|
||||||
- Multi-line: `/* comment */`
|
|
||||||
- **Further functions**:
|
|
||||||
- All methods are overloadable
|
|
||||||
- High maintainability and expandability through implementation of the visitor pattern
|
|
||||||
- Logging Input and Outputs
|
|
||||||
- Error Handling in the Semantic Check
|
|
||||||
|
|
||||||
## Project Structure
|
|
||||||
|
|
||||||
```plain
|
|
||||||
src/
|
|
||||||
└── main/
|
|
||||||
├── java/
|
|
||||||
│ ├── ast/ -> Defining the structure of the AST
|
|
||||||
│ ├── bytecode/ -> Generate Java bytecode
|
|
||||||
│ ├── main/ -> Running the compiler
|
|
||||||
│ ├── parser/
|
|
||||||
│ │ ├── astBuilder/ -> Builder creating the AST
|
|
||||||
│ │ ├── generated/ -> Antlr generated grammar
|
|
||||||
│ │ └── grammar/ -> Antlr grammar
|
|
||||||
│ ├── semantic/ -> Running the semantic check
|
|
||||||
│ └── visitor/ -> Visitor interface
|
|
||||||
└── resources/
|
|
||||||
test/
|
|
||||||
└── java/
|
|
||||||
│ ├── main/ -> MainTest, E2ETests, UtilityTests
|
|
||||||
│ ├── parser/ -> Performs tests on the parser
|
|
||||||
│ └── semantic/ -> Performs tests on the semantic check
|
|
||||||
└── resources/ -> Ressources for running the Tests
|
|
||||||
```
|
|
||||||
|
|
||||||
## Class-Diagramm AST
|
|
||||||
|
|
||||||

|
|
||||||
|
|
||||||
## Used Tools
|
|
||||||
|
|
||||||
- [Maven 4.0](https://maven.apache.org/index.html)
|
|
||||||
- Used for automating the build process and managing dependencies.
|
|
||||||
- [ANTLR4 v.13.1](https://www.antlr.org/)
|
|
||||||
- Used to parse the input Java code into the Abstract Syntax Tree.
|
|
||||||
|
|
||||||
|
|
||||||
## How to run the compiler
|
|
||||||
|
|
||||||
## Download
|
|
||||||
|
|
||||||
```bash
|
|
@@ -1,20 +1,6 @@
|
|||||||
package ast;
|
package ast;
|
||||||
|
|
||||||
import bytecode.visitor.ClassVisitor;
|
|
||||||
import semantic.SemanticVisitor;
|
|
||||||
import typechecker.TypeCheckResult;
|
|
||||||
|
|
||||||
public interface ASTNode {
|
public interface ASTNode {
|
||||||
|
|
||||||
//Todo: @BruderJohn & @i22007 Interface anwenden + geeignetetn Methodename.
|
|
||||||
|
|
||||||
/*
|
|
||||||
Typecheck:
|
|
||||||
public TypeCheckResult acceptType(SemanticVisitor visitor);
|
|
||||||
|
|
||||||
Bytecode:
|
|
||||||
public void accepByteCode(ClassVisitor classVisitor);
|
|
||||||
*/
|
|
||||||
}
|
}
|
||||||
|
|
||||||
|
|
||||||
|
@@ -1,12 +1,11 @@
|
|||||||
package ast;
|
package ast;
|
||||||
|
|
||||||
import ast.type.AccessModifierNode;
|
import ast.type.AccessModifierNode;
|
||||||
import ast.members.ConstructorNode;
|
|
||||||
import ast.members.MemberNode;
|
import ast.members.MemberNode;
|
||||||
import ast.members.MethodNode;
|
import ast.members.MethodNode;
|
||||||
import bytecode.visitor.ClassVisitor;
|
import bytecode.visitor.ClassVisitor;
|
||||||
import semantic.SemanticVisitor;
|
import semantic.SemanticVisitor;
|
||||||
import typechecker.TypeCheckResult;
|
import semantic.TypeCheckResult;
|
||||||
import visitor.Visitable;
|
import visitor.Visitable;
|
||||||
|
|
||||||
import java.util.ArrayList;
|
import java.util.ArrayList;
|
||||||
@@ -17,11 +16,11 @@ public class ClassNode implements ASTNode, Visitable {
|
|||||||
public String identifier;
|
public String identifier;
|
||||||
public List<MemberNode> members = new ArrayList<>();
|
public List<MemberNode> members = new ArrayList<>();
|
||||||
|
|
||||||
public ClassNode(){
|
public ClassNode() {
|
||||||
|
|
||||||
}
|
}
|
||||||
|
|
||||||
public ClassNode(String accessType, String identifier){
|
public ClassNode(String accessType, String identifier) {
|
||||||
this.accessType = new AccessModifierNode(accessType);
|
this.accessType = new AccessModifierNode(accessType);
|
||||||
this.identifier = identifier;
|
this.identifier = identifier;
|
||||||
}
|
}
|
||||||
@@ -30,7 +29,7 @@ public class ClassNode implements ASTNode, Visitable {
|
|||||||
members.add(member);
|
members.add(member);
|
||||||
}
|
}
|
||||||
|
|
||||||
public List<MethodNode> getMethods(){
|
public List<MethodNode> getMethods() {
|
||||||
List<MethodNode> methods = new ArrayList<>();
|
List<MethodNode> methods = new ArrayList<>();
|
||||||
for (MemberNode member : members) {
|
for (MemberNode member : members) {
|
||||||
if (member instanceof MethodNode methodNode) {
|
if (member instanceof MethodNode methodNode) {
|
||||||
|
@@ -2,7 +2,7 @@ package ast;
|
|||||||
|
|
||||||
import bytecode.visitor.ProgramVisitor;
|
import bytecode.visitor.ProgramVisitor;
|
||||||
import semantic.SemanticVisitor;
|
import semantic.SemanticVisitor;
|
||||||
import typechecker.TypeCheckResult;
|
import semantic.TypeCheckResult;
|
||||||
import visitor.Visitable;
|
import visitor.Visitable;
|
||||||
|
|
||||||
import java.util.ArrayList;
|
import java.util.ArrayList;
|
||||||
|
@@ -4,12 +4,12 @@ import ast.expressions.IExpressionNode;
|
|||||||
import ast.type.type.*;
|
import ast.type.type.*;
|
||||||
import bytecode.visitor.MethodVisitor;
|
import bytecode.visitor.MethodVisitor;
|
||||||
import semantic.SemanticVisitor;
|
import semantic.SemanticVisitor;
|
||||||
import typechecker.TypeCheckResult;
|
import semantic.TypeCheckResult;
|
||||||
import visitor.Visitable;
|
import visitor.Visitable;
|
||||||
|
|
||||||
public class BinaryNode implements IExpressionNode, Visitable {
|
public class BinaryNode implements IExpressionNode, Visitable {
|
||||||
|
|
||||||
private ITypeNode typeNode;
|
public ITypeNode typeNode;
|
||||||
|
|
||||||
@Override
|
@Override
|
||||||
public TypeCheckResult accept(SemanticVisitor visitor) {
|
public TypeCheckResult accept(SemanticVisitor visitor) {
|
||||||
|
@@ -1,9 +1,8 @@
|
|||||||
package ast.expressions.binaryexpressions;
|
package ast.expressions.binaryexpressions;
|
||||||
|
|
||||||
import ast.type.type.*;
|
|
||||||
import bytecode.visitor.MethodVisitor;
|
import bytecode.visitor.MethodVisitor;
|
||||||
import semantic.SemanticVisitor;
|
import semantic.SemanticVisitor;
|
||||||
import typechecker.TypeCheckResult;
|
import semantic.TypeCheckResult;
|
||||||
|
|
||||||
public class CalculationNode extends BinaryNode {
|
public class CalculationNode extends BinaryNode {
|
||||||
public CalculationNode calculationExpression;
|
public CalculationNode calculationExpression;
|
||||||
@@ -20,11 +19,11 @@ public class CalculationNode extends BinaryNode {
|
|||||||
this.dotExpression = dotExpression;
|
this.dotExpression = dotExpression;
|
||||||
}
|
}
|
||||||
|
|
||||||
private void setOperator(String operator) {
|
public void setOperator(String operator) {
|
||||||
if(operator != null) {
|
if (operator != null) {
|
||||||
if(operator.equals("+")) {
|
if (operator.equals("+")) {
|
||||||
this.operator = EnumLineOperator.PLUS;
|
this.operator = EnumLineOperator.PLUS;
|
||||||
} else if(operator.equals("-")) {
|
} else if (operator.equals("-")) {
|
||||||
this.operator = EnumLineOperator.MINUS;
|
this.operator = EnumLineOperator.MINUS;
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
@@ -2,30 +2,28 @@ package ast.expressions.binaryexpressions;
|
|||||||
|
|
||||||
import bytecode.visitor.MethodVisitor;
|
import bytecode.visitor.MethodVisitor;
|
||||||
import semantic.SemanticVisitor;
|
import semantic.SemanticVisitor;
|
||||||
import typechecker.TypeCheckResult;
|
import semantic.TypeCheckResult;
|
||||||
|
|
||||||
public class DotNode extends BinaryNode {
|
public class DotNode extends BinaryNode {
|
||||||
public DotNode dotExpression;
|
public DotNode dotExpression;
|
||||||
public EnumDotOperator operator;
|
public EnumDotOperator operator;
|
||||||
public DotSubstractionNode dotSubstractionExpression;
|
public DotSubtractionNode dotSubtractionExpression;
|
||||||
|
|
||||||
public DotNode(DotNode dotExpression, String operator, DotSubstractionNode dotSubstractionExpression) {
|
public DotNode(DotNode dotExpression, String operator, DotSubtractionNode dotSubtractionExpression) {
|
||||||
this.dotExpression = dotExpression;
|
this.dotExpression = dotExpression;
|
||||||
setOperator(operator);
|
setOperator(operator);
|
||||||
this.dotSubstractionExpression = dotSubstractionExpression;
|
this.dotSubtractionExpression = dotSubtractionExpression;
|
||||||
}
|
}
|
||||||
|
|
||||||
public DotNode(DotSubstractionNode dotSubstractionExpression) {
|
public DotNode(DotSubtractionNode dotSubtractionExpression) {
|
||||||
this.dotSubstractionExpression = dotSubstractionExpression;
|
this.dotSubtractionExpression = dotSubtractionExpression;
|
||||||
}
|
}
|
||||||
|
|
||||||
private void setOperator(String operator) {
|
public void setOperator(String operator) {
|
||||||
if(operator.equals("*")) {
|
switch (operator) {
|
||||||
this.operator = EnumDotOperator.MULT;
|
case "*" -> this.operator = EnumDotOperator.MULT;
|
||||||
} else if(operator.equals("/")) {
|
case "/" -> this.operator = EnumDotOperator.DIV;
|
||||||
this.operator = EnumDotOperator.DIV;
|
case "%" -> this.operator = EnumDotOperator.MOD;
|
||||||
} else if(operator.equals("%")) {
|
|
||||||
this.operator = EnumDotOperator.MOD;
|
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
@@ -1,45 +1,44 @@
|
|||||||
package ast.expressions.binaryexpressions;
|
package ast.expressions.binaryexpressions;
|
||||||
|
|
||||||
import ast.expressions.unaryexpressions.MemberAccessNode;
|
import ast.expressions.unaryexpressions.MemberAccessNode;
|
||||||
import ast.statementexpressions.methodcallstatementnexpressions.MethodCallNode;
|
import ast.statementexpressions.methodcallstatementnexpressions.MethodCallNode;
|
||||||
import ast.type.type.*;
|
import ast.type.ValueNode;
|
||||||
import ast.type.ValueNode;
|
import bytecode.visitor.MethodVisitor;
|
||||||
import bytecode.visitor.MethodVisitor;
|
import semantic.SemanticVisitor;
|
||||||
import semantic.SemanticVisitor;
|
import semantic.TypeCheckResult;
|
||||||
import typechecker.TypeCheckResult;
|
|
||||||
|
public class DotSubtractionNode extends BinaryNode {
|
||||||
public class DotSubstractionNode extends BinaryNode {
|
public ValueNode value;
|
||||||
public ValueNode value;
|
public String identifier;
|
||||||
public String identifier;
|
public MemberAccessNode memberAccess;
|
||||||
public MemberAccessNode memberAccess;
|
public MethodCallNode methodCall;
|
||||||
public MethodCallNode methodCall;
|
public CalculationNode calculationExpression;
|
||||||
public CalculationNode calculationExpression;
|
|
||||||
|
public DotSubtractionNode(ValueNode value) {
|
||||||
public DotSubstractionNode(ValueNode value) {
|
this.value = value;
|
||||||
this.value = value;
|
}
|
||||||
}
|
|
||||||
|
public DotSubtractionNode(String identifier) {
|
||||||
public DotSubstractionNode(String identifier) {
|
this.identifier = identifier;
|
||||||
this.identifier = identifier;
|
}
|
||||||
}
|
|
||||||
|
public DotSubtractionNode(MemberAccessNode memberAccess) {
|
||||||
public DotSubstractionNode(MemberAccessNode memberAccess) {
|
this.memberAccess = memberAccess;
|
||||||
this.memberAccess = memberAccess;
|
}
|
||||||
}
|
|
||||||
|
public DotSubtractionNode(MethodCallNode methodCall, CalculationNode calculationExpression) {
|
||||||
public DotSubstractionNode(MethodCallNode methodCall, CalculationNode calculationExpression) {
|
this.methodCall = methodCall;
|
||||||
this.methodCall = methodCall;
|
this.calculationExpression = calculationExpression;
|
||||||
this.calculationExpression = calculationExpression;
|
}
|
||||||
}
|
|
||||||
|
@Override
|
||||||
@Override
|
public TypeCheckResult accept(SemanticVisitor visitor) {
|
||||||
public TypeCheckResult accept(SemanticVisitor visitor) {
|
return visitor.analyze(this);
|
||||||
return visitor.analyze(this);
|
}
|
||||||
}
|
|
||||||
|
@Override
|
||||||
@Override
|
public void accept(MethodVisitor methodVisitor) {
|
||||||
public void accept(MethodVisitor methodVisitor) {
|
methodVisitor.visit(this);
|
||||||
methodVisitor.visit(this);
|
}
|
||||||
}
|
|
||||||
|
}
|
||||||
}
|
|
@@ -2,10 +2,9 @@ package ast.expressions.binaryexpressions;
|
|||||||
|
|
||||||
import ast.expressions.IExpressionNode;
|
import ast.expressions.IExpressionNode;
|
||||||
import ast.expressions.unaryexpressions.UnaryNode;
|
import ast.expressions.unaryexpressions.UnaryNode;
|
||||||
import ast.type.type.*;
|
|
||||||
import bytecode.visitor.MethodVisitor;
|
import bytecode.visitor.MethodVisitor;
|
||||||
import semantic.SemanticVisitor;
|
import semantic.SemanticVisitor;
|
||||||
import typechecker.TypeCheckResult;
|
import semantic.TypeCheckResult;
|
||||||
|
|
||||||
public class NonCalculationNode extends BinaryNode {
|
public class NonCalculationNode extends BinaryNode {
|
||||||
public UnaryNode unaryExpression;
|
public UnaryNode unaryExpression;
|
||||||
@@ -18,23 +17,16 @@ public class NonCalculationNode extends BinaryNode {
|
|||||||
this.expression = expression;
|
this.expression = expression;
|
||||||
}
|
}
|
||||||
|
|
||||||
private void setOperator(String operator) {
|
public void setOperator(String operator) {
|
||||||
if(operator.equals("&&")) {
|
switch (operator) {
|
||||||
this.operator = EnumNonCalculationOperator.AND;
|
case "&&" -> this.operator = EnumNonCalculationOperator.AND;
|
||||||
} else if(operator.equals("||")) {
|
case "||" -> this.operator = EnumNonCalculationOperator.OR;
|
||||||
this.operator = EnumNonCalculationOperator.OR;
|
case ">" -> this.operator = EnumNonCalculationOperator.GREATER;
|
||||||
} else if(operator.equals(">")) {
|
case "<" -> this.operator = EnumNonCalculationOperator.LESS;
|
||||||
this.operator = EnumNonCalculationOperator.GREATER;
|
case ">=" -> this.operator = EnumNonCalculationOperator.GREATER_EQUAL;
|
||||||
} else if(operator.equals("<")) {
|
case "<=" -> this.operator = EnumNonCalculationOperator.LESS_EQUAL;
|
||||||
this.operator = EnumNonCalculationOperator.LESS;
|
case "==" -> this.operator = EnumNonCalculationOperator.EQUAL;
|
||||||
} else if(operator.equals(">=")) {
|
case "!=" -> this.operator = EnumNonCalculationOperator.NOT_EQUAL;
|
||||||
this.operator = EnumNonCalculationOperator.GREATER_EQUAL;
|
|
||||||
} else if(operator.equals("<=")) {
|
|
||||||
this.operator = EnumNonCalculationOperator.LESS_EQUAL;
|
|
||||||
} else if(operator.equals("==")) {
|
|
||||||
this.operator = EnumNonCalculationOperator.EQUAL;
|
|
||||||
} else if(operator.equals("!=")) {
|
|
||||||
this.operator = EnumNonCalculationOperator.NOT_EQUAL;
|
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
@@ -1,10 +1,11 @@
|
|||||||
package ast.expressions.unaryexpressions;
|
package ast.expressions.unaryexpressions;
|
||||||
|
|
||||||
import ast.ASTNode;
|
import ast.ASTNode;
|
||||||
import bytecode.visitor.MethodVisitor;
|
|
||||||
import ast.type.type.ITypeNode;
|
import ast.type.type.ITypeNode;
|
||||||
|
import bytecode.visitor.MethodVisitor;
|
||||||
|
|
||||||
import semantic.SemanticVisitor;
|
import semantic.SemanticVisitor;
|
||||||
import typechecker.TypeCheckResult;
|
import semantic.TypeCheckResult;
|
||||||
import visitor.Visitable;
|
import visitor.Visitable;
|
||||||
|
|
||||||
import java.util.ArrayList;
|
import java.util.ArrayList;
|
||||||
@@ -27,7 +28,7 @@ public class MemberAccessNode implements ASTNode, Visitable {
|
|||||||
public void accept(MethodVisitor methodVisitor) {
|
public void accept(MethodVisitor methodVisitor) {
|
||||||
methodVisitor.visit(this);
|
methodVisitor.visit(this);
|
||||||
}
|
}
|
||||||
|
|
||||||
public TypeCheckResult accept(SemanticVisitor visitor) {
|
public TypeCheckResult accept(SemanticVisitor visitor) {
|
||||||
return visitor.analyze(this);
|
return visitor.analyze(this);
|
||||||
}
|
}
|
||||||
@@ -40,4 +41,5 @@ public class MemberAccessNode implements ASTNode, Visitable {
|
|||||||
this.typeNode = typeNode;
|
this.typeNode = typeNode;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
|
||||||
}
|
}
|
||||||
|
@@ -1,13 +1,12 @@
|
|||||||
package ast.expressions.unaryexpressions;
|
package ast.expressions.unaryexpressions;
|
||||||
|
|
||||||
import ast.ASTNode;
|
|
||||||
import ast.expressions.IExpressionNode;
|
import ast.expressions.IExpressionNode;
|
||||||
|
import ast.type.type.ITypeNode;
|
||||||
import bytecode.visitor.MethodVisitor;
|
import bytecode.visitor.MethodVisitor;
|
||||||
import semantic.SemanticVisitor;
|
import semantic.SemanticVisitor;
|
||||||
import typechecker.TypeCheckResult;
|
import semantic.TypeCheckResult;
|
||||||
import visitor.Visitable;
|
|
||||||
|
|
||||||
public class NotNode implements ASTNode, Visitable {
|
public class NotNode implements IExpressionNode {
|
||||||
public IExpressionNode expression;
|
public IExpressionNode expression;
|
||||||
|
|
||||||
public NotNode(IExpressionNode expression) {
|
public NotNode(IExpressionNode expression) {
|
||||||
@@ -24,4 +23,13 @@ public class NotNode implements ASTNode, Visitable {
|
|||||||
return null;
|
return null;
|
||||||
}
|
}
|
||||||
|
|
||||||
}
|
@Override
|
||||||
|
public ITypeNode getType() {
|
||||||
|
return expression.getType();
|
||||||
|
}
|
||||||
|
|
||||||
|
@Override
|
||||||
|
public void setType(ITypeNode type) {
|
||||||
|
this.expression.setType(type);
|
||||||
|
}
|
||||||
|
}
|
@@ -6,7 +6,7 @@ import ast.type.type.*;
|
|||||||
import ast.type.ValueNode;
|
import ast.type.ValueNode;
|
||||||
import bytecode.visitor.MethodVisitor;
|
import bytecode.visitor.MethodVisitor;
|
||||||
import semantic.SemanticVisitor;
|
import semantic.SemanticVisitor;
|
||||||
import typechecker.TypeCheckResult;
|
import semantic.TypeCheckResult;
|
||||||
|
|
||||||
import java.util.Objects;
|
import java.util.Objects;
|
||||||
|
|
||||||
@@ -18,10 +18,10 @@ public class UnaryNode implements IExpressionNode {
|
|||||||
public NotNode notExpression;
|
public NotNode notExpression;
|
||||||
public IStatementNode statement;
|
public IStatementNode statement;
|
||||||
public IExpressionNode expression;
|
public IExpressionNode expression;
|
||||||
private ITypeNode type;
|
public ITypeNode type;
|
||||||
|
|
||||||
public UnaryNode(String value) {
|
public UnaryNode(String value) {
|
||||||
if(Objects.equals(value, "this")) {
|
if (Objects.equals(value, "this")) {
|
||||||
this.thisExp = "this";
|
this.thisExp = "this";
|
||||||
} else {
|
} else {
|
||||||
this.identifier = value;
|
this.identifier = value;
|
||||||
|
@@ -1,11 +0,0 @@
|
|||||||
package ast.literal;
|
|
||||||
|
|
||||||
public class BooleanLiteralNode {
|
|
||||||
private String value;
|
|
||||||
|
|
||||||
public BooleanLiteralNode(String value) {this.value = value;}
|
|
||||||
|
|
||||||
public String getValue() {
|
|
||||||
return value;
|
|
||||||
}
|
|
||||||
}
|
|
@@ -1,11 +0,0 @@
|
|||||||
package ast.literal;
|
|
||||||
|
|
||||||
public class CharLiteralNode {
|
|
||||||
public String value;
|
|
||||||
|
|
||||||
public CharLiteralNode(String value) {this.value = value;}
|
|
||||||
|
|
||||||
public String getValue() {
|
|
||||||
return value;
|
|
||||||
}
|
|
||||||
}
|
|
@@ -1,31 +0,0 @@
|
|||||||
package ast.literal;
|
|
||||||
|
|
||||||
import ast.expressions.IExpressionNode;
|
|
||||||
import ast.type.type.ITypeNode;
|
|
||||||
import semantic.SemanticVisitor;
|
|
||||||
import typechecker.TypeCheckResult;
|
|
||||||
|
|
||||||
public class LiteralNode implements IExpressionNode {
|
|
||||||
|
|
||||||
public String value;
|
|
||||||
private ITypeNode type;
|
|
||||||
|
|
||||||
public LiteralNode(String value, ITypeNode type) {
|
|
||||||
this.value = value;
|
|
||||||
this.type = type;
|
|
||||||
}
|
|
||||||
|
|
||||||
public ITypeNode getType() {
|
|
||||||
return type;
|
|
||||||
}
|
|
||||||
|
|
||||||
public void setType(ITypeNode type) {
|
|
||||||
this.type = type;
|
|
||||||
}
|
|
||||||
|
|
||||||
|
|
||||||
@Override
|
|
||||||
public TypeCheckResult accept(SemanticVisitor visitor) {
|
|
||||||
return null;
|
|
||||||
}
|
|
||||||
}
|
|
@@ -11,13 +11,8 @@ import java.util.List;
|
|||||||
import java.util.Objects;
|
import java.util.Objects;
|
||||||
|
|
||||||
public class ConstructorNode extends MethodNode implements Visitable {
|
public class ConstructorNode extends MethodNode implements Visitable {
|
||||||
public AccessModifierNode accessType;
|
|
||||||
public String identifier;
|
|
||||||
public List<ParameterNode> parameters = new ArrayList<>();
|
|
||||||
public BlockNode block;
|
|
||||||
|
|
||||||
public ConstructorNode(String accessType, String identifier, BlockNode block) {
|
public ConstructorNode(String accessType, String identifier, BlockNode block) {
|
||||||
this.accessType = new AccessModifierNode(accessType);
|
this.accesModifier = new AccessModifierNode(accessType);
|
||||||
this.identifier = identifier;
|
this.identifier = identifier;
|
||||||
this.block = block;
|
this.block = block;
|
||||||
}
|
}
|
||||||
@@ -32,8 +27,7 @@ public class ConstructorNode extends MethodNode implements Visitable {
|
|||||||
}
|
}
|
||||||
|
|
||||||
public boolean isSame(MethodNode methodNode) {
|
public boolean isSame(MethodNode methodNode) {
|
||||||
if (!(Objects.equals(this.identifier, methodNode.getIdentifier()))
|
if (!(Objects.equals(this.identifier, methodNode.getIdentifier())) || getParameters().size() != methodNode.getParameters().size()) {
|
||||||
|| getParameters().size() != methodNode.getParameters().size()) {
|
|
||||||
return false;
|
return false;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
@@ -3,9 +3,8 @@ package ast.members;
|
|||||||
import ast.type.AccessModifierNode;
|
import ast.type.AccessModifierNode;
|
||||||
import ast.type.type.ITypeNode;
|
import ast.type.type.ITypeNode;
|
||||||
import bytecode.visitor.ClassVisitor;
|
import bytecode.visitor.ClassVisitor;
|
||||||
import bytecode.visitor.MethodVisitor;
|
|
||||||
import semantic.SemanticVisitor;
|
import semantic.SemanticVisitor;
|
||||||
import typechecker.TypeCheckResult;
|
import semantic.TypeCheckResult;
|
||||||
import visitor.Visitable;
|
import visitor.Visitable;
|
||||||
|
|
||||||
public class FieldNode implements MemberNode, Visitable {
|
public class FieldNode implements MemberNode, Visitable {
|
||||||
@@ -13,7 +12,7 @@ public class FieldNode implements MemberNode, Visitable {
|
|||||||
public ITypeNode type;
|
public ITypeNode type;
|
||||||
public String identifier;
|
public String identifier;
|
||||||
|
|
||||||
public FieldNode(AccessModifierNode accessTypeNode, ITypeNode type, String name){
|
public FieldNode(AccessModifierNode accessTypeNode, ITypeNode type, String name) {
|
||||||
this.accessTypeNode = accessTypeNode;
|
this.accessTypeNode = accessTypeNode;
|
||||||
this.type = type;
|
this.type = type;
|
||||||
this.identifier = name;
|
this.identifier = name;
|
||||||
|
@@ -10,7 +10,8 @@ import ast.ASTNode;
|
|||||||
@JsonSubTypes({
|
@JsonSubTypes({
|
||||||
@JsonSubTypes.Type(value = MethodNode.class, name = "Method"),
|
@JsonSubTypes.Type(value = MethodNode.class, name = "Method"),
|
||||||
|
|
||||||
@JsonSubTypes.Type(value = FieldNode.class, name = "Field") }
|
@JsonSubTypes.Type(value = FieldNode.class, name = "Field")}
|
||||||
)
|
)
|
||||||
|
|
||||||
public interface MemberNode extends ASTNode {}
|
public interface MemberNode extends ASTNode {
|
||||||
|
}
|
||||||
|
@@ -6,7 +6,7 @@ import ast.type.AccessModifierNode;
|
|||||||
import ast.type.type.*;
|
import ast.type.type.*;
|
||||||
import bytecode.visitor.MethodVisitor;
|
import bytecode.visitor.MethodVisitor;
|
||||||
import semantic.SemanticVisitor;
|
import semantic.SemanticVisitor;
|
||||||
import typechecker.TypeCheckResult;
|
import semantic.TypeCheckResult;
|
||||||
import visitor.Visitable;
|
import visitor.Visitable;
|
||||||
|
|
||||||
import java.util.ArrayList;
|
import java.util.ArrayList;
|
||||||
@@ -15,16 +15,16 @@ import java.util.Objects;
|
|||||||
|
|
||||||
public class MethodNode implements MemberNode, Visitable {
|
public class MethodNode implements MemberNode, Visitable {
|
||||||
public AccessModifierNode accesModifier;
|
public AccessModifierNode accesModifier;
|
||||||
private ITypeNode type;
|
public ITypeNode type;
|
||||||
public Boolean voidType;
|
public Boolean voidType;
|
||||||
private String identifier;
|
public String identifier;
|
||||||
public List<ParameterNode> parameters = new ArrayList<>();
|
public List<ParameterNode> parameters = new ArrayList<>();
|
||||||
public BlockNode block;
|
public BlockNode block;
|
||||||
|
|
||||||
public MethodNode() {
|
public MethodNode() {
|
||||||
}
|
}
|
||||||
|
|
||||||
public MethodNode(String accessModifier, ITypeNode type, Boolean voidType, String identifier, BlockNode block){
|
public MethodNode(String accessModifier, ITypeNode type, Boolean voidType, String identifier, BlockNode block) {
|
||||||
this.accesModifier = new AccessModifierNode(accessModifier);
|
this.accesModifier = new AccessModifierNode(accessModifier);
|
||||||
this.type = type;
|
this.type = type;
|
||||||
this.voidType = voidType;
|
this.voidType = voidType;
|
||||||
@@ -40,7 +40,7 @@ public class MethodNode implements MemberNode, Visitable {
|
|||||||
return parameters;
|
return parameters;
|
||||||
}
|
}
|
||||||
|
|
||||||
public boolean isSame(MethodNode methodNode){
|
public boolean isSame(MethodNode methodNode) {
|
||||||
if (!(Objects.equals(this.identifier, methodNode.getIdentifier())) || type.equals(methodNode.type)
|
if (!(Objects.equals(this.identifier, methodNode.getIdentifier())) || type.equals(methodNode.type)
|
||||||
|| getParameters().size() != methodNode.getParameters().size()) {
|
|| getParameters().size() != methodNode.getParameters().size()) {
|
||||||
return false;
|
return false;
|
||||||
|
@@ -3,7 +3,7 @@ package ast.parameters;
|
|||||||
import ast.ASTNode;
|
import ast.ASTNode;
|
||||||
import ast.type.type.*;
|
import ast.type.type.*;
|
||||||
import semantic.SemanticVisitor;
|
import semantic.SemanticVisitor;
|
||||||
import typechecker.TypeCheckResult;
|
import semantic.TypeCheckResult;
|
||||||
import visitor.Visitable;
|
import visitor.Visitable;
|
||||||
|
|
||||||
public class ParameterNode implements ASTNode, Visitable {
|
public class ParameterNode implements ASTNode, Visitable {
|
||||||
|
@@ -3,7 +3,7 @@ package ast.statementexpressions;
|
|||||||
import ast.expressions.IExpressionNode;
|
import ast.expressions.IExpressionNode;
|
||||||
import bytecode.visitor.MethodVisitor;
|
import bytecode.visitor.MethodVisitor;
|
||||||
import semantic.SemanticVisitor;
|
import semantic.SemanticVisitor;
|
||||||
import typechecker.TypeCheckResult;
|
import semantic.TypeCheckResult;
|
||||||
|
|
||||||
public class AssignNode implements IStatementExpressionNode {
|
public class AssignNode implements IStatementExpressionNode {
|
||||||
public AssignableNode assignable;
|
public AssignableNode assignable;
|
||||||
|
@@ -2,12 +2,13 @@ package ast.statementexpressions;
|
|||||||
|
|
||||||
import ast.expressions.unaryexpressions.MemberAccessNode;
|
import ast.expressions.unaryexpressions.MemberAccessNode;
|
||||||
import ast.type.type.ITypeNode;
|
import ast.type.type.ITypeNode;
|
||||||
|
import bytecode.visitor.MethodVisitor;
|
||||||
import semantic.SemanticVisitor;
|
import semantic.SemanticVisitor;
|
||||||
import typechecker.TypeCheckResult;
|
import semantic.TypeCheckResult;
|
||||||
|
|
||||||
public class AssignableNode implements IStatementExpressionNode {
|
public class AssignableNode implements IStatementExpressionNode {
|
||||||
public String identifier;
|
public String identifier;
|
||||||
private ITypeNode typeNode;
|
public ITypeNode typeNode;
|
||||||
|
|
||||||
public MemberAccessNode memberAccess;
|
public MemberAccessNode memberAccess;
|
||||||
|
|
||||||
@@ -24,10 +25,6 @@ public class AssignableNode implements IStatementExpressionNode {
|
|||||||
return visitor.analyze(this);
|
return visitor.analyze(this);
|
||||||
}
|
}
|
||||||
|
|
||||||
public ITypeNode getTypeNode() {
|
|
||||||
return typeNode;
|
|
||||||
}
|
|
||||||
|
|
||||||
public void setTypeNode(ITypeNode typeNode) {
|
public void setTypeNode(ITypeNode typeNode) {
|
||||||
this.typeNode = typeNode;
|
this.typeNode = typeNode;
|
||||||
}
|
}
|
||||||
|
@@ -2,4 +2,5 @@ package ast.statementexpressions;
|
|||||||
|
|
||||||
import ast.statements.IStatementNode;
|
import ast.statements.IStatementNode;
|
||||||
|
|
||||||
public interface IStatementExpressionNode extends IStatementNode {}
|
public interface IStatementExpressionNode extends IStatementNode {
|
||||||
|
}
|
||||||
|
@@ -3,7 +3,7 @@ package ast.statementexpressions;
|
|||||||
import ast.expressions.IExpressionNode;
|
import ast.expressions.IExpressionNode;
|
||||||
import bytecode.visitor.MethodVisitor;
|
import bytecode.visitor.MethodVisitor;
|
||||||
import semantic.SemanticVisitor;
|
import semantic.SemanticVisitor;
|
||||||
import typechecker.TypeCheckResult;
|
import semantic.TypeCheckResult;
|
||||||
|
|
||||||
import java.util.ArrayList;
|
import java.util.ArrayList;
|
||||||
import java.util.List;
|
import java.util.List;
|
||||||
|
@@ -4,7 +4,7 @@ import ast.statementexpressions.AssignableNode;
|
|||||||
import ast.statementexpressions.IStatementExpressionNode;
|
import ast.statementexpressions.IStatementExpressionNode;
|
||||||
import bytecode.visitor.MethodVisitor;
|
import bytecode.visitor.MethodVisitor;
|
||||||
import semantic.SemanticVisitor;
|
import semantic.SemanticVisitor;
|
||||||
import typechecker.TypeCheckResult;
|
import semantic.TypeCheckResult;
|
||||||
import visitor.Visitable;
|
import visitor.Visitable;
|
||||||
|
|
||||||
public class DecrementNode implements IStatementExpressionNode, Visitable {
|
public class DecrementNode implements IStatementExpressionNode, Visitable {
|
||||||
|
@@ -4,8 +4,8 @@ import ast.statementexpressions.AssignableNode;
|
|||||||
import ast.statementexpressions.IStatementExpressionNode;
|
import ast.statementexpressions.IStatementExpressionNode;
|
||||||
import bytecode.visitor.MethodVisitor;
|
import bytecode.visitor.MethodVisitor;
|
||||||
import semantic.SemanticVisitor;
|
import semantic.SemanticVisitor;
|
||||||
import typechecker.TypeCheckResult;
|
|
||||||
import visitor.Visitable;
|
import visitor.Visitable;
|
||||||
|
import semantic.TypeCheckResult;
|
||||||
|
|
||||||
public class IncrementNode implements IStatementExpressionNode, Visitable {
|
public class IncrementNode implements IStatementExpressionNode, Visitable {
|
||||||
public CrementType crementType;
|
public CrementType crementType;
|
||||||
|
@@ -4,7 +4,7 @@ import ast.ASTNode;
|
|||||||
import ast.expressions.IExpressionNode;
|
import ast.expressions.IExpressionNode;
|
||||||
import bytecode.visitor.MethodVisitor;
|
import bytecode.visitor.MethodVisitor;
|
||||||
import semantic.SemanticVisitor;
|
import semantic.SemanticVisitor;
|
||||||
import typechecker.TypeCheckResult;
|
import semantic.TypeCheckResult;
|
||||||
import visitor.Visitable;
|
import visitor.Visitable;
|
||||||
|
|
||||||
import java.util.ArrayList;
|
import java.util.ArrayList;
|
||||||
|
@@ -5,7 +5,7 @@ import ast.statements.IStatementNode;
|
|||||||
import ast.type.type.ITypeNode;
|
import ast.type.type.ITypeNode;
|
||||||
import bytecode.visitor.MethodVisitor;
|
import bytecode.visitor.MethodVisitor;
|
||||||
import semantic.SemanticVisitor;
|
import semantic.SemanticVisitor;
|
||||||
import typechecker.TypeCheckResult;
|
import semantic.TypeCheckResult;
|
||||||
|
|
||||||
import java.util.ArrayList;
|
import java.util.ArrayList;
|
||||||
import java.util.List;
|
import java.util.List;
|
||||||
|
@@ -3,9 +3,8 @@ package ast.statementexpressions.methodcallstatementnexpressions;
|
|||||||
import ast.ASTNode;
|
import ast.ASTNode;
|
||||||
import ast.expressions.unaryexpressions.MemberAccessNode;
|
import ast.expressions.unaryexpressions.MemberAccessNode;
|
||||||
import ast.statementexpressions.NewDeclarationNode;
|
import ast.statementexpressions.NewDeclarationNode;
|
||||||
import bytecode.visitor.MethodVisitor;
|
|
||||||
import semantic.SemanticVisitor;
|
import semantic.SemanticVisitor;
|
||||||
import typechecker.TypeCheckResult;
|
import semantic.TypeCheckResult;
|
||||||
import visitor.Visitable;
|
import visitor.Visitable;
|
||||||
|
|
||||||
public class TargetNode implements ASTNode, Visitable {
|
public class TargetNode implements ASTNode, Visitable {
|
||||||
|
@@ -1,8 +1,8 @@
|
|||||||
package ast.statements;
|
package ast.statements;
|
||||||
|
|
||||||
import ast.ASTNode;
|
import bytecode.visitor.MethodVisitor;
|
||||||
import semantic.SemanticVisitor;
|
import semantic.SemanticVisitor;
|
||||||
import typechecker.TypeCheckResult;
|
import semantic.TypeCheckResult;
|
||||||
import visitor.Visitable;
|
import visitor.Visitable;
|
||||||
|
|
||||||
import java.util.ArrayList;
|
import java.util.ArrayList;
|
||||||
@@ -11,7 +11,8 @@ import java.util.List;
|
|||||||
public class BlockNode implements IStatementNode, Visitable {
|
public class BlockNode implements IStatementNode, Visitable {
|
||||||
public List<IStatementNode> statements = new ArrayList<>();
|
public List<IStatementNode> statements = new ArrayList<>();
|
||||||
|
|
||||||
public BlockNode() {}
|
public BlockNode() {
|
||||||
|
}
|
||||||
|
|
||||||
public void addStatement(IStatementNode statement) {
|
public void addStatement(IStatementNode statement) {
|
||||||
statements.add(statement);
|
statements.add(statement);
|
||||||
@@ -22,4 +23,9 @@ public class BlockNode implements IStatementNode, Visitable {
|
|||||||
return visitor.analyze(this);
|
return visitor.analyze(this);
|
||||||
}
|
}
|
||||||
|
|
||||||
|
@Override
|
||||||
|
public void accept(MethodVisitor methodVisitor) {
|
||||||
|
methodVisitor.visit(this);
|
||||||
|
}
|
||||||
|
|
||||||
}
|
}
|
||||||
|
@@ -1,10 +0,0 @@
|
|||||||
package ast.statements;
|
|
||||||
|
|
||||||
|
|
||||||
import java.util.List;
|
|
||||||
|
|
||||||
public class BlockStatementNode {
|
|
||||||
List<IStatementNode> statements;
|
|
||||||
|
|
||||||
public BlockStatementNode(List<IStatementNode> statements) {this.statements = statements;}
|
|
||||||
}
|
|
@@ -1,7 +1,8 @@
|
|||||||
package ast.statements;
|
package ast.statements;
|
||||||
|
|
||||||
|
import bytecode.visitor.MethodVisitor;
|
||||||
import semantic.SemanticVisitor;
|
import semantic.SemanticVisitor;
|
||||||
import typechecker.TypeCheckResult;
|
import semantic.TypeCheckResult;
|
||||||
|
|
||||||
public class ElseNode implements IStatementNode {
|
public class ElseNode implements IStatementNode {
|
||||||
public BlockNode block;
|
public BlockNode block;
|
||||||
|
@@ -1,7 +1,8 @@
|
|||||||
package ast.statements;
|
package ast.statements;
|
||||||
|
|
||||||
|
import bytecode.visitor.MethodVisitor;
|
||||||
import semantic.SemanticVisitor;
|
import semantic.SemanticVisitor;
|
||||||
import typechecker.TypeCheckResult;
|
import semantic.TypeCheckResult;
|
||||||
|
|
||||||
import java.util.ArrayList;
|
import java.util.ArrayList;
|
||||||
import java.util.List;
|
import java.util.List;
|
||||||
@@ -20,6 +21,11 @@ public class IfElseNode implements IStatementNode {
|
|||||||
elseIfStatements.add(elseIfStament);
|
elseIfStatements.add(elseIfStament);
|
||||||
}
|
}
|
||||||
|
|
||||||
|
@Override
|
||||||
|
public void accept(MethodVisitor methodVisitor) {
|
||||||
|
methodVisitor.visit(this);
|
||||||
|
}
|
||||||
|
|
||||||
@Override
|
@Override
|
||||||
public TypeCheckResult accept(SemanticVisitor visitor) {
|
public TypeCheckResult accept(SemanticVisitor visitor) {
|
||||||
return visitor.analyze(this);
|
return visitor.analyze(this);
|
||||||
|
@@ -2,7 +2,7 @@ package ast.statements;
|
|||||||
|
|
||||||
import ast.expressions.IExpressionNode;
|
import ast.expressions.IExpressionNode;
|
||||||
import semantic.SemanticVisitor;
|
import semantic.SemanticVisitor;
|
||||||
import typechecker.TypeCheckResult;
|
import semantic.TypeCheckResult;
|
||||||
|
|
||||||
public class IfNode implements IStatementNode {
|
public class IfNode implements IStatementNode {
|
||||||
public IExpressionNode expression;
|
public IExpressionNode expression;
|
||||||
|
@@ -4,7 +4,7 @@ import ast.expressions.IExpressionNode;
|
|||||||
import ast.type.type.*;
|
import ast.type.type.*;
|
||||||
import bytecode.visitor.MethodVisitor;
|
import bytecode.visitor.MethodVisitor;
|
||||||
import semantic.SemanticVisitor;
|
import semantic.SemanticVisitor;
|
||||||
import typechecker.TypeCheckResult;
|
import semantic.TypeCheckResult;
|
||||||
|
|
||||||
public class LocalVariableDeclarationNode implements IStatementNode {
|
public class LocalVariableDeclarationNode implements IStatementNode {
|
||||||
public ITypeNode type;
|
public ITypeNode type;
|
||||||
|
@@ -3,14 +3,14 @@ package ast.statements;
|
|||||||
import ast.expressions.IExpressionNode;
|
import ast.expressions.IExpressionNode;
|
||||||
import bytecode.visitor.MethodVisitor;
|
import bytecode.visitor.MethodVisitor;
|
||||||
import semantic.SemanticVisitor;
|
import semantic.SemanticVisitor;
|
||||||
import typechecker.TypeCheckResult;
|
import semantic.TypeCheckResult;
|
||||||
|
|
||||||
public class ReturnNode implements IStatementNode {
|
public class ReturnNode implements IStatementNode {
|
||||||
public IExpressionNode expression;
|
public IExpressionNode expression;
|
||||||
public Boolean voidReturn = false;
|
public Boolean voidReturn = false;
|
||||||
|
|
||||||
public ReturnNode(IExpressionNode expression) {
|
public ReturnNode(IExpressionNode expression) {
|
||||||
if(expression != null) {
|
if (expression != null) {
|
||||||
this.expression = expression;
|
this.expression = expression;
|
||||||
} else {
|
} else {
|
||||||
voidReturn = true;
|
voidReturn = true;
|
||||||
|
@@ -1,8 +1,9 @@
|
|||||||
package ast.statements;
|
package ast.statements;
|
||||||
|
|
||||||
import ast.expressions.IExpressionNode;
|
import ast.expressions.IExpressionNode;
|
||||||
|
import bytecode.visitor.MethodVisitor;
|
||||||
import semantic.SemanticVisitor;
|
import semantic.SemanticVisitor;
|
||||||
import typechecker.TypeCheckResult;
|
import semantic.TypeCheckResult;
|
||||||
|
|
||||||
public class WhileNode implements IStatementNode {
|
public class WhileNode implements IStatementNode {
|
||||||
public IExpressionNode expression;
|
public IExpressionNode expression;
|
||||||
@@ -14,10 +15,14 @@ public class WhileNode implements IStatementNode {
|
|||||||
}
|
}
|
||||||
|
|
||||||
public void test() {
|
public void test() {
|
||||||
return;
|
|
||||||
|
|
||||||
}
|
}
|
||||||
|
|
||||||
|
@Override
|
||||||
|
public void accept(MethodVisitor methodVisitor) {
|
||||||
|
methodVisitor.visit(this);
|
||||||
|
}
|
||||||
|
|
||||||
@Override
|
@Override
|
||||||
public TypeCheckResult accept(SemanticVisitor visitor) {
|
public TypeCheckResult accept(SemanticVisitor visitor) {
|
||||||
return visitor.analyze(this);
|
return visitor.analyze(this);
|
||||||
|
@@ -8,7 +8,7 @@ public class AccessModifierNode {
|
|||||||
}
|
}
|
||||||
|
|
||||||
private void setModifier(String accessType) {
|
private void setModifier(String accessType) {
|
||||||
switch(accessType) {
|
switch (accessType) {
|
||||||
case "public":
|
case "public":
|
||||||
this.accessType = EnumAccessModifierNode.PUBLIC;
|
this.accessType = EnumAccessModifierNode.PUBLIC;
|
||||||
break;
|
break;
|
||||||
|
@@ -3,7 +3,7 @@ package ast.type;
|
|||||||
import ast.ASTNode;
|
import ast.ASTNode;
|
||||||
import bytecode.visitor.MethodVisitor;
|
import bytecode.visitor.MethodVisitor;
|
||||||
import semantic.SemanticVisitor;
|
import semantic.SemanticVisitor;
|
||||||
import typechecker.TypeCheckResult;
|
import semantic.TypeCheckResult;
|
||||||
import visitor.Visitable;
|
import visitor.Visitable;
|
||||||
|
|
||||||
public class ValueNode implements ASTNode, Visitable {
|
public class ValueNode implements ASTNode, Visitable {
|
||||||
|
@@ -2,7 +2,7 @@ package ast.type.type;
|
|||||||
|
|
||||||
public class BaseType implements ITypeNode {
|
public class BaseType implements ITypeNode {
|
||||||
|
|
||||||
private TypeEnum typeEnum;
|
public final TypeEnum typeEnum;
|
||||||
|
|
||||||
public BaseType(TypeEnum typeEnum) {
|
public BaseType(TypeEnum typeEnum) {
|
||||||
this.typeEnum = typeEnum;
|
this.typeEnum = typeEnum;
|
||||||
@@ -21,8 +21,6 @@ public class BaseType implements ITypeNode {
|
|||||||
if (getClass() != obj.getClass())
|
if (getClass() != obj.getClass())
|
||||||
return false;
|
return false;
|
||||||
BaseType other = (BaseType) obj;
|
BaseType other = (BaseType) obj;
|
||||||
if (typeEnum != other.typeEnum)
|
return typeEnum == other.typeEnum;
|
||||||
return false;
|
|
||||||
return true;
|
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
@@ -1,5 +1,4 @@
|
|||||||
package ast.type.type;
|
package ast.type.type;
|
||||||
|
|
||||||
public interface ITypeNode {
|
public interface ITypeNode {
|
||||||
|
|
||||||
}
|
}
|
||||||
|
@@ -1,8 +1,8 @@
|
|||||||
package ast.type.type;
|
package ast.type.type;
|
||||||
|
|
||||||
public class ReferenceType implements ITypeNode{
|
public class ReferenceType implements ITypeNode {
|
||||||
|
|
||||||
private String identifier;
|
public final String identifier;
|
||||||
|
|
||||||
public ReferenceType(String identifier) {
|
public ReferenceType(String identifier) {
|
||||||
this.identifier = identifier;
|
this.identifier = identifier;
|
||||||
@@ -22,11 +22,8 @@ public class ReferenceType implements ITypeNode{
|
|||||||
return false;
|
return false;
|
||||||
ReferenceType other = (ReferenceType) obj;
|
ReferenceType other = (ReferenceType) obj;
|
||||||
if (identifier == null) {
|
if (identifier == null) {
|
||||||
if (other.identifier != null)
|
return other.identifier == null;
|
||||||
return false;
|
} else return identifier.equals(other.identifier);
|
||||||
} else if (!identifier.equals(other.identifier))
|
|
||||||
return false;
|
|
||||||
return true;
|
|
||||||
}
|
}
|
||||||
|
|
||||||
|
|
||||||
|
@@ -4,6 +4,6 @@ public enum TypeEnum {
|
|||||||
VOID,
|
VOID,
|
||||||
INT,
|
INT,
|
||||||
CHAR,
|
CHAR,
|
||||||
BOOL;
|
BOOL,
|
||||||
|
NULL
|
||||||
}
|
}
|
||||||
|
@@ -17,9 +17,9 @@ public class ByteCodeGenerator implements ProgramVisitor {
|
|||||||
|
|
||||||
private JarOutputStream jarOutputStream;
|
private JarOutputStream jarOutputStream;
|
||||||
private ByteArrayOutputStream byteArrayOutputStream;
|
private ByteArrayOutputStream byteArrayOutputStream;
|
||||||
private String outputDirectory;
|
private final String outputDirectory;
|
||||||
private boolean generateJar;
|
private final boolean generateJar;
|
||||||
private boolean generateClassFiles;
|
private final boolean generateClassFiles;
|
||||||
|
|
||||||
public ByteCodeGenerator(String outputDirectory, boolean generateJar, boolean generateClassFiles) {
|
public ByteCodeGenerator(String outputDirectory, boolean generateJar, boolean generateClassFiles) {
|
||||||
this.outputDirectory = outputDirectory;
|
this.outputDirectory = outputDirectory;
|
||||||
|
@@ -19,12 +19,12 @@ import java.util.jar.JarOutputStream;
|
|||||||
|
|
||||||
|
|
||||||
public class ClassCodeGen implements ClassVisitor {
|
public class ClassCodeGen implements ClassVisitor {
|
||||||
private Mapper mapper;
|
private final Mapper mapper;
|
||||||
private ClassWriter classWriter;
|
private ClassWriter classWriter;
|
||||||
private JarOutputStream jarOutputStream;
|
private final JarOutputStream jarOutputStream;
|
||||||
private String outputDirectory;
|
private final String outputDirectory;
|
||||||
private boolean generateJar;
|
private final boolean generateJar;
|
||||||
private boolean generateClassFiles;
|
private final boolean generateClassFiles;
|
||||||
|
|
||||||
public ClassCodeGen(JarOutputStream jarOutputStream, String outputDirectory, boolean generateJar, boolean generateClassFiles) {
|
public ClassCodeGen(JarOutputStream jarOutputStream, String outputDirectory, boolean generateJar, boolean generateClassFiles) {
|
||||||
this.mapper = new Mapper();
|
this.mapper = new Mapper();
|
||||||
|
@@ -10,12 +10,15 @@ import ast.members.MainMethodNode;
|
|||||||
import ast.members.MethodNode;
|
import ast.members.MethodNode;
|
||||||
import ast.parameters.ParameterNode;
|
import ast.parameters.ParameterNode;
|
||||||
import ast.statementexpressions.AssignNode;
|
import ast.statementexpressions.AssignNode;
|
||||||
|
import ast.statementexpressions.AssignableNode;
|
||||||
import ast.statementexpressions.NewDeclarationNode;
|
import ast.statementexpressions.NewDeclarationNode;
|
||||||
import ast.statementexpressions.crementexpressions.CrementType;
|
import ast.statementexpressions.crementexpressions.CrementType;
|
||||||
import ast.statementexpressions.crementexpressions.DecrementNode;
|
import ast.statementexpressions.crementexpressions.DecrementNode;
|
||||||
import ast.statementexpressions.crementexpressions.IncrementNode;
|
import ast.statementexpressions.crementexpressions.IncrementNode;
|
||||||
import ast.statementexpressions.methodcallstatementnexpressions.MethodCallNode;
|
import ast.statementexpressions.methodcallstatementnexpressions.MethodCallNode;
|
||||||
import ast.statements.*;
|
import ast.statements.*;
|
||||||
|
import ast.type.AccessModifierNode;
|
||||||
|
import ast.type.EnumAccessModifierNode;
|
||||||
import ast.type.ValueNode;
|
import ast.type.ValueNode;
|
||||||
import ast.type.type.BaseType;
|
import ast.type.type.BaseType;
|
||||||
import ast.type.type.ReferenceType;
|
import ast.type.type.ReferenceType;
|
||||||
@@ -33,11 +36,11 @@ import static org.objectweb.asm.Opcodes.*;
|
|||||||
|
|
||||||
public class MethodCodeGen implements bytecode.visitor.MethodVisitor {
|
public class MethodCodeGen implements bytecode.visitor.MethodVisitor {
|
||||||
|
|
||||||
private ClassWriter classWriter;
|
private final ClassWriter classWriter;
|
||||||
private Mapper mapper;
|
private final Mapper mapper;
|
||||||
private MethodVisitor methodVisitor;
|
private MethodVisitor methodVisitor;
|
||||||
|
|
||||||
private List<String> localVariables;
|
private final List<String> localVariables;
|
||||||
|
|
||||||
public MethodCodeGen(ClassWriter classWriter) {
|
public MethodCodeGen(ClassWriter classWriter) {
|
||||||
this.classWriter = classWriter;
|
this.classWriter = classWriter;
|
||||||
@@ -51,7 +54,7 @@ public class MethodCodeGen implements bytecode.visitor.MethodVisitor {
|
|||||||
@Override
|
@Override
|
||||||
public void visit(ConstructorNode constructorNode) {
|
public void visit(ConstructorNode constructorNode) {
|
||||||
methodVisitor =
|
methodVisitor =
|
||||||
classWriter.visitMethod(mapper.mapAccessTypeToOpcode(constructorNode.accessType),
|
classWriter.visitMethod(mapper.mapAccessTypeToOpcode(constructorNode.accesModifier),
|
||||||
"<init>",
|
"<init>",
|
||||||
mapper.generateMethodDescriptor(new BaseType(TypeEnum.VOID), constructorNode.parameters),
|
mapper.generateMethodDescriptor(new BaseType(TypeEnum.VOID), constructorNode.parameters),
|
||||||
null,
|
null,
|
||||||
@@ -78,8 +81,10 @@ public class MethodCodeGen implements bytecode.visitor.MethodVisitor {
|
|||||||
|
|
||||||
@Override
|
@Override
|
||||||
public void visit(MainMethodNode mainMethodNode) {
|
public void visit(MainMethodNode mainMethodNode) {
|
||||||
methodVisitor = classWriter.visitMethod(mapper.mapAccessTypeToOpcode(mainMethodNode.accesModifier),
|
AccessModifierNode accessModifierNode = new AccessModifierNode("");
|
||||||
mainMethodNode.getIdentifier(),
|
accessModifierNode.accessType = EnumAccessModifierNode.PUBLIC_STATIC;
|
||||||
|
methodVisitor = classWriter.visitMethod(Opcodes.ACC_PUBLIC | Opcodes.ACC_STATIC,
|
||||||
|
"main",
|
||||||
"([Ljava/lang/String;)V",
|
"([Ljava/lang/String;)V",
|
||||||
null,
|
null,
|
||||||
null);
|
null);
|
||||||
@@ -131,12 +136,12 @@ public class MethodCodeGen implements bytecode.visitor.MethodVisitor {
|
|||||||
|
|
||||||
@Override
|
@Override
|
||||||
public void visit(CalculationNode calculationNode) {
|
public void visit(CalculationNode calculationNode) {
|
||||||
if (calculationNode.dotExpression != null) {
|
|
||||||
calculationNode.dotExpression.accept(this);
|
|
||||||
}
|
|
||||||
if (calculationNode.calculationExpression != null) {
|
if (calculationNode.calculationExpression != null) {
|
||||||
calculationNode.calculationExpression.accept(this);
|
calculationNode.calculationExpression.accept(this);
|
||||||
}
|
}
|
||||||
|
if (calculationNode.dotExpression != null) {
|
||||||
|
calculationNode.dotExpression.accept(this);
|
||||||
|
}
|
||||||
if (calculationNode.operator != null) {
|
if (calculationNode.operator != null) {
|
||||||
switch (calculationNode.operator) {
|
switch (calculationNode.operator) {
|
||||||
case PLUS:
|
case PLUS:
|
||||||
@@ -154,8 +159,8 @@ public class MethodCodeGen implements bytecode.visitor.MethodVisitor {
|
|||||||
if (dotNode.dotExpression != null) {
|
if (dotNode.dotExpression != null) {
|
||||||
dotNode.dotExpression.accept(this);
|
dotNode.dotExpression.accept(this);
|
||||||
}
|
}
|
||||||
if (dotNode.dotSubstractionExpression != null) {
|
if (dotNode.dotSubtractionExpression != null) {
|
||||||
dotNode.dotSubstractionExpression.accept(this);
|
dotNode.dotSubtractionExpression.accept(this);
|
||||||
}
|
}
|
||||||
if (dotNode.operator != null) {
|
if (dotNode.operator != null) {
|
||||||
switch (dotNode.operator) {
|
switch (dotNode.operator) {
|
||||||
@@ -173,17 +178,17 @@ public class MethodCodeGen implements bytecode.visitor.MethodVisitor {
|
|||||||
}
|
}
|
||||||
|
|
||||||
@Override
|
@Override
|
||||||
public void visit(DotSubstractionNode dotSubstractionNode) {
|
public void visit(DotSubtractionNode dotSubtractionNode) {
|
||||||
if (dotSubstractionNode.value != null) {
|
if (dotSubtractionNode.value != null) {
|
||||||
dotSubstractionNode.value.accept(this);
|
dotSubtractionNode.value.accept(this);
|
||||||
} else if (dotSubstractionNode.identifier != null) {
|
} else if (dotSubtractionNode.identifier != null) {
|
||||||
methodVisitor.visitVarInsn(ILOAD, localVariables.indexOf(dotSubstractionNode.identifier));
|
methodVisitor.visitVarInsn(ILOAD, localVariables.indexOf(dotSubtractionNode.identifier));
|
||||||
} else if (dotSubstractionNode.memberAccess != null) {
|
} else if (dotSubtractionNode.memberAccess != null) {
|
||||||
dotSubstractionNode.memberAccess.accept(this);
|
dotSubtractionNode.memberAccess.accept(this);
|
||||||
} else if (dotSubstractionNode.methodCall != null) {
|
} else if (dotSubtractionNode.methodCall != null) {
|
||||||
dotSubstractionNode.methodCall.accept(this);
|
dotSubtractionNode.methodCall.accept(this);
|
||||||
} else if (dotSubstractionNode.calculationExpression != null) {
|
} else if (dotSubtractionNode.calculationExpression != null) {
|
||||||
dotSubstractionNode.calculationExpression.accept(this);
|
dotSubtractionNode.calculationExpression.accept(this);
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
@@ -300,9 +305,8 @@ public class MethodCodeGen implements bytecode.visitor.MethodVisitor {
|
|||||||
public void visit(UnaryNode unaryNode) {
|
public void visit(UnaryNode unaryNode) {
|
||||||
if (unaryNode.thisExp != null) {
|
if (unaryNode.thisExp != null) {
|
||||||
methodVisitor.visitVarInsn(ALOAD, 0); // this
|
methodVisitor.visitVarInsn(ALOAD, 0); // this
|
||||||
} else if (unaryNode.identifier != null) {
|
|
||||||
methodVisitor.visitVarInsn(ILOAD, localVariables.indexOf(unaryNode.identifier));
|
|
||||||
} else if (unaryNode.memberAccess != null) {
|
} else if (unaryNode.memberAccess != null) {
|
||||||
|
unaryNode.memberAccess.setTypeNode(unaryNode.getType());
|
||||||
unaryNode.memberAccess.accept(this);
|
unaryNode.memberAccess.accept(this);
|
||||||
} else if (unaryNode.value != null) {
|
} else if (unaryNode.value != null) {
|
||||||
unaryNode.value.accept(this);
|
unaryNode.value.accept(this);
|
||||||
@@ -312,15 +316,25 @@ public class MethodCodeGen implements bytecode.visitor.MethodVisitor {
|
|||||||
unaryNode.statement.accept(this);
|
unaryNode.statement.accept(this);
|
||||||
} else if (unaryNode.expression != null) {
|
} else if (unaryNode.expression != null) {
|
||||||
unaryNode.expression.accept(this);
|
unaryNode.expression.accept(this);
|
||||||
|
} else if (unaryNode.identifier != null) {
|
||||||
|
methodVisitor.visitVarInsn(ILOAD, localVariables.indexOf(unaryNode.identifier));
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
|
||||||
// Statements
|
// Statements
|
||||||
|
|
||||||
|
@Override
|
||||||
|
public void visit(BlockNode blockNode) {
|
||||||
|
for (IStatementNode statementNode : blockNode.statements) {
|
||||||
|
statementNode.accept(this);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
@Override
|
@Override
|
||||||
public void visit(IfElseNode ifElseNode) {
|
public void visit(IfElseNode ifElseNode) {
|
||||||
Label elseLabel = new Label();
|
Label elseLabel = new Label();
|
||||||
|
Label endLabel = new Label();
|
||||||
|
|
||||||
Label[] elseIfLabels = new Label[ifElseNode.elseIfStatements.size()];
|
Label[] elseIfLabels = new Label[ifElseNode.elseIfStatements.size()];
|
||||||
for (int i = 0; i < ifElseNode.elseIfStatements.size(); i++) {
|
for (int i = 0; i < ifElseNode.elseIfStatements.size(); i++) {
|
||||||
@@ -338,7 +352,6 @@ public class MethodCodeGen implements bytecode.visitor.MethodVisitor {
|
|||||||
|
|
||||||
ifElseNode.ifStatement.block.accept(this); // accept if block
|
ifElseNode.ifStatement.block.accept(this); // accept if block
|
||||||
|
|
||||||
Label endLabel = new Label();
|
|
||||||
methodVisitor.visitJumpInsn(GOTO, endLabel);
|
methodVisitor.visitJumpInsn(GOTO, endLabel);
|
||||||
|
|
||||||
for (int i = 0; i < ifElseNode.elseIfStatements.size(); i++) {
|
for (int i = 0; i < ifElseNode.elseIfStatements.size(); i++) {
|
||||||
@@ -357,6 +370,8 @@ public class MethodCodeGen implements bytecode.visitor.MethodVisitor {
|
|||||||
if (ifElseNode.elseStatement != null) {
|
if (ifElseNode.elseStatement != null) {
|
||||||
methodVisitor.visitLabel(elseLabel);
|
methodVisitor.visitLabel(elseLabel);
|
||||||
ifElseNode.elseStatement.block.accept(this);
|
ifElseNode.elseStatement.block.accept(this);
|
||||||
|
} else {
|
||||||
|
methodVisitor.visitLabel(elseLabel);
|
||||||
}
|
}
|
||||||
|
|
||||||
methodVisitor.visitLabel(endLabel);
|
methodVisitor.visitLabel(endLabel);
|
||||||
@@ -367,6 +382,20 @@ public class MethodCodeGen implements bytecode.visitor.MethodVisitor {
|
|||||||
if (localVariableDeclarationNode.expression != null) {
|
if (localVariableDeclarationNode.expression != null) {
|
||||||
// Process expression
|
// Process expression
|
||||||
localVariableDeclarationNode.expression.accept(this);
|
localVariableDeclarationNode.expression.accept(this);
|
||||||
|
|
||||||
|
if (localVariableDeclarationNode.expression instanceof UnaryNode) {
|
||||||
|
UnaryNode unaryNode = (UnaryNode) localVariableDeclarationNode.expression;
|
||||||
|
if (unaryNode.statement instanceof IncrementNode) {
|
||||||
|
IncrementNode incrementNode = (IncrementNode) unaryNode.statement;
|
||||||
|
incrementNode.assignableExpression.typeNode = unaryNode.type;
|
||||||
|
loadIncrement(incrementNode);
|
||||||
|
} else if (unaryNode.statement instanceof DecrementNode) {
|
||||||
|
DecrementNode decrementNode = (DecrementNode) unaryNode.statement;
|
||||||
|
decrementNode.assignableExpression.typeNode = unaryNode.type;
|
||||||
|
loadDecrement(decrementNode);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
// add local var to list if not in list
|
// add local var to list if not in list
|
||||||
if (!localVariables.contains(localVariableDeclarationNode.identifier)) {
|
if (!localVariables.contains(localVariableDeclarationNode.identifier)) {
|
||||||
localVariables.add(localVariableDeclarationNode.identifier);
|
localVariables.add(localVariableDeclarationNode.identifier);
|
||||||
@@ -387,24 +416,37 @@ public class MethodCodeGen implements bytecode.visitor.MethodVisitor {
|
|||||||
@Override
|
@Override
|
||||||
public void visit(AssignNode assignNode) {
|
public void visit(AssignNode assignNode) {
|
||||||
if (assignNode.assignable.memberAccess != null) { // this / object
|
if (assignNode.assignable.memberAccess != null) { // this / object
|
||||||
if (assignNode.expression instanceof IncrementNode) {
|
assignNode.assignable.memberAccess.setTypeNode(assignNode.assignable.typeNode);
|
||||||
if (((IncrementNode) assignNode.expression).crementType.equals(CrementType.PREFIX)) { // ++i
|
if (assignNode.expression instanceof UnaryNode) {
|
||||||
fieldOrObjectVarPrefixCrementAssign(assignNode);
|
UnaryNode unaryNode = (UnaryNode) assignNode.expression;
|
||||||
} else { // i++
|
if (unaryNode.statement instanceof IncrementNode) {
|
||||||
fieldOrObjectVarSuffixCrementAssign(assignNode);
|
IncrementNode incrementNode = (IncrementNode) unaryNode.statement;
|
||||||
}
|
if (incrementNode.crementType.equals(CrementType.PREFIX)) { // ++i
|
||||||
} else if (assignNode.expression instanceof DecrementNode) {
|
incrementNode.accept(this); // crement
|
||||||
if (((DecrementNode) assignNode.expression).crementType.equals(CrementType.PREFIX)) {
|
fieldOrObjectVarCrementAssign(assignNode); // assign
|
||||||
fieldOrObjectVarPrefixCrementAssign(assignNode);
|
} else { // i++
|
||||||
} else {
|
fieldOrObjectVarCrementAssign(assignNode); // assign
|
||||||
fieldOrObjectVarSuffixCrementAssign(assignNode);
|
incrementNode.accept(this); // crement
|
||||||
|
}
|
||||||
|
} else if (unaryNode.statement instanceof DecrementNode) {
|
||||||
|
DecrementNode decrementNode = (DecrementNode) unaryNode.statement;
|
||||||
|
if (decrementNode.crementType.equals(CrementType.PREFIX)) {
|
||||||
|
decrementNode.accept(this); // crement
|
||||||
|
fieldOrObjectVarCrementAssign(assignNode); // assign
|
||||||
|
} else {
|
||||||
|
fieldOrObjectVarCrementAssign(assignNode); // assign
|
||||||
|
decrementNode.accept(this); // crement
|
||||||
|
}
|
||||||
}
|
}
|
||||||
} else {
|
} else {
|
||||||
assignFieldOrObjectVar(assignNode);
|
assignFieldOrObjectVar(assignNode);
|
||||||
}
|
}
|
||||||
} else { // local var
|
} else { // local var
|
||||||
if (assignNode.expression instanceof IncrementNode || assignNode.expression instanceof DecrementNode) {
|
if (assignNode.expression instanceof UnaryNode) {
|
||||||
localVarCrementAssign(assignNode);
|
UnaryNode unaryNode = (UnaryNode) assignNode.expression;
|
||||||
|
if (unaryNode.statement instanceof IncrementNode || unaryNode.statement instanceof DecrementNode) {
|
||||||
|
localVarCrementAssign(assignNode);
|
||||||
|
}
|
||||||
} else {
|
} else {
|
||||||
assignNode.expression.accept(this);
|
assignNode.expression.accept(this);
|
||||||
assignLocalVar(assignNode);
|
assignLocalVar(assignNode);
|
||||||
@@ -412,83 +454,40 @@ public class MethodCodeGen implements bytecode.visitor.MethodVisitor {
|
|||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
private void localVarCrementAssign(AssignNode assignNode) {
|
private void loadIncrement(IncrementNode incrementNode) {
|
||||||
if (assignNode.expression instanceof IncrementNode) {
|
AssignableNode assignableNode = incrementNode.assignableExpression;
|
||||||
IncrementNode incrementNode = (IncrementNode) assignNode.expression;
|
if (assignableNode.memberAccess != null) {
|
||||||
if (incrementNode.crementType.equals(CrementType.PREFIX)) { // ++i
|
assignableNode.memberAccess.accept(this);
|
||||||
incrementNode.accept(this);
|
} else {
|
||||||
assignLocalVar(assignNode);
|
if (assignableNode.typeNode instanceof BaseType) {
|
||||||
} else { // i++
|
methodVisitor.visitVarInsn(ILOAD, localVariables.indexOf(assignableNode.identifier));
|
||||||
loadBeforeCrement(assignNode);
|
} else if (assignableNode.typeNode instanceof ReferenceType) {
|
||||||
assignLocalVar(assignNode);
|
methodVisitor.visitVarInsn(ALOAD, localVariables.indexOf(assignableNode.identifier));
|
||||||
incrementNode.accept(this);
|
|
||||||
}
|
|
||||||
} else if (assignNode.expression instanceof DecrementNode) {
|
|
||||||
DecrementNode decrementNode = (DecrementNode) assignNode.expression;
|
|
||||||
if (decrementNode.crementType.equals(CrementType.PREFIX)) {
|
|
||||||
decrementNode.accept(this);
|
|
||||||
assignLocalVar(assignNode);
|
|
||||||
} else {
|
|
||||||
loadBeforeCrement(assignNode);
|
|
||||||
assignLocalVar(assignNode);
|
|
||||||
decrementNode.accept(this);
|
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
private void fieldOrObjectVarPrefixCrementAssign(AssignNode assignNode) {
|
private void loadDecrement(DecrementNode decrementNode) {
|
||||||
int localVarIndex = localVariables.indexOf(assignNode.assignable.identifier);
|
AssignableNode assignableNode = decrementNode.assignableExpression;
|
||||||
if(localVarIndex >= 0) { // object
|
if (assignableNode.memberAccess != null) {
|
||||||
methodVisitor.visitVarInsn(ALOAD, localVarIndex);
|
assignableNode.memberAccess.accept(this);
|
||||||
} else if(assignNode.assignable.memberAccess.thisExpr) { // field
|
|
||||||
methodVisitor.visitVarInsn(ALOAD, 0);
|
|
||||||
} else {
|
} else {
|
||||||
localVariables.add(assignNode.assignable.identifier);
|
if (assignableNode.typeNode instanceof BaseType) {
|
||||||
methodVisitor.visitVarInsn(ALOAD, localVariables.indexOf(assignNode.assignable.identifier));
|
methodVisitor.visitVarInsn(ILOAD, localVariables.indexOf(assignableNode.identifier));
|
||||||
|
} else if (assignableNode.typeNode instanceof ReferenceType) {
|
||||||
|
methodVisitor.visitVarInsn(ALOAD, localVariables.indexOf(assignableNode.identifier));
|
||||||
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
assignNode.expression.accept(this);
|
|
||||||
methodVisitor.visitInsn(DUP_X1);
|
|
||||||
|
|
||||||
if (assignNode.expression instanceof BaseType) {
|
|
||||||
methodVisitor.visitFieldInsn(PUTFIELD, assignNode.assignable.memberAccess.identifiers.get(0), assignNode.assignable.memberAccess.identifiers.get(1), mapper.getTypeChar((BaseType) assignNode.expression.getType()));
|
|
||||||
} else if (assignNode.expression instanceof ReferenceType) {
|
|
||||||
ReferenceType referenceType = (ReferenceType) assignNode.expression.getType();
|
|
||||||
methodVisitor.visitFieldInsn(PUTFIELD, assignNode.assignable.memberAccess.identifiers.get(0), assignNode.assignable.memberAccess.identifiers.get(1), "L" + referenceType.getIdentifier() + ";");
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
private void fieldOrObjectVarSuffixCrementAssign(AssignNode assignNode) {
|
|
||||||
int localVarIndex = localVariables.indexOf(assignNode.assignable.identifier);
|
|
||||||
if(localVarIndex >= 0) { // object
|
|
||||||
methodVisitor.visitVarInsn(ALOAD, localVarIndex);
|
|
||||||
} else if(assignNode.assignable.memberAccess.thisExpr) { // field
|
|
||||||
methodVisitor.visitVarInsn(ALOAD, 0);
|
|
||||||
} else {
|
|
||||||
localVariables.add(assignNode.assignable.identifier);
|
|
||||||
methodVisitor.visitVarInsn(ALOAD, localVariables.indexOf(assignNode.assignable.identifier));
|
|
||||||
}
|
|
||||||
|
|
||||||
loadBeforeCrement(assignNode);
|
|
||||||
|
|
||||||
if (assignNode.expression instanceof BaseType) {
|
|
||||||
methodVisitor.visitFieldInsn(PUTFIELD, assignNode.assignable.memberAccess.identifiers.get(0), assignNode.assignable.memberAccess.identifiers.get(1), mapper.getTypeChar((BaseType) assignNode.expression.getType()));
|
|
||||||
} else if (assignNode.expression instanceof ReferenceType) {
|
|
||||||
ReferenceType referenceType = (ReferenceType) assignNode.expression.getType();
|
|
||||||
methodVisitor.visitFieldInsn(PUTFIELD, assignNode.assignable.memberAccess.identifiers.get(0), assignNode.assignable.memberAccess.identifiers.get(1), "L" + referenceType.getIdentifier() + ";");
|
|
||||||
}
|
|
||||||
|
|
||||||
assignNode.expression.accept(this);
|
|
||||||
}
|
}
|
||||||
|
|
||||||
private void assignLocalVar(AssignNode assignNode) {
|
private void assignLocalVar(AssignNode assignNode) {
|
||||||
methodVisitor.visitInsn(DUP);
|
|
||||||
if (!localVariables.contains(assignNode.assignable.identifier)) {
|
if (!localVariables.contains(assignNode.assignable.identifier)) {
|
||||||
localVariables.add(assignNode.assignable.identifier);
|
localVariables.add(assignNode.assignable.identifier);
|
||||||
}
|
}
|
||||||
if (assignNode.expression instanceof BaseType) {
|
|
||||||
|
if (assignNode.expression.getType() instanceof BaseType) {
|
||||||
methodVisitor.visitVarInsn(ISTORE, localVariables.indexOf(assignNode.assignable.identifier));
|
methodVisitor.visitVarInsn(ISTORE, localVariables.indexOf(assignNode.assignable.identifier));
|
||||||
} else if (assignNode.expression instanceof ReferenceType) {
|
} else if (assignNode.expression.getType() instanceof ReferenceType) {
|
||||||
methodVisitor.visitVarInsn(ASTORE, localVariables.indexOf(assignNode.assignable.identifier));
|
methodVisitor.visitVarInsn(ASTORE, localVariables.indexOf(assignNode.assignable.identifier));
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
@@ -501,46 +500,78 @@ public class MethodCodeGen implements bytecode.visitor.MethodVisitor {
|
|||||||
methodVisitor.visitVarInsn(ALOAD, 0);
|
methodVisitor.visitVarInsn(ALOAD, 0);
|
||||||
} else {
|
} else {
|
||||||
localVariables.add(assignNode.assignable.identifier);
|
localVariables.add(assignNode.assignable.identifier);
|
||||||
methodVisitor.visitVarInsn(ALOAD, localVariables.indexOf(assignNode.assignable.identifier));
|
|
||||||
}
|
}
|
||||||
|
|
||||||
assignNode.expression.accept(this);
|
assignNode.expression.accept(this);
|
||||||
methodVisitor.visitInsn(DUP_X1);
|
|
||||||
|
|
||||||
if (assignNode.expression instanceof BaseType) {
|
if (assignNode.expression.getType() instanceof BaseType) {
|
||||||
methodVisitor.visitFieldInsn(PUTFIELD, assignNode.assignable.memberAccess.identifiers.get(0), assignNode.assignable.memberAccess.identifiers.get(1), mapper.getTypeChar((BaseType) assignNode.expression.getType()));
|
methodVisitor.visitFieldInsn(PUTFIELD, assignNode.assignable.memberAccess.identifiers.get(0), assignNode.assignable.memberAccess.identifiers.get(1), mapper.getTypeChar((BaseType) assignNode.expression.getType()));
|
||||||
} else if (assignNode.expression instanceof ReferenceType) {
|
} else if (assignNode.expression.getType() instanceof ReferenceType) {
|
||||||
ReferenceType referenceType = (ReferenceType) assignNode.expression.getType();
|
ReferenceType referenceType = (ReferenceType) assignNode.expression.getType();
|
||||||
methodVisitor.visitFieldInsn(PUTFIELD, assignNode.assignable.memberAccess.identifiers.get(0), assignNode.assignable.memberAccess.identifiers.get(1), "L" + referenceType.getIdentifier() + ";");
|
methodVisitor.visitFieldInsn(PUTFIELD, assignNode.assignable.memberAccess.identifiers.get(0), assignNode.assignable.memberAccess.identifiers.get(1), "L" + referenceType.getIdentifier() + ";");
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
private void loadBeforeCrement(AssignNode assignNode) {
|
private void localVarCrementAssign(AssignNode assignNode) {
|
||||||
if(assignNode.expression instanceof IncrementNode) {
|
UnaryNode unaryNode = (UnaryNode) assignNode.expression;
|
||||||
IncrementNode incrementNode = (IncrementNode) assignNode.expression;
|
if (unaryNode.statement instanceof IncrementNode) {
|
||||||
if(incrementNode.assignableExpression.memberAccess != null) {
|
IncrementNode incrementNode = (IncrementNode) unaryNode.statement;
|
||||||
incrementNode.assignableExpression.memberAccess.accept(this);
|
if (incrementNode.crementType.equals(CrementType.PREFIX)) { // ++i
|
||||||
} else {
|
incrementNode.accept(this);
|
||||||
if(assignNode.assignable.getTypeNode() instanceof BaseType) {
|
incrementNode.assignableExpression.typeNode = unaryNode.getType();
|
||||||
methodVisitor.visitVarInsn(ILOAD, localVariables.indexOf(assignNode.assignable.identifier));
|
loadIncrement(incrementNode);
|
||||||
} else if(assignNode.assignable.getTypeNode() instanceof ReferenceType) {
|
assignLocalVar(assignNode);
|
||||||
methodVisitor.visitVarInsn(ALOAD, localVariables.indexOf(assignNode.assignable.identifier));
|
} else { // i++
|
||||||
}
|
incrementNode.assignableExpression.typeNode = unaryNode.getType();
|
||||||
|
loadIncrement(incrementNode);
|
||||||
|
assignLocalVar(assignNode);
|
||||||
|
incrementNode.accept(this);
|
||||||
}
|
}
|
||||||
} else if(assignNode.expression instanceof DecrementNode) {
|
} else if (unaryNode.statement instanceof DecrementNode) {
|
||||||
DecrementNode decrementNode = (DecrementNode) assignNode.expression;
|
DecrementNode decrementNode = (DecrementNode) unaryNode.statement;
|
||||||
if(decrementNode.assignableExpression.memberAccess != null) {
|
if (decrementNode.crementType.equals(CrementType.PREFIX)) {
|
||||||
decrementNode.assignableExpression.memberAccess.accept(this);
|
decrementNode.accept(this);
|
||||||
|
decrementNode.assignableExpression.typeNode = unaryNode.getType();
|
||||||
|
loadDecrement(decrementNode);
|
||||||
|
assignLocalVar(assignNode);
|
||||||
} else {
|
} else {
|
||||||
if(assignNode.assignable.getTypeNode() instanceof BaseType) {
|
decrementNode.assignableExpression.typeNode = unaryNode.getType();
|
||||||
methodVisitor.visitVarInsn(ILOAD, localVariables.indexOf(assignNode.assignable.identifier));
|
loadDecrement(decrementNode);
|
||||||
} else if(assignNode.assignable.getTypeNode() instanceof ReferenceType) {
|
assignLocalVar(assignNode);
|
||||||
methodVisitor.visitVarInsn(ALOAD, localVariables.indexOf(assignNode.assignable.identifier));
|
decrementNode.accept(this);
|
||||||
}
|
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
private void fieldOrObjectVarCrementAssign(AssignNode assignNode) {
|
||||||
|
int localVarIndex = localVariables.indexOf(assignNode.assignable.identifier);
|
||||||
|
if (localVarIndex >= 0) { // object
|
||||||
|
methodVisitor.visitVarInsn(ALOAD, localVarIndex);
|
||||||
|
} else if (assignNode.assignable.memberAccess.thisExpr) { // field
|
||||||
|
methodVisitor.visitVarInsn(ALOAD, 0);
|
||||||
|
} else {
|
||||||
|
localVariables.add(assignNode.assignable.identifier);
|
||||||
|
}
|
||||||
|
|
||||||
|
UnaryNode unaryNode = (UnaryNode) assignNode.expression;
|
||||||
|
if (unaryNode.statement instanceof IncrementNode) {
|
||||||
|
IncrementNode incrementNode = (IncrementNode) unaryNode.statement;
|
||||||
|
incrementNode.assignableExpression.typeNode = unaryNode.getType();
|
||||||
|
loadIncrement((incrementNode));
|
||||||
|
} else if (unaryNode.statement instanceof DecrementNode) {
|
||||||
|
DecrementNode decrementNode = (DecrementNode) unaryNode.statement;
|
||||||
|
decrementNode.assignableExpression.typeNode = unaryNode.getType();
|
||||||
|
loadDecrement(decrementNode);
|
||||||
|
}
|
||||||
|
|
||||||
|
if (assignNode.expression.getType() instanceof BaseType) {
|
||||||
|
methodVisitor.visitFieldInsn(PUTFIELD, assignNode.assignable.memberAccess.identifiers.get(0), assignNode.assignable.memberAccess.identifiers.get(1), mapper.getTypeChar((BaseType) assignNode.expression.getType()));
|
||||||
|
} else if (assignNode.expression.getType() instanceof ReferenceType) {
|
||||||
|
ReferenceType referenceType = (ReferenceType) assignNode.expression.getType();
|
||||||
|
methodVisitor.visitFieldInsn(PUTFIELD, assignNode.assignable.memberAccess.identifiers.get(0), assignNode.assignable.memberAccess.identifiers.get(1), "L" + referenceType.getIdentifier() + ";");
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
@Override
|
@Override
|
||||||
public void visit(IncrementNode incrementNode) {
|
public void visit(IncrementNode incrementNode) {
|
||||||
if (incrementNode.assignableExpression.memberAccess != null) { // Object var / field
|
if (incrementNode.assignableExpression.memberAccess != null) { // Object var / field
|
||||||
@@ -555,7 +586,6 @@ public class MethodCodeGen implements bytecode.visitor.MethodVisitor {
|
|||||||
} else if (incrementNode.assignableExpression.memberAccess.getTypeNode() instanceof ReferenceType) {
|
} else if (incrementNode.assignableExpression.memberAccess.getTypeNode() instanceof ReferenceType) {
|
||||||
methodVisitor.visitFieldInsn(GETFIELD, incrementNode.assignableExpression.memberAccess.identifiers.get(0), incrementNode.assignableExpression.memberAccess.identifiers.get(1), "L" + (((ReferenceType) incrementNode.assignableExpression.memberAccess.getTypeNode()).getIdentifier() + ";"));
|
methodVisitor.visitFieldInsn(GETFIELD, incrementNode.assignableExpression.memberAccess.identifiers.get(0), incrementNode.assignableExpression.memberAccess.identifiers.get(1), "L" + (((ReferenceType) incrementNode.assignableExpression.memberAccess.getTypeNode()).getIdentifier() + ";"));
|
||||||
}
|
}
|
||||||
methodVisitor.visitInsn(DUP);
|
|
||||||
methodVisitor.visitInsn(ICONST_1);
|
methodVisitor.visitInsn(ICONST_1);
|
||||||
methodVisitor.visitInsn(IADD);
|
methodVisitor.visitInsn(IADD);
|
||||||
if (incrementNode.assignableExpression.memberAccess.getTypeNode() instanceof BaseType) {
|
if (incrementNode.assignableExpression.memberAccess.getTypeNode() instanceof BaseType) {
|
||||||
@@ -577,7 +607,6 @@ public class MethodCodeGen implements bytecode.visitor.MethodVisitor {
|
|||||||
} else { // this
|
} else { // this
|
||||||
methodVisitor.visitVarInsn(ALOAD, 0);
|
methodVisitor.visitVarInsn(ALOAD, 0);
|
||||||
}
|
}
|
||||||
methodVisitor.visitInsn(DUP);
|
|
||||||
if (decrementNode.assignableExpression.memberAccess.getTypeNode() instanceof BaseType) {
|
if (decrementNode.assignableExpression.memberAccess.getTypeNode() instanceof BaseType) {
|
||||||
methodVisitor.visitFieldInsn(GETFIELD, decrementNode.assignableExpression.memberAccess.identifiers.get(0), decrementNode.assignableExpression.memberAccess.identifiers.get(1), mapper.getTypeChar((BaseType) decrementNode.assignableExpression.memberAccess.getTypeNode()));
|
methodVisitor.visitFieldInsn(GETFIELD, decrementNode.assignableExpression.memberAccess.identifiers.get(0), decrementNode.assignableExpression.memberAccess.identifiers.get(1), mapper.getTypeChar((BaseType) decrementNode.assignableExpression.memberAccess.getTypeNode()));
|
||||||
} else if (decrementNode.assignableExpression.memberAccess.getTypeNode() instanceof ReferenceType) {
|
} else if (decrementNode.assignableExpression.memberAccess.getTypeNode() instanceof ReferenceType) {
|
||||||
@@ -650,6 +679,21 @@ public class MethodCodeGen implements bytecode.visitor.MethodVisitor {
|
|||||||
} else { // Return something
|
} else { // Return something
|
||||||
// Process expression
|
// Process expression
|
||||||
returnNode.expression.accept(this);
|
returnNode.expression.accept(this);
|
||||||
|
|
||||||
|
if (returnNode.expression instanceof UnaryNode) {
|
||||||
|
UnaryNode unaryNode = (UnaryNode) returnNode.expression;
|
||||||
|
if (unaryNode.statement instanceof IncrementNode) {
|
||||||
|
IncrementNode incrementNode = (IncrementNode) unaryNode.statement;
|
||||||
|
incrementNode.assignableExpression.typeNode = unaryNode.getType();
|
||||||
|
loadIncrement(incrementNode);
|
||||||
|
}
|
||||||
|
if (unaryNode.statement instanceof DecrementNode) {
|
||||||
|
DecrementNode decrementNode = (DecrementNode) unaryNode.statement;
|
||||||
|
decrementNode.assignableExpression.typeNode = unaryNode.getType();
|
||||||
|
loadDecrement(decrementNode);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
// Return result of expression
|
// Return result of expression
|
||||||
if (returnNode.expression.getType() instanceof BaseType) {
|
if (returnNode.expression.getType() instanceof BaseType) {
|
||||||
methodVisitor.visitInsn(IRETURN);
|
methodVisitor.visitInsn(IRETURN);
|
||||||
@@ -679,10 +723,22 @@ public class MethodCodeGen implements bytecode.visitor.MethodVisitor {
|
|||||||
@Override
|
@Override
|
||||||
public void visit(MethodCallNode methodCallNode) {
|
public void visit(MethodCallNode methodCallNode) {
|
||||||
List<ParameterNode> parameterNodes = new ArrayList<>();
|
List<ParameterNode> parameterNodes = new ArrayList<>();
|
||||||
|
int localVarIndex = -1;
|
||||||
|
if (methodCallNode.target.memberAccess.identifiers.size() > 1) {
|
||||||
|
localVarIndex = localVariables.indexOf(methodCallNode.target.memberAccess.identifiers.get(1));
|
||||||
|
}
|
||||||
|
if (localVarIndex >= 0) { // local var object
|
||||||
|
methodVisitor.visitVarInsn(ALOAD, localVarIndex);
|
||||||
|
} else { // this field
|
||||||
|
methodVisitor.visitVarInsn(ALOAD, 0);
|
||||||
|
}
|
||||||
for (IExpressionNode expressionNode : methodCallNode.parameters) {
|
for (IExpressionNode expressionNode : methodCallNode.parameters) {
|
||||||
expressionNode.accept(this);
|
expressionNode.accept(this);
|
||||||
parameterNodes.add(new ParameterNode(expressionNode.getType(), ""));
|
parameterNodes.add(new ParameterNode(expressionNode.getType(), ""));
|
||||||
}
|
}
|
||||||
|
if(methodCallNode.type == null) {
|
||||||
|
methodCallNode.type = new BaseType(TypeEnum.INT);
|
||||||
|
}
|
||||||
methodVisitor.visitMethodInsn(INVOKEVIRTUAL, methodCallNode.target.memberAccess.identifiers.get(0), methodCallNode.identifier, mapper.generateMethodDescriptor(methodCallNode.type, parameterNodes), false);
|
methodVisitor.visitMethodInsn(INVOKEVIRTUAL, methodCallNode.target.memberAccess.identifiers.get(0), methodCallNode.identifier, mapper.generateMethodDescriptor(methodCallNode.type, parameterNodes), false);
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
@@ -8,48 +8,58 @@ import ast.members.ConstructorNode;
|
|||||||
import ast.members.MainMethodNode;
|
import ast.members.MainMethodNode;
|
||||||
import ast.members.MethodNode;
|
import ast.members.MethodNode;
|
||||||
import ast.statementexpressions.AssignNode;
|
import ast.statementexpressions.AssignNode;
|
||||||
import ast.statementexpressions.AssignableNode;
|
|
||||||
import ast.statementexpressions.NewDeclarationNode;
|
import ast.statementexpressions.NewDeclarationNode;
|
||||||
import ast.statementexpressions.crementexpressions.DecrementNode;
|
import ast.statementexpressions.crementexpressions.DecrementNode;
|
||||||
import ast.statementexpressions.crementexpressions.IncrementNode;
|
import ast.statementexpressions.crementexpressions.IncrementNode;
|
||||||
import ast.statementexpressions.methodcallstatementnexpressions.ChainedMethodNode;
|
import ast.statementexpressions.methodcallstatementnexpressions.ChainedMethodNode;
|
||||||
import ast.statementexpressions.methodcallstatementnexpressions.MethodCallNode;
|
import ast.statementexpressions.methodcallstatementnexpressions.MethodCallNode;
|
||||||
import ast.statementexpressions.methodcallstatementnexpressions.TargetNode;
|
|
||||||
import ast.statements.*;
|
import ast.statements.*;
|
||||||
import ast.type.ValueNode;
|
import ast.type.ValueNode;
|
||||||
|
|
||||||
public interface MethodVisitor {
|
public interface MethodVisitor {
|
||||||
// members
|
// members
|
||||||
void visit(ConstructorNode constructorNode);
|
void visit(ConstructorNode constructorNode);
|
||||||
|
|
||||||
void visit(MethodNode methodNode);
|
void visit(MethodNode methodNode);
|
||||||
|
|
||||||
void visit(MainMethodNode mainMethodNode);
|
void visit(MainMethodNode mainMethodNode);
|
||||||
|
|
||||||
// Binary expressions
|
// Binary expressions
|
||||||
void visit(BinaryNode binaryNode);
|
void visit(BinaryNode binaryNode);
|
||||||
|
|
||||||
void visit(CalculationNode calculationNode);
|
void visit(CalculationNode calculationNode);
|
||||||
|
|
||||||
void visit(DotNode dotNode);
|
void visit(DotNode dotNode);
|
||||||
void visit(DotSubstractionNode dotSubstractionNode);
|
|
||||||
|
void visit(DotSubtractionNode dotSubtractionNode);
|
||||||
|
|
||||||
void visit(NonCalculationNode nonCalculationNode);
|
void visit(NonCalculationNode nonCalculationNode);
|
||||||
|
|
||||||
// Unary expressions
|
// Unary expressions
|
||||||
void visit(MemberAccessNode memberAccessNode);
|
void visit(MemberAccessNode memberAccessNode);
|
||||||
|
|
||||||
void visit(NotNode notExpressionNode);
|
void visit(NotNode notExpressionNode);
|
||||||
|
|
||||||
void visit(UnaryNode unaryExpressionNode);
|
void visit(UnaryNode unaryExpressionNode);
|
||||||
|
|
||||||
// statements
|
// statements
|
||||||
|
void visit(BlockNode blockNode);
|
||||||
void visit(IfElseNode ifElseNode);
|
void visit(IfElseNode ifElseNode);
|
||||||
|
|
||||||
void visit(IncrementNode incrementNode);
|
void visit(IncrementNode incrementNode);
|
||||||
void visit(DecrementNode decrementNode);
|
void visit(DecrementNode decrementNode);
|
||||||
|
|
||||||
void visit(LocalVariableDeclarationNode localVariableDeclarationNode);
|
void visit(LocalVariableDeclarationNode localVariableDeclarationNode);
|
||||||
|
|
||||||
void visit(ReturnNode returnNode);
|
void visit(ReturnNode returnNode);
|
||||||
|
|
||||||
void visit(WhileNode whileNode);
|
void visit(WhileNode whileNode);
|
||||||
|
|
||||||
// statement expression
|
// statement expression
|
||||||
void visit(MethodCallNode methodCallNode);
|
void visit(MethodCallNode methodCallNode);
|
||||||
|
|
||||||
void visit(AssignNode assignNode);
|
void visit(AssignNode assignNode);
|
||||||
|
|
||||||
void visit(NewDeclarationNode newDeclarationNode);
|
void visit(NewDeclarationNode newDeclarationNode);
|
||||||
|
|
||||||
// type
|
// type
|
||||||
|
@@ -3,5 +3,5 @@ package bytecode.visitor;
|
|||||||
import ast.ProgramNode;
|
import ast.ProgramNode;
|
||||||
|
|
||||||
public interface ProgramVisitor {
|
public interface ProgramVisitor {
|
||||||
void visit(ProgramNode programNode);
|
void visit(ProgramNode programNode);
|
||||||
}
|
}
|
||||||
|
@@ -15,12 +15,11 @@ import java.io.IOException;
|
|||||||
import java.nio.file.Paths;
|
import java.nio.file.Paths;
|
||||||
import java.util.Optional;
|
import java.util.Optional;
|
||||||
|
|
||||||
|
|
||||||
/**
|
/**
|
||||||
* Start Raupenpiler using make:
|
* Start miniCompiler using make:
|
||||||
* <p> <code> cd .\src\test\ </code>
|
* <p> <code> cd .\src\test\ </code>
|
||||||
* <p> <code> make clean compile-raupenpiler </code>
|
* <p> <code> make clean compile-miniCompiler </code>
|
||||||
* <p> Start Raupenpiler using jar:
|
* <p> Start miniCompiler using jar:
|
||||||
* <p> <code> java.exe -DgenJar=true_OR_false -DgenClass=true_OR_false -jar path_to_jar\JavaCompiler-1.0-jar-with-dependencies.jar 'path_to_input_file.java' 'path_to_output_directory' </code>
|
* <p> <code> java.exe -DgenJar=true_OR_false -DgenClass=true_OR_false -jar path_to_jar\JavaCompiler-1.0-jar-with-dependencies.jar 'path_to_input_file.java' 'path_to_output_directory' </code>
|
||||||
* <p> Example (jar needs to be in the target directory, compile with make or mvn package first):
|
* <p> Example (jar needs to be in the target directory, compile with make or mvn package first):
|
||||||
* <code> java.exe -DgenJar=true -DgenClass=true -jar .\target\JavaCompiler-1.0-jar-with-dependencies.jar 'src/main/resources/input/CompilerInput.java' 'src/main/resources/output' </code>
|
* <code> java.exe -DgenJar=true -DgenClass=true -jar .\target\JavaCompiler-1.0-jar-with-dependencies.jar 'src/main/resources/input/CompilerInput.java' 'src/main/resources/output' </code>
|
||||||
@@ -40,16 +39,14 @@ public class Main {
|
|||||||
System.err.println("Error reading the file: " + e.getMessage());
|
System.err.println("Error reading the file: " + e.getMessage());
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
/* !!! Else Branch (main ohne args starten) ist nicht zur Verwendung vorgesehen, immer mit args starten !!!
|
|
||||||
else {
|
else {
|
||||||
try {
|
try {
|
||||||
CharStream codeCharStream = CharStreams.fromPath(Paths.get("src/main/resources/input/CompilerInput.java"));
|
CharStream codeCharStream = CharStreams.fromPath(Paths.get("src/test/resources/input/finalTest/Car.java"));
|
||||||
compileFile(codeCharStream);
|
compileFile(codeCharStream, "src/test/resources/input/finalTest");
|
||||||
} catch (IOException e) {
|
} catch (IOException e) {
|
||||||
System.err.println("Error reading the file: " + e.getMessage());
|
System.err.println("Error reading the file: " + e.getMessage());
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
*/
|
|
||||||
}
|
}
|
||||||
|
|
||||||
/**
|
/**
|
||||||
@@ -66,7 +63,7 @@ public class Main {
|
|||||||
*/
|
*/
|
||||||
static void compileFile(CharStream inputCharStream, String outputDirectoryPath) {
|
static void compileFile(CharStream inputCharStream, String outputDirectoryPath) {
|
||||||
// Initialize the logger
|
// Initialize the logger
|
||||||
new RaupenLogger();
|
new MiniCompilerLogger();
|
||||||
|
|
||||||
/* ------------------------- Scanner -> tokens ------------------------- */
|
/* ------------------------- Scanner -> tokens ------------------------- */
|
||||||
// Use the SimpleJavaLexer to tokenize the input CharStream
|
// Use the SimpleJavaLexer to tokenize the input CharStream
|
||||||
@@ -74,27 +71,27 @@ public class Main {
|
|||||||
CommonTokenStream tokenStream = new CommonTokenStream(lexer);
|
CommonTokenStream tokenStream = new CommonTokenStream(lexer);
|
||||||
tokenStream.fill();
|
tokenStream.fill();
|
||||||
// Log the tokens
|
// Log the tokens
|
||||||
RaupenLogger.logScanner(tokenStream);
|
MiniCompilerLogger.logScanner(tokenStream);
|
||||||
|
|
||||||
/*------------------------- Parser -> Parsetree -------------------------*/
|
/*------------------------- Parser -> Parsetree -------------------------*/
|
||||||
// Use the SimpleJavaParser to parse the tokens and generate a ParseTree
|
// Use the SimpleJavaParser to parse the tokens and generate a ParseTree
|
||||||
SimpleJavaParser parser = new SimpleJavaParser(tokenStream);
|
SimpleJavaParser parser = new SimpleJavaParser(tokenStream);
|
||||||
ParseTree parseTree = parser.program(); // parse the input
|
ParseTree parseTree = parser.program(); // parse the input
|
||||||
// Log the ParseTree
|
// Log the ParseTree
|
||||||
RaupenLogger.logParser(parseTree, parser);
|
MiniCompilerLogger.logParser(parseTree, parser);
|
||||||
|
|
||||||
/*------------------------- AST builder -> AST -------------------------*/
|
/*------------------------- AST builder -> AST -------------------------*/
|
||||||
// Use the ASTBuilder to visit the ParseTree and generate an Abstract Syntax Tree (AST)
|
// Use the ASTBuilder to visit the ParseTree and generate an Abstract Syntax Tree (AST)
|
||||||
ASTBuilder astBuilder = new ASTBuilder();
|
ASTBuilder astBuilder = new ASTBuilder();
|
||||||
ASTNode abstractSyntaxTree = astBuilder.visit(parseTree);
|
ASTNode abstractSyntaxTree = astBuilder.visit(parseTree);
|
||||||
// Log the AST
|
// Log the AST
|
||||||
RaupenLogger.logAST(abstractSyntaxTree);
|
MiniCompilerLogger.logAST(abstractSyntaxTree);
|
||||||
|
|
||||||
/*------------------------- Semantic Analyzer -> typed AST -------------------------*/
|
/*------------------------- Semantic Analyzer -> typed AST -------------------------*/
|
||||||
// Use the SemanticAnalyzer to generate a typed AST
|
// Use the SemanticAnalyzer to generate a typed AST
|
||||||
ASTNode typedAst = SemanticAnalyzer.generateTast(abstractSyntaxTree);
|
ASTNode typedAst = SemanticAnalyzer.generateTast(abstractSyntaxTree);
|
||||||
// Log the typed AST
|
// Log the typed AST
|
||||||
RaupenLogger.logSemanticAnalyzer(typedAst);
|
MiniCompilerLogger.logSemanticAnalyzer(typedAst);
|
||||||
|
|
||||||
if(SemanticAnalyzer.errors.isEmpty()){
|
if(SemanticAnalyzer.errors.isEmpty()){
|
||||||
/*------------------------- Bytecode Generator -> Bytecode -------------------------*/
|
/*------------------------- Bytecode Generator -> Bytecode -------------------------*/
|
||||||
@@ -107,7 +104,7 @@ public class Main {
|
|||||||
assert typedAst != null;
|
assert typedAst != null;
|
||||||
byteCodeGenerator.visit((ProgramNode) typedAst);
|
byteCodeGenerator.visit((ProgramNode) typedAst);
|
||||||
// Log the bytecode generation
|
// Log the bytecode generation
|
||||||
RaupenLogger.logBytecodeGenerator();
|
MiniCompilerLogger.logBytecodeGenerator();
|
||||||
} else {
|
} else {
|
||||||
for(Exception exception : SemanticAnalyzer.errors){
|
for(Exception exception : SemanticAnalyzer.errors){
|
||||||
exception.printStackTrace();
|
exception.printStackTrace();
|
||||||
|
@@ -29,11 +29,15 @@ import java.util.logging.*;
|
|||||||
* <code>consoleHandler.setLevel(Level.OFF);</code>
|
* <code>consoleHandler.setLevel(Level.OFF);</code>
|
||||||
* <code>fileHandler.setLevel(Level.ALL);</code>
|
* <code>fileHandler.setLevel(Level.ALL);</code>
|
||||||
*/
|
*/
|
||||||
public class RaupenLogger {
|
|
||||||
|
|
||||||
static Logger logger = Logger.getLogger("RaupenLogs");
|
|
||||||
|
|
||||||
public RaupenLogger() {
|
|
||||||
|
|
||||||
|
public class MiniCompilerLogger {
|
||||||
|
|
||||||
|
static Logger logger = Logger.getLogger("miniCompilerLogs");
|
||||||
|
|
||||||
|
public MiniCompilerLogger() {
|
||||||
// ------------------------- Logging -------------------------
|
// ------------------------- Logging -------------------------
|
||||||
logger.setLevel(Level.ALL);
|
logger.setLevel(Level.ALL);
|
||||||
logger.getParent().getHandlers()[0].setLevel(Level.ALL);
|
logger.getParent().getHandlers()[0].setLevel(Level.ALL);
|
||||||
@@ -66,14 +70,16 @@ public class RaupenLogger {
|
|||||||
logger.addHandler(consoleHandler);
|
logger.addHandler(consoleHandler);
|
||||||
|
|
||||||
// Configure file handler
|
// Configure file handler
|
||||||
Handler fileHandler = new FileHandler("src/main/resources/logs/RaupenLog.log");
|
Handler fileHandler = new FileHandler("src/main/resources/logs/miniCompiler.log");
|
||||||
// Toggle file logging on/off
|
// Toggle file logging on/off
|
||||||
fileHandler.setLevel(Level.ALL);
|
fileHandler.setLevel(Level.ALL);
|
||||||
fileHandler.setFormatter(new CustomFormatter());
|
fileHandler.setFormatter(new CustomFormatter());
|
||||||
logger.addHandler(fileHandler);
|
logger.addHandler(fileHandler);
|
||||||
|
|
||||||
} catch (SecurityException | IOException e) {
|
} catch (SecurityException e) {
|
||||||
e.printStackTrace();
|
e.printStackTrace();
|
||||||
|
} catch (IOException e) {
|
||||||
|
throw new RuntimeException(e);
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
@@ -102,7 +108,7 @@ public class RaupenLogger {
|
|||||||
public static void logAST(ASTNode abstractSyntaxTree) {
|
public static void logAST(ASTNode abstractSyntaxTree) {
|
||||||
// Printing the AST
|
// Printing the AST
|
||||||
logger.info("-------------------- AST builder -> AST --------------------");
|
logger.info("-------------------- AST builder -> AST --------------------");
|
||||||
// logger.info("AST: " + ast.toString());
|
logger.info("Abstract Syntax Tree generated, Startnode:");
|
||||||
logAST(abstractSyntaxTree, 0);
|
logAST(abstractSyntaxTree, 0);
|
||||||
logger.info("\n");
|
logger.info("\n");
|
||||||
}
|
}
|
||||||
@@ -110,14 +116,15 @@ public class RaupenLogger {
|
|||||||
public static void logSemanticAnalyzer(ASTNode typedAst) {
|
public static void logSemanticAnalyzer(ASTNode typedAst) {
|
||||||
// Printing the typed AST
|
// Printing the typed AST
|
||||||
logger.info("-------------------- Semantic Analyzer -> typed AST --------------------");
|
logger.info("-------------------- Semantic Analyzer -> typed AST --------------------");
|
||||||
logAST(typedAst, 0);
|
// logAST(typedAst, 0);
|
||||||
|
logger.info("Typed Abstract Syntax Tree generated without errors");
|
||||||
logger.info("\n");
|
logger.info("\n");
|
||||||
}
|
}
|
||||||
|
|
||||||
public static void logBytecodeGenerator() {
|
public static void logBytecodeGenerator() {
|
||||||
// Printing the bytecode
|
// Printing the bytecode
|
||||||
logger.info("-------------------- Bytecode Generator -> Bytecode --------------------");
|
logger.info("-------------------- Bytecode Generator -> Bytecode --------------------");
|
||||||
logger.info("Bytecode generated");
|
logger.info("Bytecode generated without errors");
|
||||||
logger.info("\n");
|
logger.info("\n");
|
||||||
}
|
}
|
||||||
|
|
||||||
@@ -164,7 +171,6 @@ public class RaupenLogger {
|
|||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
// TODO: Fix this method
|
|
||||||
public static void logAST(ASTNode abstractSyntaxTree, int indent) {
|
public static void logAST(ASTNode abstractSyntaxTree, int indent) {
|
||||||
if (abstractSyntaxTree == null) {
|
if (abstractSyntaxTree == null) {
|
||||||
logger.severe("AST is null !!!");
|
logger.severe("AST is null !!!");
|
||||||
@@ -172,9 +178,9 @@ public class RaupenLogger {
|
|||||||
}
|
}
|
||||||
String indentString = " ".repeat(indent * 2);
|
String indentString = " ".repeat(indent * 2);
|
||||||
logger.info(indentString + abstractSyntaxTree.getClass());
|
logger.info(indentString + abstractSyntaxTree.getClass());
|
||||||
//for (ASTNode child : abstractSyntaxTree.getChildren()) {
|
// for (ASTNode child : abstractSyntaxTree.getChildren()) {
|
||||||
// logAST(child, indent + 1);
|
// logAST(child, indent + 1);
|
||||||
// }
|
// }
|
||||||
|
|
||||||
}
|
}
|
||||||
}
|
}
|
@@ -30,7 +30,18 @@ import parser.generated.*;
|
|||||||
import java.util.ArrayList;
|
import java.util.ArrayList;
|
||||||
import java.util.List;
|
import java.util.List;
|
||||||
|
|
||||||
|
/**
|
||||||
|
* ASTBuilder is a visitor that converts the parse tree into an abstract syntax tree (AST).
|
||||||
|
*/
|
||||||
public class ASTBuilder extends SimpleJavaBaseVisitor<ASTNode> {
|
public class ASTBuilder extends SimpleJavaBaseVisitor<ASTNode> {
|
||||||
|
|
||||||
|
/**
|
||||||
|
* Visits a program node and creates a ProgramNode.
|
||||||
|
* It iterates through all class declarations in the context and adds them to the ProgramNode.
|
||||||
|
*
|
||||||
|
* @param ctx the program context
|
||||||
|
* @return the AST node for the program
|
||||||
|
*/
|
||||||
@Override
|
@Override
|
||||||
public ASTNode visitProgram(SimpleJavaParser.ProgramContext ctx) {
|
public ASTNode visitProgram(SimpleJavaParser.ProgramContext ctx) {
|
||||||
ProgramNode program = new ProgramNode();
|
ProgramNode program = new ProgramNode();
|
||||||
@@ -40,6 +51,14 @@ public class ASTBuilder extends SimpleJavaBaseVisitor<ASTNode> {
|
|||||||
return program;
|
return program;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
|
||||||
|
/**
|
||||||
|
* Visits a class declaration and creates a ClassNode.
|
||||||
|
* It checks for an access modifier, processes member declarations, and ensures the class has a constructor.
|
||||||
|
*
|
||||||
|
* @param ctx the class declaration context
|
||||||
|
* @return the AST node for the class
|
||||||
|
*/
|
||||||
@Override
|
@Override
|
||||||
public ASTNode visitClassDeclaration(SimpleJavaParser.ClassDeclarationContext ctx) {
|
public ASTNode visitClassDeclaration(SimpleJavaParser.ClassDeclarationContext ctx) {
|
||||||
ClassNode classNode;
|
ClassNode classNode;
|
||||||
@@ -71,6 +90,13 @@ public class ASTBuilder extends SimpleJavaBaseVisitor<ASTNode> {
|
|||||||
return classNode;
|
return classNode;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
/**
|
||||||
|
* Visits a constructor declaration and creates a ConstructorNode.
|
||||||
|
* It processes access modifiers, block statements, and parameters.
|
||||||
|
*
|
||||||
|
* @param ctx the constructor declaration context
|
||||||
|
* @return the AST node for the constructor
|
||||||
|
*/
|
||||||
@Override
|
@Override
|
||||||
public ASTNode visitConstructorDeclaration(SimpleJavaParser.ConstructorDeclarationContext ctx) {
|
public ASTNode visitConstructorDeclaration(SimpleJavaParser.ConstructorDeclarationContext ctx) {
|
||||||
ConstructorNode constructorNode;
|
ConstructorNode constructorNode;
|
||||||
@@ -88,6 +114,13 @@ public class ASTBuilder extends SimpleJavaBaseVisitor<ASTNode> {
|
|||||||
return constructorNode;
|
return constructorNode;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
/**
|
||||||
|
* Visits a method declaration and creates a MethodNode or MainMethodNode.
|
||||||
|
* It handles method types, access modifiers, block statements, and parameters.
|
||||||
|
*
|
||||||
|
* @param ctx the method declaration context
|
||||||
|
* @return the AST node for the method
|
||||||
|
*/
|
||||||
@Override
|
@Override
|
||||||
public ASTNode visitMethodDeclaration(SimpleJavaParser.MethodDeclarationContext ctx) {
|
public ASTNode visitMethodDeclaration(SimpleJavaParser.MethodDeclarationContext ctx) {
|
||||||
if(ctx.MainMethodDeclaration() != null) {
|
if(ctx.MainMethodDeclaration() != null) {
|
||||||
@@ -137,6 +170,14 @@ public class ASTBuilder extends SimpleJavaBaseVisitor<ASTNode> {
|
|||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
|
||||||
|
/**
|
||||||
|
* Visits a field declaration and creates a FieldNode.
|
||||||
|
* It handles access modifiers and types.
|
||||||
|
*
|
||||||
|
* @param ctx the field declaration context
|
||||||
|
* @return the AST node for the field
|
||||||
|
*/
|
||||||
@Override
|
@Override
|
||||||
public ASTNode visitFieldDeclaration(SimpleJavaParser.FieldDeclarationContext ctx) {
|
public ASTNode visitFieldDeclaration(SimpleJavaParser.FieldDeclarationContext ctx) {
|
||||||
if(ctx.AccessModifier() != null) {
|
if(ctx.AccessModifier() != null) {
|
||||||
@@ -146,11 +187,25 @@ public class ASTBuilder extends SimpleJavaBaseVisitor<ASTNode> {
|
|||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
/**
|
||||||
|
* Visits a parameter and creates a ParameterNode.
|
||||||
|
* It handles the type and identifier of the parameter.
|
||||||
|
*
|
||||||
|
* @param ctx the parameter context
|
||||||
|
* @return the AST node for the parameter
|
||||||
|
*/
|
||||||
@Override
|
@Override
|
||||||
public ASTNode visitParameter(SimpleJavaParser.ParameterContext ctx) {
|
public ASTNode visitParameter(SimpleJavaParser.ParameterContext ctx) {
|
||||||
return new ParameterNode(createTypeNode(ctx.type().getText()), ctx.Identifier().getText());
|
return new ParameterNode(createTypeNode(ctx.type().getText()), ctx.Identifier().getText());
|
||||||
}
|
}
|
||||||
|
|
||||||
|
/**
|
||||||
|
* Visits a statement and creates the corresponding AST node.
|
||||||
|
* It determines the specific type of statement and processes it accordingly.
|
||||||
|
*
|
||||||
|
* @param ctx the statement context
|
||||||
|
* @return the AST node for the statement
|
||||||
|
*/
|
||||||
@Override
|
@Override
|
||||||
public ASTNode visitStatement(SimpleJavaParser.StatementContext ctx) {
|
public ASTNode visitStatement(SimpleJavaParser.StatementContext ctx) {
|
||||||
if(ctx.returnStatement() != null) {
|
if(ctx.returnStatement() != null) {
|
||||||
@@ -175,11 +230,25 @@ public class ASTBuilder extends SimpleJavaBaseVisitor<ASTNode> {
|
|||||||
return null;
|
return null;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
/**
|
||||||
|
* Visits a return statement and creates a ReturnNode.
|
||||||
|
* It processes the expression in the return statement.
|
||||||
|
*
|
||||||
|
* @param ctx the return statement context
|
||||||
|
* @return the AST node for the return statement
|
||||||
|
*/
|
||||||
@Override
|
@Override
|
||||||
public ASTNode visitReturnStatement(SimpleJavaParser.ReturnStatementContext ctx) {
|
public ASTNode visitReturnStatement(SimpleJavaParser.ReturnStatementContext ctx) {
|
||||||
return new ReturnNode((IExpressionNode) visit(ctx.expression()));
|
return new ReturnNode((IExpressionNode) visit(ctx.expression()));
|
||||||
}
|
}
|
||||||
|
|
||||||
|
/**
|
||||||
|
* Visits a return statement and creates a ReturnNode.
|
||||||
|
* It processes the expression in the return statement.
|
||||||
|
*
|
||||||
|
* @param ctx the return statement context
|
||||||
|
* @return the AST node for the return statement
|
||||||
|
*/
|
||||||
@Override
|
@Override
|
||||||
public ASTNode visitLocalVariableDeclaration(SimpleJavaParser.LocalVariableDeclarationContext ctx) {
|
public ASTNode visitLocalVariableDeclaration(SimpleJavaParser.LocalVariableDeclarationContext ctx) {
|
||||||
if(ctx.Assign() != null) {
|
if(ctx.Assign() != null) {
|
||||||
@@ -190,6 +259,13 @@ public class ASTBuilder extends SimpleJavaBaseVisitor<ASTNode> {
|
|||||||
|
|
||||||
}
|
}
|
||||||
|
|
||||||
|
/**
|
||||||
|
* Visits a block statement and creates a BlockNode.
|
||||||
|
* It processes all statements within the block.
|
||||||
|
*
|
||||||
|
* @param ctx the block statement context
|
||||||
|
* @return the AST node for the block statement
|
||||||
|
*/
|
||||||
@Override
|
@Override
|
||||||
public ASTNode visitBlockStatement(SimpleJavaParser.BlockStatementContext ctx) {
|
public ASTNode visitBlockStatement(SimpleJavaParser.BlockStatementContext ctx) {
|
||||||
BlockNode blockNode = new BlockNode();
|
BlockNode blockNode = new BlockNode();
|
||||||
@@ -199,11 +275,25 @@ public class ASTBuilder extends SimpleJavaBaseVisitor<ASTNode> {
|
|||||||
return blockNode;
|
return blockNode;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
/**
|
||||||
|
* Visits a while statement and creates a WhileNode.
|
||||||
|
* It processes the condition expression and the block statement.
|
||||||
|
*
|
||||||
|
* @param ctx the while statement context
|
||||||
|
* @return the AST node for the while statement
|
||||||
|
*/
|
||||||
@Override
|
@Override
|
||||||
public ASTNode visitWhileStatement(SimpleJavaParser.WhileStatementContext ctx) {
|
public ASTNode visitWhileStatement(SimpleJavaParser.WhileStatementContext ctx) {
|
||||||
return new WhileNode((IExpressionNode) visit(ctx.expression()), (BlockNode) visit(ctx.blockStatement()));
|
return new WhileNode((IExpressionNode) visit(ctx.expression()), (BlockNode) visit(ctx.blockStatement()));
|
||||||
}
|
}
|
||||||
|
|
||||||
|
/**
|
||||||
|
* Visits a do-while statement and creates a BlockNode containing a WhileNode.
|
||||||
|
* It processes the condition expression and the block statement.
|
||||||
|
*
|
||||||
|
* @param ctx the do-while statement context
|
||||||
|
* @return the AST node for the do-while statement
|
||||||
|
*/
|
||||||
@Override
|
@Override
|
||||||
public ASTNode visitDoWhileStatement(SimpleJavaParser.DoWhileStatementContext ctx) {
|
public ASTNode visitDoWhileStatement(SimpleJavaParser.DoWhileStatementContext ctx) {
|
||||||
IExpressionNode condition = (IExpressionNode) visit(ctx.expression());
|
IExpressionNode condition = (IExpressionNode) visit(ctx.expression());
|
||||||
@@ -211,12 +301,19 @@ public class ASTBuilder extends SimpleJavaBaseVisitor<ASTNode> {
|
|||||||
|
|
||||||
WhileNode While = new WhileNode(condition, doBlock);
|
WhileNode While = new WhileNode(condition, doBlock);
|
||||||
BlockNode resultBlock = new BlockNode();
|
BlockNode resultBlock = new BlockNode();
|
||||||
resultBlock.addStatement((IStatementNode) doBlock);
|
resultBlock.addStatement(doBlock);
|
||||||
resultBlock.addStatement((IStatementNode) While);
|
resultBlock.addStatement(While);
|
||||||
|
|
||||||
return resultBlock;
|
return resultBlock;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
/**
|
||||||
|
* Visits a for statement and creates a BlockNode that contains a WhileNode.
|
||||||
|
* It processes the initialization, condition, and increment parts of the for loop.
|
||||||
|
*
|
||||||
|
* @param ctx the for statement context
|
||||||
|
* @return the AST node for the for statement
|
||||||
|
*/
|
||||||
@Override
|
@Override
|
||||||
public ASTNode visitForStatement(SimpleJavaParser.ForStatementContext ctx) {
|
public ASTNode visitForStatement(SimpleJavaParser.ForStatementContext ctx) {
|
||||||
List<IStatementNode> statements = new ArrayList<>();
|
List<IStatementNode> statements = new ArrayList<>();
|
||||||
@@ -235,15 +332,8 @@ public class ASTBuilder extends SimpleJavaBaseVisitor<ASTNode> {
|
|||||||
|
|
||||||
// Inkrement
|
// Inkrement
|
||||||
IStatementExpressionNode crement = null;
|
IStatementExpressionNode crement = null;
|
||||||
boolean isPrefix = false;
|
|
||||||
if (ctx.statementExpression(i) != null) {
|
if (ctx.statementExpression(i) != null) {
|
||||||
crement = (IStatementExpressionNode) visit(ctx.statementExpression(i));
|
crement = (IStatementExpressionNode) visit(ctx.statementExpression(i));
|
||||||
|
|
||||||
if (crement instanceof IncrementNode) {
|
|
||||||
isPrefix = ((IncrementNode) crement).crementType == CrementType.PREFIX;
|
|
||||||
} else if (crement instanceof DecrementNode) {
|
|
||||||
isPrefix = ((DecrementNode) crement).crementType == CrementType.PREFIX;
|
|
||||||
}
|
|
||||||
}
|
}
|
||||||
|
|
||||||
BlockNode forBlock = (BlockNode) visit(ctx.blockStatement());
|
BlockNode forBlock = (BlockNode) visit(ctx.blockStatement());
|
||||||
@@ -251,19 +341,14 @@ public class ASTBuilder extends SimpleJavaBaseVisitor<ASTNode> {
|
|||||||
// While-Schleife
|
// While-Schleife
|
||||||
BlockNode whileBody = new BlockNode();
|
BlockNode whileBody = new BlockNode();
|
||||||
|
|
||||||
// Prä-Inkrement: Das Inkrement kommt vor dem Block
|
|
||||||
if (crement != null && isPrefix) {
|
|
||||||
whileBody.addStatement((IStatementNode) crement);
|
|
||||||
}
|
|
||||||
|
|
||||||
// Block Statements der For-Schleife in den While-Block kopieren
|
// Block Statements der For-Schleife in den While-Block kopieren
|
||||||
for (IStatementNode statement : forBlock.statements) {
|
for (IStatementNode statement : forBlock.statements) {
|
||||||
whileBody.addStatement(statement);
|
whileBody.addStatement(statement);
|
||||||
}
|
}
|
||||||
|
|
||||||
// Post-Inkrement: Das Inkrement kommt nach dem Block
|
// Post-Inkrement: Das Inkrement kommt nach dem Block
|
||||||
if (crement != null && !isPrefix) {
|
if (crement != null) {
|
||||||
whileBody.addStatement((IStatementNode) crement);
|
whileBody.addStatement(crement);
|
||||||
}
|
}
|
||||||
|
|
||||||
// Bedingung der While-Schleife
|
// Bedingung der While-Schleife
|
||||||
@@ -273,12 +358,19 @@ public class ASTBuilder extends SimpleJavaBaseVisitor<ASTNode> {
|
|||||||
|
|
||||||
BlockNode resultBlock = new BlockNode();
|
BlockNode resultBlock = new BlockNode();
|
||||||
for (IStatementNode statement : statements) {
|
for (IStatementNode statement : statements) {
|
||||||
resultBlock.addStatement((IStatementNode) statement);
|
resultBlock.addStatement(statement);
|
||||||
}
|
}
|
||||||
|
|
||||||
return resultBlock;
|
return resultBlock;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
/**
|
||||||
|
* Visits an if-else statement and creates an IfElseNode.
|
||||||
|
* It processes the if, else-if, and else parts of the statement.
|
||||||
|
*
|
||||||
|
* @param ctx the if-else statement context
|
||||||
|
* @return the AST node for the if-else statement
|
||||||
|
*/
|
||||||
@Override
|
@Override
|
||||||
public ASTNode visitIfElseStatement(SimpleJavaParser.IfElseStatementContext ctx) {
|
public ASTNode visitIfElseStatement(SimpleJavaParser.IfElseStatementContext ctx) {
|
||||||
IfElseNode ifElseStatementNode;
|
IfElseNode ifElseStatementNode;
|
||||||
@@ -296,21 +388,49 @@ public class ASTBuilder extends SimpleJavaBaseVisitor<ASTNode> {
|
|||||||
return ifElseStatementNode;
|
return ifElseStatementNode;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
/**
|
||||||
|
* Visits an if statement and creates an IfNode.
|
||||||
|
* It processes the condition expression and the block statement.
|
||||||
|
*
|
||||||
|
* @param ctx the if statement context
|
||||||
|
* @return the AST node for the if statement
|
||||||
|
*/
|
||||||
@Override
|
@Override
|
||||||
public ASTNode visitIfStatement(SimpleJavaParser.IfStatementContext ctx) {
|
public ASTNode visitIfStatement(SimpleJavaParser.IfStatementContext ctx) {
|
||||||
return new IfNode((IExpressionNode) visit(ctx.expression()), (BlockNode) visit(ctx.blockStatement()));
|
return new IfNode((IExpressionNode) visit(ctx.expression()), (BlockNode) visit(ctx.blockStatement()));
|
||||||
}
|
}
|
||||||
|
|
||||||
|
/**
|
||||||
|
* Visits an else-if statement and creates an IfNode.
|
||||||
|
* It processes the condition expression and the block statement.
|
||||||
|
*
|
||||||
|
* @param ctx the else-if statement context
|
||||||
|
* @return the AST node for the else-if statement
|
||||||
|
*/
|
||||||
@Override
|
@Override
|
||||||
public ASTNode visitElseIfStatement(SimpleJavaParser.ElseIfStatementContext ctx) {
|
public ASTNode visitElseIfStatement(SimpleJavaParser.ElseIfStatementContext ctx) {
|
||||||
return new IfNode((IExpressionNode) visit(ctx.expression()), (BlockNode) visit(ctx.blockStatement()));
|
return new IfNode((IExpressionNode) visit(ctx.expression()), (BlockNode) visit(ctx.blockStatement()));
|
||||||
}
|
}
|
||||||
|
|
||||||
|
/**
|
||||||
|
* Visits an else statement and creates an ElseNode.
|
||||||
|
* It processes the block statement of the else part.
|
||||||
|
*
|
||||||
|
* @param ctx the else statement context
|
||||||
|
* @return the AST node for the else statement
|
||||||
|
*/
|
||||||
@Override
|
@Override
|
||||||
public ASTNode visitElseStatement(SimpleJavaParser.ElseStatementContext ctx) {
|
public ASTNode visitElseStatement(SimpleJavaParser.ElseStatementContext ctx) {
|
||||||
return new ElseNode((BlockNode) visit(ctx.blockStatement()));
|
return new ElseNode((BlockNode) visit(ctx.blockStatement()));
|
||||||
}
|
}
|
||||||
|
|
||||||
|
/**
|
||||||
|
* Visits a statement expression and creates the corresponding AST node.
|
||||||
|
* It handles assignments, new declarations, method calls, and increment/decrement expressions.
|
||||||
|
*
|
||||||
|
* @param ctx the statement expression context
|
||||||
|
* @return the AST node for the statement expression
|
||||||
|
*/
|
||||||
@Override
|
@Override
|
||||||
public ASTNode visitStatementExpression(SimpleJavaParser.StatementExpressionContext ctx) {
|
public ASTNode visitStatementExpression(SimpleJavaParser.StatementExpressionContext ctx) {
|
||||||
if(ctx.assign() != null) {
|
if(ctx.assign() != null) {
|
||||||
@@ -325,6 +445,13 @@ public class ASTBuilder extends SimpleJavaBaseVisitor<ASTNode> {
|
|||||||
return null;
|
return null;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
/**
|
||||||
|
* Visits a switch statement and creates an IfElseNode representing the switch cases.
|
||||||
|
* It processes the switch expression, case statements, and default statement.
|
||||||
|
*
|
||||||
|
* @param ctx the switch statement context
|
||||||
|
* @return the AST node for the switch statement
|
||||||
|
*/
|
||||||
@Override
|
@Override
|
||||||
public ASTNode visitSwitchStatement(SimpleJavaParser.SwitchStatementContext ctx) {
|
public ASTNode visitSwitchStatement(SimpleJavaParser.SwitchStatementContext ctx) {
|
||||||
UnaryNode switchExpression = (UnaryNode) visit(ctx.expression());
|
UnaryNode switchExpression = (UnaryNode) visit(ctx.expression());
|
||||||
@@ -368,11 +495,25 @@ public class ASTBuilder extends SimpleJavaBaseVisitor<ASTNode> {
|
|||||||
return ifElseNode;
|
return ifElseNode;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
/**
|
||||||
|
* Visits an assignment expression and creates an AssignNode.
|
||||||
|
* It handles the assignable expression and the assigned expression.
|
||||||
|
*
|
||||||
|
* @param ctx the assignment context
|
||||||
|
* @return the AST node for the assignment
|
||||||
|
*/
|
||||||
@Override
|
@Override
|
||||||
public ASTNode visitAssign(SimpleJavaParser.AssignContext ctx) {
|
public ASTNode visitAssign(SimpleJavaParser.AssignContext ctx) {
|
||||||
return new AssignNode((AssignableNode) visit(ctx.assignableExpression()), (IExpressionNode) visit(ctx.expression()));
|
return new AssignNode((AssignableNode) visit(ctx.assignableExpression()), (IExpressionNode) visit(ctx.expression()));
|
||||||
}
|
}
|
||||||
|
|
||||||
|
/**
|
||||||
|
* Visits a new declaration and creates a NewDeclarationNode.
|
||||||
|
* It processes the identifier and the argument list.
|
||||||
|
*
|
||||||
|
* @param ctx the new declaration context
|
||||||
|
* @return the AST node for the new declaration
|
||||||
|
*/
|
||||||
@Override
|
@Override
|
||||||
public ASTNode visitNewDeclaration(SimpleJavaParser.NewDeclarationContext ctx) {
|
public ASTNode visitNewDeclaration(SimpleJavaParser.NewDeclarationContext ctx) {
|
||||||
NewDeclarationNode newDeclarationNode = new NewDeclarationNode(ctx.Identifier().getText());
|
NewDeclarationNode newDeclarationNode = new NewDeclarationNode(ctx.Identifier().getText());
|
||||||
@@ -382,6 +523,13 @@ public class ASTBuilder extends SimpleJavaBaseVisitor<ASTNode> {
|
|||||||
return newDeclarationNode;
|
return newDeclarationNode;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
/**
|
||||||
|
* Visits a method call and creates a MethodCallNode.
|
||||||
|
* It processes the target, chained methods, and argument list.
|
||||||
|
*
|
||||||
|
* @param ctx the method call context
|
||||||
|
* @return the AST node for the method call
|
||||||
|
*/
|
||||||
@Override
|
@Override
|
||||||
public ASTNode visitMethodCall(SimpleJavaParser.MethodCallContext ctx) {
|
public ASTNode visitMethodCall(SimpleJavaParser.MethodCallContext ctx) {
|
||||||
MethodCallNode methodCallStatementExpressionNode;
|
MethodCallNode methodCallStatementExpressionNode;
|
||||||
@@ -399,6 +547,13 @@ public class ASTBuilder extends SimpleJavaBaseVisitor<ASTNode> {
|
|||||||
return methodCallStatementExpressionNode;
|
return methodCallStatementExpressionNode;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
/**
|
||||||
|
* Visits the target of a method call and creates a TargetNode.
|
||||||
|
* It handles various types of targets including 'this', member access, new declarations, and identifiers.
|
||||||
|
*
|
||||||
|
* @param ctx the target context
|
||||||
|
* @return the AST node for the target
|
||||||
|
*/
|
||||||
@Override
|
@Override
|
||||||
public ASTNode visitTarget(SimpleJavaParser.TargetContext ctx) {
|
public ASTNode visitTarget(SimpleJavaParser.TargetContext ctx) {
|
||||||
if(ctx.This() != null) {
|
if(ctx.This() != null) {
|
||||||
@@ -413,6 +568,13 @@ public class ASTBuilder extends SimpleJavaBaseVisitor<ASTNode> {
|
|||||||
return null;
|
return null;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
/**
|
||||||
|
* Visits a chained method and creates a ChainedMethodNode.
|
||||||
|
* It processes the identifier and the argument list.
|
||||||
|
*
|
||||||
|
* @param ctx the chained method context
|
||||||
|
* @return the AST node for the chained method
|
||||||
|
*/
|
||||||
@Override
|
@Override
|
||||||
public ASTNode visitChainedMethod(SimpleJavaParser.ChainedMethodContext ctx) {
|
public ASTNode visitChainedMethod(SimpleJavaParser.ChainedMethodContext ctx) {
|
||||||
ChainedMethodNode chainedMethodNode = new ChainedMethodNode(ctx.Identifier().getText());
|
ChainedMethodNode chainedMethodNode = new ChainedMethodNode(ctx.Identifier().getText());
|
||||||
@@ -422,6 +584,13 @@ public class ASTBuilder extends SimpleJavaBaseVisitor<ASTNode> {
|
|||||||
return chainedMethodNode;
|
return chainedMethodNode;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
/**
|
||||||
|
* Visits an increment or decrement expression and creates the corresponding AST node.
|
||||||
|
* It handles both prefix and suffix forms of increment and decrement.
|
||||||
|
*
|
||||||
|
* @param ctx the crement expression context
|
||||||
|
* @return the AST node for the crement expression
|
||||||
|
*/
|
||||||
@Override
|
@Override
|
||||||
public ASTNode visitCrementExpression(SimpleJavaParser.CrementExpressionContext ctx) {
|
public ASTNode visitCrementExpression(SimpleJavaParser.CrementExpressionContext ctx) {
|
||||||
if(ctx.incrementExpression() != null) {
|
if(ctx.incrementExpression() != null) {
|
||||||
@@ -432,6 +601,13 @@ public class ASTBuilder extends SimpleJavaBaseVisitor<ASTNode> {
|
|||||||
return null;
|
return null;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
/**
|
||||||
|
* Visits an increment expression and creates an IncrementNode.
|
||||||
|
* It handles both prefix and suffix forms.
|
||||||
|
*
|
||||||
|
* @param ctx the increment expression context
|
||||||
|
* @return the AST node for the increment expression
|
||||||
|
*/
|
||||||
@Override
|
@Override
|
||||||
public ASTNode visitIncrementExpression(SimpleJavaParser.IncrementExpressionContext ctx) {
|
public ASTNode visitIncrementExpression(SimpleJavaParser.IncrementExpressionContext ctx) {
|
||||||
if(ctx.prefixIncrementExpression() != null) {
|
if(ctx.prefixIncrementExpression() != null) {
|
||||||
@@ -442,16 +618,35 @@ public class ASTBuilder extends SimpleJavaBaseVisitor<ASTNode> {
|
|||||||
return null;
|
return null;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
/**
|
||||||
|
* Visits a prefix increment expression and creates an IncrementNode.
|
||||||
|
*
|
||||||
|
* @param ctx the prefix increment expression context
|
||||||
|
* @return the AST node for the prefix increment expression
|
||||||
|
*/
|
||||||
@Override
|
@Override
|
||||||
public ASTNode visitPrefixIncrementExpression(SimpleJavaParser.PrefixIncrementExpressionContext ctx) {
|
public ASTNode visitPrefixIncrementExpression(SimpleJavaParser.PrefixIncrementExpressionContext ctx) {
|
||||||
return new IncrementNode(CrementType.PREFIX, (AssignableNode) visit(ctx.assignableExpression()));
|
return new IncrementNode(CrementType.PREFIX, (AssignableNode) visit(ctx.assignableExpression()));
|
||||||
}
|
}
|
||||||
|
|
||||||
|
/**
|
||||||
|
* Visits a suffix increment expression and creates an IncrementNode.
|
||||||
|
*
|
||||||
|
* @param ctx the suffix increment expression context
|
||||||
|
* @return the AST node for the suffix increment expression
|
||||||
|
*/
|
||||||
@Override
|
@Override
|
||||||
public ASTNode visitSuffixIncrementExpression(SimpleJavaParser.SuffixIncrementExpressionContext ctx) {
|
public ASTNode visitSuffixIncrementExpression(SimpleJavaParser.SuffixIncrementExpressionContext ctx) {
|
||||||
return new IncrementNode(CrementType.SUFFIX, (AssignableNode) visit(ctx.assignableExpression()));
|
return new IncrementNode(CrementType.SUFFIX, (AssignableNode) visit(ctx.assignableExpression()));
|
||||||
}
|
}
|
||||||
|
|
||||||
|
/**
|
||||||
|
* Visits a decrement expression and creates a DecrementNode.
|
||||||
|
* It handles both prefix and suffix forms.
|
||||||
|
*
|
||||||
|
* @param ctx the decrement expression context
|
||||||
|
* @return the AST node for the decrement expression
|
||||||
|
*/
|
||||||
@Override
|
@Override
|
||||||
public ASTNode visitDecrementExpression(SimpleJavaParser.DecrementExpressionContext ctx) {
|
public ASTNode visitDecrementExpression(SimpleJavaParser.DecrementExpressionContext ctx) {
|
||||||
if(ctx.prefixDecrementExpression() != null) {
|
if(ctx.prefixDecrementExpression() != null) {
|
||||||
@@ -462,16 +657,35 @@ public class ASTBuilder extends SimpleJavaBaseVisitor<ASTNode> {
|
|||||||
return null;
|
return null;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
/**
|
||||||
|
* Visits a prefix decrement expression and creates a DecrementNode.
|
||||||
|
*
|
||||||
|
* @param ctx the prefix decrement expression context
|
||||||
|
* @return the AST node for the prefix decrement expression
|
||||||
|
*/
|
||||||
@Override
|
@Override
|
||||||
public ASTNode visitPrefixDecrementExpression(SimpleJavaParser.PrefixDecrementExpressionContext ctx) {
|
public ASTNode visitPrefixDecrementExpression(SimpleJavaParser.PrefixDecrementExpressionContext ctx) {
|
||||||
return new DecrementNode(CrementType.PREFIX, (AssignableNode) visit(ctx.assignableExpression()));
|
return new DecrementNode(CrementType.PREFIX, (AssignableNode) visit(ctx.assignableExpression()));
|
||||||
}
|
}
|
||||||
|
|
||||||
|
/**
|
||||||
|
* Visits a suffix decrement expression and creates a DecrementNode.
|
||||||
|
*
|
||||||
|
* @param ctx the suffix decrement expression context
|
||||||
|
* @return the AST node for the suffix decrement expression
|
||||||
|
*/
|
||||||
@Override
|
@Override
|
||||||
public ASTNode visitSuffixDecrementExpression(SimpleJavaParser.SuffixDecrementExpressionContext ctx) {
|
public ASTNode visitSuffixDecrementExpression(SimpleJavaParser.SuffixDecrementExpressionContext ctx) {
|
||||||
return new DecrementNode(CrementType.SUFFIX, (AssignableNode) visit(ctx.assignableExpression()));
|
return new DecrementNode(CrementType.SUFFIX, (AssignableNode) visit(ctx.assignableExpression()));
|
||||||
}
|
}
|
||||||
|
|
||||||
|
/**
|
||||||
|
* Visits an expression and creates the corresponding AST node.
|
||||||
|
* It handles both unary and binary expressions.
|
||||||
|
*
|
||||||
|
* @param ctx the expression context
|
||||||
|
* @return the AST node for the expression
|
||||||
|
*/
|
||||||
@Override
|
@Override
|
||||||
public ASTNode visitExpression(SimpleJavaParser.ExpressionContext ctx) {
|
public ASTNode visitExpression(SimpleJavaParser.ExpressionContext ctx) {
|
||||||
if(ctx.unaryExpression() != null) {
|
if(ctx.unaryExpression() != null) {
|
||||||
@@ -482,6 +696,13 @@ public class ASTBuilder extends SimpleJavaBaseVisitor<ASTNode> {
|
|||||||
return null;
|
return null;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
/**
|
||||||
|
* Visits a unary expression and creates a UnaryNode.
|
||||||
|
* It handles various forms of unary expressions including 'this', identifiers, member access, values, and more.
|
||||||
|
*
|
||||||
|
* @param ctx the unary expression context
|
||||||
|
* @return the AST node for the unary expression
|
||||||
|
*/
|
||||||
@Override
|
@Override
|
||||||
public ASTNode visitUnaryExpression(SimpleJavaParser.UnaryExpressionContext ctx) {
|
public ASTNode visitUnaryExpression(SimpleJavaParser.UnaryExpressionContext ctx) {
|
||||||
if(ctx.This() != null) {
|
if(ctx.This() != null) {
|
||||||
@@ -502,6 +723,13 @@ public class ASTBuilder extends SimpleJavaBaseVisitor<ASTNode> {
|
|||||||
return null;
|
return null;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
/**
|
||||||
|
* Visits a member access expression and creates a MemberAccessNode.
|
||||||
|
* It processes the 'this' keyword and identifiers for member access.
|
||||||
|
*
|
||||||
|
* @param ctx the member access context
|
||||||
|
* @return the AST node for the member access
|
||||||
|
*/
|
||||||
@Override
|
@Override
|
||||||
public ASTNode visitMemberAccess(SimpleJavaParser.MemberAccessContext ctx) {
|
public ASTNode visitMemberAccess(SimpleJavaParser.MemberAccessContext ctx) {
|
||||||
MemberAccessNode memberAccessNode;
|
MemberAccessNode memberAccessNode;
|
||||||
@@ -516,6 +744,13 @@ public class ASTBuilder extends SimpleJavaBaseVisitor<ASTNode> {
|
|||||||
return memberAccessNode;
|
return memberAccessNode;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
/**
|
||||||
|
* Visits a value and creates a ValueNode.
|
||||||
|
* It handles integer, boolean, char, and null values.
|
||||||
|
*
|
||||||
|
* @param ctx the value context
|
||||||
|
* @return the AST node for the value
|
||||||
|
*/
|
||||||
@Override
|
@Override
|
||||||
public ASTNode visitValue(SimpleJavaParser.ValueContext ctx) {
|
public ASTNode visitValue(SimpleJavaParser.ValueContext ctx) {
|
||||||
if(ctx.IntValue() != null) {
|
if(ctx.IntValue() != null) {
|
||||||
@@ -530,12 +765,25 @@ public class ASTBuilder extends SimpleJavaBaseVisitor<ASTNode> {
|
|||||||
return null;
|
return null;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
/**
|
||||||
|
* Visits a not expression and creates a NotNode.
|
||||||
|
* It processes the expression to which the 'not' operator is applied.
|
||||||
|
*
|
||||||
|
* @param ctx the not expression context
|
||||||
|
* @return the AST node for the not expression
|
||||||
|
*/
|
||||||
@Override
|
@Override
|
||||||
public ASTNode visitNotExpression(SimpleJavaParser.NotExpressionContext ctx) {
|
public ASTNode visitNotExpression(SimpleJavaParser.NotExpressionContext ctx) {
|
||||||
return new NotNode((IExpressionNode) visitExpression(ctx.expression()));
|
return new NotNode((IExpressionNode) visitExpression(ctx.expression()));
|
||||||
}
|
}
|
||||||
|
|
||||||
|
/**
|
||||||
|
* Visits a binary expression and creates the corresponding AST node.
|
||||||
|
* It handles both calculation and non-calculation expressions.
|
||||||
|
*
|
||||||
|
* @param ctx the binary expression context
|
||||||
|
* @return the AST node for the binary expression
|
||||||
|
*/
|
||||||
@Override
|
@Override
|
||||||
public ASTNode visitBinaryExpression(SimpleJavaParser.BinaryExpressionContext ctx) {
|
public ASTNode visitBinaryExpression(SimpleJavaParser.BinaryExpressionContext ctx) {
|
||||||
if(ctx.calculationExpression() != null) {
|
if(ctx.calculationExpression() != null) {
|
||||||
@@ -546,6 +794,13 @@ public class ASTBuilder extends SimpleJavaBaseVisitor<ASTNode> {
|
|||||||
return null;
|
return null;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
/**
|
||||||
|
* Visits a calculation expression and creates a CalculationNode.
|
||||||
|
* It handles line operators and dot expressions.
|
||||||
|
*
|
||||||
|
* @param ctx the calculation expression context
|
||||||
|
* @return the AST node for the calculation expression
|
||||||
|
*/
|
||||||
@Override
|
@Override
|
||||||
public ASTNode visitCalculationExpression(SimpleJavaParser.CalculationExpressionContext ctx) {
|
public ASTNode visitCalculationExpression(SimpleJavaParser.CalculationExpressionContext ctx) {
|
||||||
if(ctx.calculationExpression() != null) {
|
if(ctx.calculationExpression() != null) {
|
||||||
@@ -556,35 +811,69 @@ public class ASTBuilder extends SimpleJavaBaseVisitor<ASTNode> {
|
|||||||
return null;
|
return null;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
/**
|
||||||
|
* Visits a dot expression and creates a DotNode.
|
||||||
|
* It handles dot operators and dot subtraction expressions.
|
||||||
|
*
|
||||||
|
* @param ctx the dot expression context
|
||||||
|
* @return the AST node for the dot expression
|
||||||
|
*/
|
||||||
@Override
|
@Override
|
||||||
public ASTNode visitDotExpression(SimpleJavaParser.DotExpressionContext ctx) {
|
public ASTNode visitDotExpression(SimpleJavaParser.DotExpressionContext ctx) {
|
||||||
if(ctx.dotExpression() != null) {
|
if(ctx.dotExpression() != null) {
|
||||||
return new DotNode((DotNode) visit(ctx.dotExpression()), ctx.DotOperator().getText(), (DotSubstractionNode) visit(ctx.dotSubtractionExpression()));
|
return new DotNode((DotNode) visit(ctx.dotExpression()), ctx.DotOperator().getText(), (DotSubtractionNode) visit(ctx.dotSubtractionExpression()));
|
||||||
} else if(ctx.dotSubtractionExpression() != null) {
|
} else if(ctx.dotSubtractionExpression() != null) {
|
||||||
return new DotNode((DotSubstractionNode) visit(ctx.dotSubtractionExpression()));
|
return new DotNode((DotSubtractionNode) visit(ctx.dotSubtractionExpression()));
|
||||||
}
|
}
|
||||||
return null;
|
return null;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
/**
|
||||||
|
* Visits a dot subtraction expression and creates a DotSubtractionNode.
|
||||||
|
* It handles integer values, identifiers, member access, and method calls.
|
||||||
|
*
|
||||||
|
* @param ctx the dot subtraction expression context
|
||||||
|
* @return the AST node for the dot subtraction expression
|
||||||
|
*//**
|
||||||
|
* Creates an ITypeNode based on the type identifier.
|
||||||
|
* It handles basic types and reference types.
|
||||||
|
*
|
||||||
|
* @param identifier the type identifier
|
||||||
|
* @return the type node
|
||||||
|
*/
|
||||||
@Override
|
@Override
|
||||||
public ASTNode visitDotSubtractionExpression(SimpleJavaParser.DotSubtractionExpressionContext ctx) {
|
public ASTNode visitDotSubtractionExpression(SimpleJavaParser.DotSubtractionExpressionContext ctx) {
|
||||||
if(ctx.IntValue() != null) {
|
if(ctx.IntValue() != null) {
|
||||||
return new DotSubstractionNode(new ValueNode(EnumValueNode.INT_VALUE, ctx.IntValue().getText()));
|
return new DotSubtractionNode(new ValueNode(EnumValueNode.INT_VALUE, ctx.IntValue().getText()));
|
||||||
} else if(ctx.Identifier() != null) {
|
} else if(ctx.Identifier() != null) {
|
||||||
return new DotSubstractionNode(ctx.Identifier().getText());
|
return new DotSubtractionNode(ctx.Identifier().getText());
|
||||||
} else if(ctx.memberAccess() != null) {
|
} else if(ctx.memberAccess() != null) {
|
||||||
return new DotSubstractionNode((MemberAccessNode) visit(ctx.memberAccess()));
|
return new DotSubtractionNode((MemberAccessNode) visit(ctx.memberAccess()));
|
||||||
} else if(ctx.methodCall() != null && ctx.calculationExpression() != null) {
|
} else if(ctx.methodCall() != null && ctx.calculationExpression() != null) {
|
||||||
return new DotSubstractionNode((MethodCallNode) visit(ctx.methodCall()), (CalculationNode) visit(ctx.calculationExpression()));
|
return new DotSubtractionNode((MethodCallNode) visit(ctx.methodCall()), (CalculationNode) visit(ctx.calculationExpression()));
|
||||||
}
|
}
|
||||||
return null;
|
return null;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
/**
|
||||||
|
* Visits a non-calculation expression and creates a NonCalculationNode.
|
||||||
|
* It handles unary expressions combined with non-calculation operators.
|
||||||
|
*
|
||||||
|
* @param ctx the non-calculation expression context
|
||||||
|
* @return the AST node for the non-calculation expression
|
||||||
|
*/
|
||||||
@Override
|
@Override
|
||||||
public ASTNode visitNonCalculationExpression(SimpleJavaParser.NonCalculationExpressionContext ctx) {
|
public ASTNode visitNonCalculationExpression(SimpleJavaParser.NonCalculationExpressionContext ctx) {
|
||||||
return new NonCalculationNode((UnaryNode) visit(ctx.unaryExpression()), ctx.nonCalculationOperator().getText(), (IExpressionNode) visit(ctx.expression()));
|
return new NonCalculationNode((UnaryNode) visit(ctx.unaryExpression()), ctx.nonCalculationOperator().getText(), (IExpressionNode) visit(ctx.expression()));
|
||||||
}
|
}
|
||||||
|
|
||||||
|
/**
|
||||||
|
* Visits an assignable expression and creates an AssignableNode.
|
||||||
|
* It handles identifiers and member access.
|
||||||
|
*
|
||||||
|
* @param ctx the assignable expression context
|
||||||
|
* @return the AST node for the assignable expression
|
||||||
|
*/
|
||||||
@Override
|
@Override
|
||||||
public ASTNode visitAssignableExpression(SimpleJavaParser.AssignableExpressionContext ctx) {
|
public ASTNode visitAssignableExpression(SimpleJavaParser.AssignableExpressionContext ctx) {
|
||||||
if(ctx.Identifier() != null) {
|
if(ctx.Identifier() != null) {
|
||||||
@@ -595,6 +884,13 @@ public class ASTBuilder extends SimpleJavaBaseVisitor<ASTNode> {
|
|||||||
return null;
|
return null;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
/**
|
||||||
|
* Creates an ITypeNode based on the type identifier.
|
||||||
|
* It handles basic types and reference types.
|
||||||
|
*
|
||||||
|
* @param identifier the type identifier
|
||||||
|
* @return the type node
|
||||||
|
*/
|
||||||
public ITypeNode createTypeNode(String identifier){
|
public ITypeNode createTypeNode(String identifier){
|
||||||
return switch (identifier) {
|
return switch (identifier) {
|
||||||
case "int" -> new BaseType(TypeEnum.INT);
|
case "int" -> new BaseType(TypeEnum.INT);
|
||||||
|
@@ -1,18 +1,18 @@
|
|||||||
grammar SimpleJava;
|
grammar SimpleJava;
|
||||||
|
|
||||||
// Programm-Konstrukte
|
// Programm-Konstrukte
|
||||||
program: classDeclaration+;
|
program: classDeclaration+; // Ein Programm besteht aus einer oder mehreren Klassendeklarationen
|
||||||
|
|
||||||
classDeclaration: AccessModifier? 'class' Identifier OpenCurlyBracket memberDeclaration* ClosedCurlyBracket;
|
classDeclaration: AccessModifier? 'class' Identifier OpenCurlyBracket memberDeclaration* ClosedCurlyBracket; // Deklariert eine Klasse mit optionalem Zugriffsmodifikator und mehreren Mitgliedern
|
||||||
memberDeclaration: constructorDeclaration | fieldDeclaration | methodDeclaration;
|
memberDeclaration: constructorDeclaration | fieldDeclaration | methodDeclaration; // Ein Mitglied kann ein Konstruktor, ein Feld oder eine Methode sein
|
||||||
|
|
||||||
constructorDeclaration: AccessModifier? Identifier OpenRoundBracket parameterList? ClosedRoundBracket blockStatement;
|
constructorDeclaration: AccessModifier? Identifier OpenRoundBracket parameterList? ClosedRoundBracket blockStatement; // Deklariert einen Konstruktor
|
||||||
fieldDeclaration: AccessModifier? type Identifier (Assign expression)? Semicolon;
|
fieldDeclaration: AccessModifier? type Identifier (Assign expression)? Semicolon; // Deklariert ein Feld mit optionaler Initialisierung
|
||||||
methodDeclaration: MainMethodDeclaration blockStatement | AccessModifier? (type | Void) Identifier OpenRoundBracket parameterList? ClosedRoundBracket blockStatement;
|
methodDeclaration: MainMethodDeclaration blockStatement | AccessModifier? (type | Void) Identifier OpenRoundBracket parameterList? ClosedRoundBracket blockStatement; // Deklariert eine Methode
|
||||||
|
|
||||||
parameterList: parameter (Comma parameter)*;
|
parameterList: parameter (Comma parameter)*; // Parameterliste für Methoden und Konstruktoren
|
||||||
parameter: type Identifier;
|
parameter: type Identifier; // Ein einzelner Parameter mit Typ und Bezeichner
|
||||||
argumentList: (expression (Comma expression)*)?;
|
argumentList: (expression (Comma expression)*)?; // Argumentliste für Methodenaufrufe
|
||||||
|
|
||||||
// Anweisungen
|
// Anweisungen
|
||||||
statement: returnStatement Semicolon
|
statement: returnStatement Semicolon
|
||||||
@@ -23,32 +23,32 @@ statement: returnStatement Semicolon
|
|||||||
| forStatement
|
| forStatement
|
||||||
| ifElseStatement
|
| ifElseStatement
|
||||||
| switchStatement
|
| switchStatement
|
||||||
| statementExpression Semicolon;
|
| statementExpression Semicolon; // Verschiedene Arten von Anweisungen
|
||||||
|
|
||||||
blockStatement: OpenCurlyBracket statement* ClosedCurlyBracket;
|
blockStatement: OpenCurlyBracket statement* ClosedCurlyBracket; // Ein Block von Anweisungen
|
||||||
|
|
||||||
returnStatement: Return (expression)?;
|
returnStatement: Return (expression)?; // Rückgabe-Anweisung
|
||||||
localVariableDeclaration: type Identifier (Assign expression)?;
|
localVariableDeclaration: type Identifier (Assign expression)?; // Deklaration einer lokalen Variable
|
||||||
|
|
||||||
whileStatement: While OpenRoundBracket expression ClosedRoundBracket blockStatement;
|
whileStatement: While OpenRoundBracket expression ClosedRoundBracket blockStatement; // While-Schleife
|
||||||
doWhileStatement: Do blockStatement While OpenRoundBracket expression ClosedRoundBracket Semicolon;
|
doWhileStatement: Do blockStatement While OpenRoundBracket expression ClosedRoundBracket Semicolon; // Do-While-Schleife
|
||||||
forStatement: For OpenRoundBracket (statementExpression | localVariableDeclaration) Semicolon (expression)? Semicolon (statementExpression)? ClosedRoundBracket blockStatement;
|
forStatement: For OpenRoundBracket (statementExpression | localVariableDeclaration) Semicolon (expression)? Semicolon (statementExpression)? ClosedRoundBracket blockStatement; // For-Schleife
|
||||||
|
|
||||||
ifElseStatement: ifStatement elseIfStatement* elseStatement?;
|
ifElseStatement: ifStatement elseIfStatement* elseStatement?; // If-Else-Bedingung
|
||||||
ifStatement: If OpenRoundBracket expression ClosedRoundBracket blockStatement;
|
ifStatement: If OpenRoundBracket expression ClosedRoundBracket blockStatement; // If-Teil der Bedingung
|
||||||
elseIfStatement: Else If OpenRoundBracket expression ClosedRoundBracket blockStatement;
|
elseIfStatement: Else If OpenRoundBracket expression ClosedRoundBracket blockStatement; // Else-If-Teil der Bedingung
|
||||||
elseStatement: Else blockStatement;
|
elseStatement: Else blockStatement; // Else-Teil der Bedingung
|
||||||
|
|
||||||
switchStatement: Switch OpenRoundBracket expression ClosedRoundBracket OpenCurlyBracket caseStatement+ defaultStatement? ClosedCurlyBracket;
|
switchStatement: Switch OpenRoundBracket expression ClosedRoundBracket OpenCurlyBracket caseStatement+ defaultStatement? ClosedCurlyBracket; // Switch-Anweisung
|
||||||
caseStatement: Case value Colon statement*;
|
caseStatement: Case value Colon statement*; // Ein Case-Teil einer Switch-Anweisung
|
||||||
defaultStatement: Default Colon statement*;
|
defaultStatement: Default Colon statement*; // Default-Teil einer Switch-Anweisung
|
||||||
|
|
||||||
statementExpression: assign | newDeclaration | methodCall | crementExpression;
|
statementExpression: assign | newDeclaration | methodCall | crementExpression; // Ausdruck innerhalb einer Anweisung
|
||||||
assign: assignableExpression Assign expression;
|
assign: assignableExpression Assign expression; // Zuweisung
|
||||||
newDeclaration: New Identifier OpenRoundBracket argumentList ClosedRoundBracket;
|
newDeclaration: New Identifier OpenRoundBracket argumentList ClosedRoundBracket; // Instanziierung eines neuen Objekts
|
||||||
|
|
||||||
// Ausdrücke
|
// Ausdrücke
|
||||||
expression: unaryExpression | binaryExpression;
|
expression: unaryExpression | binaryExpression; // Ein Ausdruck kann unär oder binär sein
|
||||||
|
|
||||||
unaryExpression: This
|
unaryExpression: This
|
||||||
| Identifier
|
| Identifier
|
||||||
@@ -56,97 +56,97 @@ unaryExpression: This
|
|||||||
| value
|
| value
|
||||||
| notExpression
|
| notExpression
|
||||||
| statementExpression
|
| statementExpression
|
||||||
| OpenRoundBracket expression ClosedRoundBracket;
|
| OpenRoundBracket expression ClosedRoundBracket; // Unäre Ausdrücke
|
||||||
|
|
||||||
notExpression: Not expression;
|
notExpression: Not expression; // Nicht-Ausdruck
|
||||||
|
|
||||||
crementExpression: incrementExpression | decrementExpression;
|
crementExpression: incrementExpression | decrementExpression; // Inkrement-/Dekrement-Ausdrücke
|
||||||
|
|
||||||
incrementExpression: prefixIncrementExpression | suffixIncrementExpression;
|
incrementExpression: prefixIncrementExpression | suffixIncrementExpression;
|
||||||
prefixIncrementExpression: '++' assignableExpression;
|
prefixIncrementExpression: '++' assignableExpression; // Präfix-Inkrement
|
||||||
suffixIncrementExpression: assignableExpression '++';
|
suffixIncrementExpression: assignableExpression '++'; // Suffix-Inkrement
|
||||||
|
|
||||||
decrementExpression: prefixDecrementExpression | suffixDecrementExpression;
|
decrementExpression: prefixDecrementExpression | suffixDecrementExpression; // Dekrement-Ausdrücke
|
||||||
prefixDecrementExpression: '--' assignableExpression;
|
prefixDecrementExpression: '--' assignableExpression; // Präfix-Dekrement
|
||||||
suffixDecrementExpression: assignableExpression '--';
|
suffixDecrementExpression: assignableExpression '--'; // Suffix-Dekrement
|
||||||
|
|
||||||
assignableExpression: Identifier | memberAccess;
|
assignableExpression: Identifier | memberAccess; // Zuweisbarer Ausdruck
|
||||||
|
|
||||||
memberAccess: This Dot Identifier
|
memberAccess: This Dot Identifier
|
||||||
| (This Dot)? (Identifier Dot)+ Identifier;
|
| (This Dot)? (Identifier Dot)+ Identifier; // Mitgliedszugriff
|
||||||
|
|
||||||
binaryExpression: calculationExpression | nonCalculationExpression;
|
binaryExpression: calculationExpression | nonCalculationExpression; // Binäre Ausdrücke
|
||||||
|
|
||||||
calculationExpression: calculationExpression LineOperator dotExpression
|
calculationExpression: calculationExpression LineOperator dotExpression
|
||||||
| dotExpression;
|
| dotExpression; // Berechnungsausdrücke
|
||||||
|
|
||||||
dotExpression: dotExpression DotOperator dotSubtractionExpression
|
dotExpression: dotExpression DotOperator dotSubtractionExpression
|
||||||
| dotSubtractionExpression;
|
| dotSubtractionExpression; // Punktoperationen
|
||||||
|
|
||||||
dotSubtractionExpression: IntValue
|
dotSubtractionExpression: IntValue
|
||||||
| Identifier
|
| Identifier
|
||||||
| memberAccess
|
| memberAccess
|
||||||
| methodCall OpenRoundBracket calculationExpression ClosedRoundBracket;
|
| methodCall OpenRoundBracket calculationExpression ClosedRoundBracket; // Punkt-Subtraktionsausdrücke
|
||||||
|
|
||||||
nonCalculationExpression: unaryExpression nonCalculationOperator expression;
|
nonCalculationExpression: unaryExpression nonCalculationOperator expression; // Nicht-Berechnungsausdrücke
|
||||||
|
|
||||||
// Methodenaufrufe
|
// Methodenaufrufe
|
||||||
methodCall: target? chainedMethod* Identifier OpenRoundBracket argumentList ClosedRoundBracket;
|
methodCall: target? chainedMethod* Identifier OpenRoundBracket argumentList ClosedRoundBracket; // Methodenaufruf
|
||||||
target: (This | memberAccess | newDeclaration | Identifier) Dot;
|
target: (This | memberAccess | newDeclaration | Identifier) Dot; // Ziel eines Methodenaufrufs
|
||||||
chainedMethod: Identifier OpenRoundBracket argumentList ClosedRoundBracket Dot;
|
chainedMethod: Identifier OpenRoundBracket argumentList ClosedRoundBracket Dot; // Verkettete Methode
|
||||||
|
|
||||||
// Typen
|
// Typen
|
||||||
type: Int
|
type: Int
|
||||||
| Boolean
|
| Boolean
|
||||||
| Char
|
| Char
|
||||||
| Identifier;
|
| Identifier; // Datentypen
|
||||||
|
|
||||||
Void: 'void';
|
Void: 'void'; // Void-Typ
|
||||||
Boolean: 'boolean';
|
Boolean: 'boolean'; // Boolean-Typ
|
||||||
Char: 'char';
|
Char: 'char'; // Char-Typ
|
||||||
Int: 'int';
|
Int: 'int'; // Integer-Typ
|
||||||
|
|
||||||
value: IntValue
|
value: IntValue
|
||||||
| BooleanValue
|
| BooleanValue
|
||||||
| CharValue
|
| CharValue
|
||||||
| NullValue;
|
| NullValue; // Werte
|
||||||
|
|
||||||
// Zugriffsmodifikatoren
|
// Zugriffsmodifikatoren
|
||||||
AccessModifier: 'public' | 'private' | 'public static' | 'private static';
|
AccessModifier: 'public' | 'private' | 'public static' | 'private static'; // Zugriffsmodifikatoren
|
||||||
MainMethodDeclaration: 'public static void main(String[] args)';
|
MainMethodDeclaration: 'public static void main(String[] args)'; // Hauptmethoden-Deklaration
|
||||||
|
|
||||||
// Operatoren
|
// Operatoren
|
||||||
nonCalculationOperator: LogicalOperator | ComparisonOperator;
|
nonCalculationOperator: LogicalOperator | ComparisonOperator; // Nicht-Berechnungsoperatoren
|
||||||
|
|
||||||
DotOperator: Mult | Div | Modulo;
|
DotOperator: Mult | Div | Modulo; // Punktoperatoren
|
||||||
LineOperator: Plus | Minus;
|
LineOperator: Plus | Minus; // Linienoperatoren
|
||||||
ComparisonOperator: Greater | Less | GreaterEqual | LessEqual | Equal | NotEqual;
|
ComparisonOperator: Greater | Less | GreaterEqual | LessEqual | Equal | NotEqual; // Vergleichsoperatoren
|
||||||
LogicalOperator: And | Or;
|
LogicalOperator: And | Or; // Logische Operatoren
|
||||||
|
|
||||||
Assign: '=';
|
Assign: '='; // Zuweisungsoperator
|
||||||
Plus: '+';
|
Plus: '+'; // Plus-Operator
|
||||||
Minus: '-';
|
Minus: '-'; // Minus-Operator
|
||||||
Mult: '*';
|
Mult: '*'; // Multiplikationsoperator
|
||||||
Modulo: '%';
|
Modulo: '%'; // Modulo-Operator
|
||||||
Div: '/';
|
Div: '/'; // Divisionsoperator
|
||||||
Greater: '>';
|
Greater: '>'; // Größer-Operator
|
||||||
Less: '<';
|
Less: '<'; // Kleiner-Operator
|
||||||
GreaterEqual: '>=';
|
GreaterEqual: '>='; // Größer-Gleich-Operator
|
||||||
LessEqual: '<=';
|
LessEqual: '<='; // Kleiner-Gleich-Operator
|
||||||
Equal: '==';
|
Equal: '=='; // Gleichheitsoperator
|
||||||
NotEqual: '!=';
|
NotEqual: '!='; // Ungleichheitsoperator
|
||||||
Not: '!';
|
Not: '!'; // Nicht-Operator
|
||||||
And: '&&';
|
And: '&&'; // Und-Operator
|
||||||
Or: '||';
|
Or: '||'; // Oder-Operator
|
||||||
|
|
||||||
// Symbole
|
// Symbole
|
||||||
Dot: '.';
|
Dot: '.'; // Punkt-Symbol
|
||||||
OpenRoundBracket: '(';
|
OpenRoundBracket: '('; // Öffnende runde Klammer
|
||||||
ClosedRoundBracket: ')';
|
ClosedRoundBracket: ')'; // Schließende runde Klammer
|
||||||
OpenCurlyBracket: '{';
|
OpenCurlyBracket: '{'; // Öffnende geschweifte Klammer
|
||||||
ClosedCurlyBracket: '}';
|
ClosedCurlyBracket: '}'; // Schließende geschweifte Klammer
|
||||||
Semicolon: ';';
|
Semicolon: ';'; // Semikolon
|
||||||
Comma: ',';
|
Comma: ','; // Komma
|
||||||
|
|
||||||
// Schlüsselwörter
|
// Schlüsselwörter
|
||||||
Class: 'class';
|
Class: 'class';
|
||||||
@@ -161,21 +161,21 @@ New: 'new';
|
|||||||
Switch: 'switch';
|
Switch: 'switch';
|
||||||
Case: 'case';
|
Case: 'case';
|
||||||
Default: 'default';
|
Default: 'default';
|
||||||
Colon: ':';
|
Colon: ':'; // Doppelpunkt
|
||||||
|
|
||||||
// Werte
|
// Werte
|
||||||
CharValue: '\'' ~[\r\n]* '\'';
|
CharValue: '\'' ~[\r\n]* '\''; // Zeichenwert
|
||||||
IntValue: Minus? Numeric+;
|
IntValue: Minus? Numeric+; // Ganzzahlwert
|
||||||
BooleanValue: 'true' | 'false';
|
BooleanValue: 'true' | 'false'; // Boolean-Wert
|
||||||
NullValue: 'null';
|
NullValue: 'null'; // Null-Wert
|
||||||
|
|
||||||
// Bezeichner
|
// Bezeichner
|
||||||
fragment Alphabetic: [a-zA-Z];
|
fragment Alphabetic: [a-zA-Z];
|
||||||
fragment Numeric: [0-9];
|
fragment Numeric: [0-9];
|
||||||
fragment ValidIdentSymbols: Alphabetic | Numeric | '$' | '_';
|
fragment ValidIdentSymbols: Alphabetic | Numeric | '$' | '_';
|
||||||
Identifier: Alphabetic ValidIdentSymbols*;
|
Identifier: Alphabetic ValidIdentSymbols*; // Bezeichner
|
||||||
|
|
||||||
// Whitespaces und Kommentare ignorieren
|
// Whitespaces und Kommentare ignorieren
|
||||||
WS: [ \t\r\n]+ -> skip;
|
WS: [ \t\r\n]+ -> skip; // Leerzeichen ignorieren
|
||||||
InlineComment: '//' ~[\r\n]* -> skip;
|
InlineComment: '//' ~[\r\n]* -> skip; // Einzeilige Kommentare ignorieren
|
||||||
MultilineComment: '/*' .*? '*/' -> skip;
|
MultilineComment: '/*' .*? '*/' -> skip; // Mehrzeilige Kommentare ignorieren
|
||||||
|
0
src/main/java/parser/parser_pp.md
Normal file
0
src/main/java/parser/parser_pp.md
Normal file
@@ -8,7 +8,7 @@ import java.util.Stack;
|
|||||||
|
|
||||||
public class Scope {
|
public class Scope {
|
||||||
|
|
||||||
private Stack<HashMap<String, ITypeNode>> localVars;
|
private final Stack<HashMap<String, ITypeNode>> localVars;
|
||||||
|
|
||||||
public Scope() {
|
public Scope() {
|
||||||
localVars = new Stack<HashMap<String, ITypeNode>>();
|
localVars = new Stack<HashMap<String, ITypeNode>>();
|
||||||
|
@@ -1,6 +1,5 @@
|
|||||||
package semantic;
|
package semantic;
|
||||||
|
|
||||||
|
|
||||||
import java.util.ArrayList;
|
import java.util.ArrayList;
|
||||||
import java.util.HashMap;
|
import java.util.HashMap;
|
||||||
import java.util.List;
|
import java.util.List;
|
||||||
@@ -25,15 +24,11 @@ import ast.statementexpressions.methodcallstatementnexpressions.ChainedMethodNod
|
|||||||
import ast.statementexpressions.methodcallstatementnexpressions.MethodCallNode;
|
import ast.statementexpressions.methodcallstatementnexpressions.MethodCallNode;
|
||||||
import ast.statementexpressions.methodcallstatementnexpressions.TargetNode;
|
import ast.statementexpressions.methodcallstatementnexpressions.TargetNode;
|
||||||
import ast.statements.*;
|
import ast.statements.*;
|
||||||
import ast.type.AccessModifierNode;
|
|
||||||
import ast.type.EnumAccessModifierNode;
|
import ast.type.EnumAccessModifierNode;
|
||||||
import ast.type.ValueNode;
|
import ast.type.ValueNode;
|
||||||
import ast.type.type.*;
|
import ast.type.type.*;
|
||||||
import com.sun.jdi.IntegerType;
|
|
||||||
import semantic.context.ClassContext;
|
|
||||||
import semantic.context.Context;
|
import semantic.context.Context;
|
||||||
import semantic.exceptions.*;
|
import semantic.exceptions.*;
|
||||||
import typechecker.TypeCheckResult;
|
|
||||||
|
|
||||||
public class SemanticAnalyzer implements SemanticVisitor {
|
public class SemanticAnalyzer implements SemanticVisitor {
|
||||||
|
|
||||||
@@ -114,10 +109,6 @@ public class SemanticAnalyzer implements SemanticVisitor {
|
|||||||
|
|
||||||
@Override
|
@Override
|
||||||
public TypeCheckResult analyze(MethodNode methodNode) {
|
public TypeCheckResult analyze(MethodNode methodNode) {
|
||||||
if (methodNode instanceof ConstructorNode) {
|
|
||||||
return new TypeCheckResult(true, new BaseType(TypeEnum.VOID));
|
|
||||||
} else {
|
|
||||||
|
|
||||||
var valid = true;
|
var valid = true;
|
||||||
|
|
||||||
for (var otherMethod : currentClass.getMethods()) {
|
for (var otherMethod : currentClass.getMethods()) {
|
||||||
@@ -159,8 +150,6 @@ public class SemanticAnalyzer implements SemanticVisitor {
|
|||||||
}
|
}
|
||||||
|
|
||||||
return new TypeCheckResult(valid, resultType);
|
return new TypeCheckResult(valid, resultType);
|
||||||
|
|
||||||
}
|
|
||||||
}
|
}
|
||||||
|
|
||||||
@Override
|
@Override
|
||||||
@@ -177,8 +166,6 @@ public class SemanticAnalyzer implements SemanticVisitor {
|
|||||||
currentFields.put(toCheck.identifier, toCheck.type);
|
currentFields.put(toCheck.identifier, toCheck.type);
|
||||||
}
|
}
|
||||||
return new TypeCheckResult(true, null);
|
return new TypeCheckResult(true, null);
|
||||||
|
|
||||||
|
|
||||||
}
|
}
|
||||||
|
|
||||||
@Override
|
@Override
|
||||||
@@ -267,12 +254,11 @@ public class SemanticAnalyzer implements SemanticVisitor {
|
|||||||
return new TypeCheckResult(true, type);
|
return new TypeCheckResult(true, type);
|
||||||
} else if (currentScope.getLocalVar(toCheck.identifier) != null) {
|
} else if (currentScope.getLocalVar(toCheck.identifier) != null) {
|
||||||
var type = currentScope.getLocalVar(toCheck.identifier);
|
var type = currentScope.getLocalVar(toCheck.identifier);
|
||||||
|
toCheck.setTypeNode(type);
|
||||||
return new TypeCheckResult(true, type);
|
return new TypeCheckResult(true, type);
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
return new TypeCheckResult(true, null);
|
return new TypeCheckResult(true, null);
|
||||||
|
|
||||||
}
|
}
|
||||||
|
|
||||||
@Override
|
@Override
|
||||||
@@ -317,9 +303,18 @@ public class SemanticAnalyzer implements SemanticVisitor {
|
|||||||
@Override
|
@Override
|
||||||
public TypeCheckResult analyze(IfElseNode toCheck) {
|
public TypeCheckResult analyze(IfElseNode toCheck) {
|
||||||
var resultIf = toCheck.ifStatement.accept(this);
|
var resultIf = toCheck.ifStatement.accept(this);
|
||||||
|
var validElseIf = true;
|
||||||
|
|
||||||
|
if(!toCheck.elseIfStatements.isEmpty()) {
|
||||||
|
for(IfNode ifNode : toCheck.elseIfStatements) {
|
||||||
|
var resultIfFor = ifNode.accept(this);
|
||||||
|
validElseIf = validElseIf && resultIfFor.isValid();
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
if(toCheck.elseStatement != null){
|
if(toCheck.elseStatement != null){
|
||||||
var resultElse = toCheck.elseStatement.accept(this);
|
var resultElse = toCheck.elseStatement.accept(this);
|
||||||
return new TypeCheckResult(resultIf.isValid() && resultElse.isValid(), new BaseType(TypeEnum.VOID));
|
return new TypeCheckResult(resultIf.isValid() && resultElse.isValid() && validElseIf, new BaseType(TypeEnum.VOID));
|
||||||
}
|
}
|
||||||
|
|
||||||
|
|
||||||
@@ -364,6 +359,7 @@ public class SemanticAnalyzer implements SemanticVisitor {
|
|||||||
if (toCheck.target.thisTar) {
|
if (toCheck.target.thisTar) {
|
||||||
var type = getTypeFromMethod(toCheck, new ReferenceType(currentClass.identifier));
|
var type = getTypeFromMethod(toCheck, new ReferenceType(currentClass.identifier));
|
||||||
if (type != null) {
|
if (type != null) {
|
||||||
|
toCheck.type = type;
|
||||||
return new TypeCheckResult(true, type);
|
return new TypeCheckResult(true, type);
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
@@ -375,6 +371,10 @@ public class SemanticAnalyzer implements SemanticVisitor {
|
|||||||
}
|
}
|
||||||
}
|
}
|
||||||
} else {
|
} else {
|
||||||
|
if(toCheck.identifier != null) {
|
||||||
|
toCheck.target = new TargetNode(new MemberAccessNode(false));
|
||||||
|
toCheck.target.memberAccess.identifiers.add(currentClass.identifier);
|
||||||
|
}
|
||||||
|
|
||||||
ReferenceType reference = new ReferenceType(currentClass.identifier);
|
ReferenceType reference = new ReferenceType(currentClass.identifier);
|
||||||
if (!toCheck.chainedMethods.isEmpty()) {
|
if (!toCheck.chainedMethods.isEmpty()) {
|
||||||
@@ -392,7 +392,6 @@ public class SemanticAnalyzer implements SemanticVisitor {
|
|||||||
} else {
|
} else {
|
||||||
return new TypeCheckResult(false, null);
|
return new TypeCheckResult(false, null);
|
||||||
}
|
}
|
||||||
|
|
||||||
}
|
}
|
||||||
|
|
||||||
return new TypeCheckResult(false, null);
|
return new TypeCheckResult(false, null);
|
||||||
@@ -430,8 +429,10 @@ public class SemanticAnalyzer implements SemanticVisitor {
|
|||||||
|
|
||||||
@Override
|
@Override
|
||||||
public TypeCheckResult analyze(NewDeclarationNode toCheck) {
|
public TypeCheckResult analyze(NewDeclarationNode toCheck) {
|
||||||
|
|
||||||
if (context.containsClass(toCheck.identifier)) {
|
if (context.containsClass(toCheck.identifier)) {
|
||||||
|
for(var t : toCheck.expressions) {
|
||||||
|
t.accept(this);
|
||||||
|
}
|
||||||
return new TypeCheckResult(true, new ReferenceType(toCheck.identifier));
|
return new TypeCheckResult(true, new ReferenceType(toCheck.identifier));
|
||||||
} else {
|
} else {
|
||||||
throw new RuntimeException("Cannot find class " + toCheck.identifier);
|
throw new RuntimeException("Cannot find class " + toCheck.identifier);
|
||||||
@@ -480,8 +481,8 @@ public class SemanticAnalyzer implements SemanticVisitor {
|
|||||||
|
|
||||||
@Override
|
@Override
|
||||||
public TypeCheckResult analyze(DotNode toCheck) {
|
public TypeCheckResult analyze(DotNode toCheck) {
|
||||||
if (toCheck.dotSubstractionExpression != null) {
|
if (toCheck.dotSubtractionExpression != null) {
|
||||||
var result = toCheck.dotSubstractionExpression.accept(this);
|
var result = toCheck.dotSubtractionExpression.accept(this);
|
||||||
toCheck.setType(result.getType());
|
toCheck.setType(result.getType());
|
||||||
return result;
|
return result;
|
||||||
}
|
}
|
||||||
@@ -489,7 +490,7 @@ public class SemanticAnalyzer implements SemanticVisitor {
|
|||||||
}
|
}
|
||||||
|
|
||||||
@Override
|
@Override
|
||||||
public TypeCheckResult analyze(DotSubstractionNode toCheck) {
|
public TypeCheckResult analyze(DotSubtractionNode toCheck) {
|
||||||
if (toCheck.value != null) {
|
if (toCheck.value != null) {
|
||||||
var result = toCheck.value.accept(this);
|
var result = toCheck.value.accept(this);
|
||||||
toCheck.setType(result.getType());
|
toCheck.setType(result.getType());
|
||||||
@@ -533,7 +534,9 @@ public class SemanticAnalyzer implements SemanticVisitor {
|
|||||||
case LESS, LESS_EQUAL, GREATER, GREATER_EQUAL:
|
case LESS, LESS_EQUAL, GREATER, GREATER_EQUAL:
|
||||||
if (expResult.getType() instanceof BaseType expResultType && expResultType.getTypeEnum().equals(TypeEnum.INT) &&
|
if (expResult.getType() instanceof BaseType expResultType && expResultType.getTypeEnum().equals(TypeEnum.INT) &&
|
||||||
unaryResult.getType() instanceof BaseType unaryResultType && unaryResultType.getTypeEnum().equals(TypeEnum.INT)) {
|
unaryResult.getType() instanceof BaseType unaryResultType && unaryResultType.getTypeEnum().equals(TypeEnum.INT)) {
|
||||||
return new TypeCheckResult(true, new BaseType(TypeEnum.BOOL));
|
ITypeNode type = new BaseType(TypeEnum.BOOL);
|
||||||
|
nonCalculationNode.setType(type);
|
||||||
|
return new TypeCheckResult(true, type);
|
||||||
} else {
|
} else {
|
||||||
errors.add(new TypeMismatchException("Both types must be Integer"));
|
errors.add(new TypeMismatchException("Both types must be Integer"));
|
||||||
}
|
}
|
||||||
@@ -541,7 +544,9 @@ public class SemanticAnalyzer implements SemanticVisitor {
|
|||||||
case OR, AND:
|
case OR, AND:
|
||||||
if (expResult.getType() instanceof BaseType expResultType && expResultType.getTypeEnum().equals(TypeEnum.BOOL) &&
|
if (expResult.getType() instanceof BaseType expResultType && expResultType.getTypeEnum().equals(TypeEnum.BOOL) &&
|
||||||
unaryResult.getType() instanceof BaseType unaryResultType && unaryResultType.getTypeEnum().equals(TypeEnum.BOOL)) {
|
unaryResult.getType() instanceof BaseType unaryResultType && unaryResultType.getTypeEnum().equals(TypeEnum.BOOL)) {
|
||||||
return new TypeCheckResult(true, new BaseType(TypeEnum.BOOL));
|
ITypeNode type = new BaseType(TypeEnum.BOOL);
|
||||||
|
nonCalculationNode.setType(type);
|
||||||
|
return new TypeCheckResult(true, type);
|
||||||
} else {
|
} else {
|
||||||
errors.add(new TypeMismatchException("Both types must be Boolean"));
|
errors.add(new TypeMismatchException("Both types must be Boolean"));
|
||||||
}
|
}
|
||||||
@@ -549,7 +554,9 @@ public class SemanticAnalyzer implements SemanticVisitor {
|
|||||||
case EQUAL, NOT_EQUAL:
|
case EQUAL, NOT_EQUAL:
|
||||||
if (expResult.getType() instanceof BaseType expResultType && unaryResult.getType() instanceof BaseType unaryResultType
|
if (expResult.getType() instanceof BaseType expResultType && unaryResult.getType() instanceof BaseType unaryResultType
|
||||||
&& Objects.equals(expResultType, unaryResultType)) {
|
&& Objects.equals(expResultType, unaryResultType)) {
|
||||||
return new TypeCheckResult(true, new BaseType(TypeEnum.BOOL));
|
ITypeNode type = new BaseType(TypeEnum.BOOL);
|
||||||
|
nonCalculationNode.setType(type);
|
||||||
|
return new TypeCheckResult(true, type);
|
||||||
} else {
|
} else {
|
||||||
errors.add(new TypeMismatchException("Both types must be the same"));
|
errors.add(new TypeMismatchException("Both types must be the same"));
|
||||||
}
|
}
|
||||||
@@ -575,6 +582,10 @@ public class SemanticAnalyzer implements SemanticVisitor {
|
|||||||
var type = currentFields.get(unary.identifier);
|
var type = currentFields.get(unary.identifier);
|
||||||
unary.setType(type);
|
unary.setType(type);
|
||||||
return new TypeCheckResult(valid,type );
|
return new TypeCheckResult(valid,type );
|
||||||
|
} else if (unary.value != null) {
|
||||||
|
var result = unary.value.accept(this);
|
||||||
|
unary.setType(result.getType());
|
||||||
|
return new TypeCheckResult(result.isValid(), result.getType());
|
||||||
} else if (unary.statement != null) {
|
} else if (unary.statement != null) {
|
||||||
var result = unary.statement.accept(this);
|
var result = unary.statement.accept(this);
|
||||||
unary.setType(result.getType());
|
unary.setType(result.getType());
|
||||||
@@ -624,7 +635,6 @@ public class SemanticAnalyzer implements SemanticVisitor {
|
|||||||
if (currentType == null) {
|
if (currentType == null) {
|
||||||
if (currentScope.getLocalVar(s) != null) {
|
if (currentScope.getLocalVar(s) != null) {
|
||||||
currentType = currentScope.getLocalVar(s);
|
currentType = currentScope.getLocalVar(s);
|
||||||
|
|
||||||
} else if (currentFields.get(s) != null) {
|
} else if (currentFields.get(s) != null) {
|
||||||
currentType = currentFields.get(s);
|
currentType = currentFields.get(s);
|
||||||
} else {
|
} else {
|
||||||
@@ -648,7 +658,7 @@ public class SemanticAnalyzer implements SemanticVisitor {
|
|||||||
}
|
}
|
||||||
|
|
||||||
}
|
}
|
||||||
|
memberAccessNode.setTypeNode(currentType);
|
||||||
return new TypeCheckResult(true, currentType);
|
return new TypeCheckResult(true, currentType);
|
||||||
}
|
}
|
||||||
|
|
||||||
@@ -674,6 +684,7 @@ public class SemanticAnalyzer implements SemanticVisitor {
|
|||||||
return new TypeCheckResult(true, new BaseType(TypeEnum.INT));
|
return new TypeCheckResult(true, new BaseType(TypeEnum.INT));
|
||||||
}
|
}
|
||||||
case CHAR_VALUE -> {
|
case CHAR_VALUE -> {
|
||||||
|
valueNode.value = valueNode.value.replace("'", "");
|
||||||
return new TypeCheckResult(true, new BaseType(TypeEnum.CHAR));
|
return new TypeCheckResult(true, new BaseType(TypeEnum.CHAR));
|
||||||
}
|
}
|
||||||
case BOOLEAN_VALUE -> {
|
case BOOLEAN_VALUE -> {
|
||||||
|
@@ -15,7 +15,6 @@ import ast.statementexpressions.methodcallstatementnexpressions.MethodCallNode;
|
|||||||
import ast.statementexpressions.methodcallstatementnexpressions.TargetNode;
|
import ast.statementexpressions.methodcallstatementnexpressions.TargetNode;
|
||||||
import ast.statements.*;
|
import ast.statements.*;
|
||||||
import ast.type.ValueNode;
|
import ast.type.ValueNode;
|
||||||
import typechecker.TypeCheckResult;
|
|
||||||
|
|
||||||
public interface SemanticVisitor {
|
public interface SemanticVisitor {
|
||||||
|
|
||||||
@@ -61,7 +60,7 @@ public interface SemanticVisitor {
|
|||||||
|
|
||||||
TypeCheckResult analyze(DotNode toCheck);
|
TypeCheckResult analyze(DotNode toCheck);
|
||||||
|
|
||||||
TypeCheckResult analyze(DotSubstractionNode toCheck);
|
TypeCheckResult analyze(DotSubtractionNode toCheck);
|
||||||
|
|
||||||
TypeCheckResult analyze(NonCalculationNode toCheck);
|
TypeCheckResult analyze(NonCalculationNode toCheck);
|
||||||
|
|
||||||
|
@@ -1,23 +1,23 @@
|
|||||||
package typechecker;
|
package semantic;
|
||||||
|
|
||||||
|
|
||||||
import ast.type.type.ITypeNode;
|
import ast.type.type.ITypeNode;
|
||||||
|
|
||||||
public class TypeCheckResult {
|
public class TypeCheckResult {
|
||||||
|
|
||||||
private boolean valid;
|
private final boolean valid;
|
||||||
private ITypeNode type;
|
private final ITypeNode type;
|
||||||
|
|
||||||
public TypeCheckResult(boolean valid, ITypeNode type) {
|
public TypeCheckResult(boolean valid, ITypeNode type) {
|
||||||
this.valid = valid;
|
this.valid = valid;
|
||||||
this.type = type;
|
this.type = type;
|
||||||
}
|
}
|
||||||
|
|
||||||
public boolean isValid() {
|
public boolean isValid() {
|
||||||
return valid;
|
return valid;
|
||||||
}
|
}
|
||||||
|
|
||||||
public ITypeNode getType() {
|
public ITypeNode getType() {
|
||||||
return type;
|
return type;
|
||||||
}
|
}
|
||||||
}
|
}
|
@@ -9,8 +9,8 @@ import java.util.HashMap;
|
|||||||
|
|
||||||
public class ClassContext {
|
public class ClassContext {
|
||||||
|
|
||||||
private HashMap<String, FieldContext> fields;
|
private final HashMap<String, FieldContext> fields;
|
||||||
private ArrayList<MethodNode> methods = new ArrayList<>();
|
private final ArrayList<MethodNode> methods = new ArrayList<>();
|
||||||
|
|
||||||
public ClassContext(ClassNode classNode) {
|
public ClassContext(ClassNode classNode) {
|
||||||
|
|
||||||
|
@@ -5,7 +5,7 @@ import java.util.HashMap;
|
|||||||
|
|
||||||
public class Context {
|
public class Context {
|
||||||
|
|
||||||
private HashMap<String, ClassContext> classes;
|
private final HashMap<String, ClassContext> classes;
|
||||||
|
|
||||||
public Context(ProgramNode programNode) {
|
public Context(ProgramNode programNode) {
|
||||||
classes = new HashMap<>();
|
classes = new HashMap<>();
|
||||||
|
@@ -6,8 +6,8 @@ import ast.type.type.*;
|
|||||||
|
|
||||||
public class FieldContext {
|
public class FieldContext {
|
||||||
|
|
||||||
private AccessModifierNode accessModifier;
|
private final AccessModifierNode accessModifier;
|
||||||
private ITypeNode type;
|
private final ITypeNode type;
|
||||||
|
|
||||||
public FieldContext(FieldNode field) {
|
public FieldContext(FieldNode field) {
|
||||||
accessModifier = field.accessTypeNode;
|
accessModifier = field.accessTypeNode;
|
||||||
|
@@ -4,7 +4,7 @@ import bytecode.visitor.ClassVisitor;
|
|||||||
import bytecode.visitor.MethodVisitor;
|
import bytecode.visitor.MethodVisitor;
|
||||||
import bytecode.visitor.ProgramVisitor;
|
import bytecode.visitor.ProgramVisitor;
|
||||||
import semantic.SemanticVisitor;
|
import semantic.SemanticVisitor;
|
||||||
import typechecker.TypeCheckResult;
|
import semantic.TypeCheckResult;
|
||||||
|
|
||||||
public interface Visitable {
|
public interface Visitable {
|
||||||
default void accept(ProgramVisitor programVisitor) {
|
default void accept(ProgramVisitor programVisitor) {
|
||||||
|
@@ -1,13 +1,63 @@
|
|||||||
public class Compiler {
|
public class CompilerInput {
|
||||||
public int add(int i, int j) {
|
public int ps;
|
||||||
return i+j;
|
public char brand;
|
||||||
|
public int tires;
|
||||||
|
public int drivenKilometers;
|
||||||
|
|
||||||
|
public CompilerInput(int horsePower) {
|
||||||
|
this.ps = horsePower;
|
||||||
|
this.tires = 4;
|
||||||
|
}
|
||||||
|
|
||||||
|
public int getTires() {
|
||||||
|
return this.tires;
|
||||||
|
}
|
||||||
|
|
||||||
|
public boolean isSuperCar() {
|
||||||
|
if(this.ps > 300) {
|
||||||
|
return true;
|
||||||
|
} else {
|
||||||
|
return false;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
public void tune(int horsePower) {
|
||||||
|
this.ps = this.ps + horsePower;
|
||||||
|
}
|
||||||
|
|
||||||
|
public void tune() {
|
||||||
|
this.ps = this.ps + 50;
|
||||||
|
}
|
||||||
|
|
||||||
|
public void driveCircels(int circels) {
|
||||||
|
for(int i = 0; i < circels; i++) {
|
||||||
|
this.drivenKilometers = this.drivenKilometers + 5;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
public void isTunable(boolean hasEngine, boolean hasTires) {
|
||||||
|
if(hasEngine && hasTires) {
|
||||||
|
this.tune(5);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
public char race() {
|
||||||
|
int enemyHorsePower = 200;
|
||||||
|
char win = 'W';
|
||||||
|
char lose = 'L';
|
||||||
|
CompilerInput enemy = new CompilerInput(ps);
|
||||||
|
if(this.ps > enemyHorsePower) {
|
||||||
|
return win;
|
||||||
|
} else {
|
||||||
|
return lose;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
public int refuel(int currentTank, int maxTank){
|
||||||
|
int tank = currentTank;
|
||||||
|
do{
|
||||||
|
tank++;
|
||||||
|
}while(tank<maxTank);
|
||||||
|
return tank;
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
public class Node {
|
|
||||||
public void main() {
|
|
||||||
Compiler compiler = new Compiler();
|
|
||||||
int i = compiler.add(5, 8);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
|
@@ -2,19 +2,20 @@
|
|||||||
### IntelliJs play buttons do not work. Run in "src/test" folder with "make" command to run all
|
### IntelliJs play buttons do not work. Run in "src/test" folder with "make" command to run all
|
||||||
### Or run only parts with "make compile-javac", "make clean" etc.
|
### Or run only parts with "make compile-javac", "make clean" etc.
|
||||||
|
|
||||||
all: compile-javac compile-raupenpiler
|
all: compile-javac compile-miniCompiler
|
||||||
|
|
||||||
compile-javac:
|
compile-javac:
|
||||||
javac -d .\resources\output\javac .\resources\input\CompilerInput.java
|
javac -d .\resources\output\javac .\resources\input\CompilerInput.java
|
||||||
|
|
||||||
compile-raupenpiler:
|
compile-miniCompiler:
|
||||||
cd ../.. ; mvn -DskipTests install
|
cd ../.. ; mvn -DskipTests install
|
||||||
cd ../.. ; mvn exec:java -DgenJar=true -DgenClass=true -Dexec.mainClass="main.Main" -Dexec.args="'src/main/resources/input/CompilerInput.java' 'src/main/resources/output'"
|
cd ../.. ; mvn exec:java -DgenJar=true -DgenClass=true -Dexec.mainClass="main.Main" -Dexec.args="'src/main/resources/input/CompilerInput.java' 'src/main/resources/output'"
|
||||||
# cp ../main/resources/output/CompilerInput.class .java/resources/output/raupenpiler
|
|
||||||
|
|
||||||
test-raupenpiler:
|
test: compile-miniCompiler test-miniCompiler
|
||||||
|
|
||||||
|
test-miniCompiler:
|
||||||
# move the compiled class to the test/main folder
|
# move the compiled class to the test/main folder
|
||||||
mv ../main/resources/output/CompilerInput.class .java/main/
|
mv ../main/resources/output/Compiler.class .java/
|
||||||
# compile the test class
|
# compile the test class
|
||||||
javac .java/main.EndToEndTester.java
|
javac .java/main.EndToEndTester.java
|
||||||
# run the test class
|
# run the test class
|
||||||
@@ -28,8 +29,8 @@ clean:
|
|||||||
rm -f ../main/resources/output/*.jar
|
rm -f ../main/resources/output/*.jar
|
||||||
# clean resources output folders
|
# clean resources output folders
|
||||||
rm -f ./resources/output/javac/*.class
|
rm -f ./resources/output/javac/*.class
|
||||||
rm -f ./resources/output/raupenpiler/*.class
|
rm -f ./resources/output/miniCompiler/*.class
|
||||||
rm -f ./resources/output/raupenpiler/*.jar
|
rm -f ./resources/output/miniCompiler/*.jar
|
||||||
# clean logs
|
# clean logs
|
||||||
rm -f ../main/resources/logs/*
|
rm -f ../main/resources/logs/*
|
||||||
# clean test/java/main folders from .class files for End-to-End tests
|
# clean test/java/main folders from .class files for End-to-End tests
|
||||||
|
@@ -1,93 +0,0 @@
|
|||||||
# Scanner
|
|
||||||
|
|
||||||
## Scanner Input
|
|
||||||
|
|
||||||
### Beispiel 1: Empty Class
|
|
||||||
|
|
||||||
String empty class = "public class Name {}";
|
|
||||||
|
|
||||||
### Beispiel 2: Filled Class
|
|
||||||
|
|
||||||
String filled class =
|
|
||||||
"class javaFileInput.Example {" +
|
|
||||||
"if (x < 5) {" +
|
|
||||||
"for (int i = 0; i < 10; i++) {" +
|
|
||||||
"while (true) {" +
|
|
||||||
"x = 5;" +
|
|
||||||
"}"
|
|
||||||
|
|
||||||
## Scanner Output
|
|
||||||
|
|
||||||
CommonTokenStream
|
|
||||||
|
|
||||||
### Beispiel 1: Empty Class
|
|
||||||
|
|
||||||
Token Type; Token Text
|
|
||||||
Type gibts nur bei Terminalen, Text bei allen
|
|
||||||
|
|
||||||
[null "public", null "class", IDENTIFIER "Name", null "{", null "}", EOF "<EOF>"]
|
|
||||||
|
|
||||||
Bsp von Ihm mal:
|
|
||||||
[TokPublic,TokClass,TokIdentifier "Name",TokLeftBrace,TokRightBrace]
|
|
||||||
|
|
||||||
# Parser
|
|
||||||
|
|
||||||
## Parser Input
|
|
||||||
|
|
||||||
CommonTokenStream
|
|
||||||
(Scanner Output)
|
|
||||||
|
|
||||||
## Parser Output (AST)
|
|
||||||
|
|
||||||
(program (classDeclaration (accessType public) class Name { }))
|
|
||||||
|
|
||||||
ParseTree
|
|
||||||
|
|
||||||
### Beispiel 1: Empty Class
|
|
||||||
|
|
||||||
# Semantische Analyse / Typcheck
|
|
||||||
|
|
||||||
## Typcheck Input
|
|
||||||
|
|
||||||
(Parser Output = AST)
|
|
||||||
|
|
||||||
## Typcheck Output
|
|
||||||
|
|
||||||
### Beispiel 1: Empty Class
|
|
||||||
|
|
||||||
# Bytecodegenerierung
|
|
||||||
|
|
||||||
## Bytecodegenerierung Input
|
|
||||||
|
|
||||||
(Typcheck Output = vom Typcheck eventuell manipulierter AST)
|
|
||||||
|
|
||||||
## Bytecodegenerierung Output
|
|
||||||
|
|
||||||
### Beispiel 1: Empty Class
|
|
||||||
|
|
||||||
Compiled Classfile
|
|
||||||
|
|
||||||
public class javaFileInput.Example {
|
|
||||||
}
|
|
||||||
|
|
||||||
## E2E Tests:
|
|
||||||
|
|
||||||
- Testdatei mit Main ausführen/kompilieren
|
|
||||||
- Testdatei mit "javac -d output .\CompilerInput.java" kompilieren
|
|
||||||
- -> Dateien mit javap vergleichen
|
|
||||||
|
|
||||||
wenn beides erfolgreich
|
|
||||||
|
|
||||||
- Ergebnis vom eigenen Compiler mithilfe von main.EndToEndTester ausführen
|
|
||||||
- (Ergebnis von javac mithilfe von main.EndToEndTester ausführen)
|
|
||||||
|
|
||||||
### Andis Tipps:
|
|
||||||
|
|
||||||
- cp mitgeben
|
|
||||||
- makefile
|
|
||||||
- java -jar pfadtocompiler.jar EmptyClass.java
|
|
||||||
- mvn package
|
|
||||||
- javac tester // tester compilen
|
|
||||||
- java tester // tester ausführen
|
|
||||||
- -> tester ist in unserem Fall main.EndToEndTester.java
|
|
||||||
- -> Hab ich alles umgesetzt
|
|
File diff suppressed because it is too large
Load Diff
@@ -11,14 +11,12 @@ package main;
|
|||||||
* Wenn unser Compiler funktioniert, sollten keine Errors kommen (sondern nur die Ausgaben, die wir in der CompilerInput.java Datei gemacht haben,
|
* Wenn unser Compiler funktioniert, sollten keine Errors kommen (sondern nur die Ausgaben, die wir in der CompilerInput.java Datei gemacht haben,
|
||||||
* oder Methoden, die wir hier aufrufen).</p>
|
* oder Methoden, die wir hier aufrufen).</p>
|
||||||
*
|
*
|
||||||
* <p><strong>PROBLEM:</strong> Hier kommen Errors, was eigentlich heißt, dass der Compiler nicht funktioniert, der Test sollte eigentlich passen.
|
|
||||||
* <br><strong>DENN:</strong> Wenn ich statt unserem CompilerInput.class die CompilerInput.class von javac verwende (aus <code> src/test/resources/output/javac </code>), dann funktioniert es.</p>
|
|
||||||
*/
|
*/
|
||||||
public class EndToEndTester {
|
public class EndToEndTester {
|
||||||
public static void main(String[] args) {
|
public static void main(String[] args) {
|
||||||
try {
|
try {
|
||||||
// Try to load the class named "CompilerInput"
|
// Try to load the class named "CompilerInput"
|
||||||
Class<?> cls = Class.forName("CompilerInput");
|
Class<?> cls = Class.forName("Compiler");
|
||||||
// Print a success message if the class is loaded successfully
|
// Print a success message if the class is loaded successfully
|
||||||
System.out.println("Class loaded successfully: " + cls.getName());
|
System.out.println("Class loaded successfully: " + cls.getName());
|
||||||
|
|
||||||
|
@@ -32,12 +32,14 @@ public class InputFilesTest {
|
|||||||
File singleFeatureSemanticTests = new File("src/test/resources/input/singleFeatureSemanticTests");
|
File singleFeatureSemanticTests = new File("src/test/resources/input/singleFeatureSemanticTests");
|
||||||
File singleFeatureTests = new File("src/test/resources/input/singleFeatureTests");
|
File singleFeatureTests = new File("src/test/resources/input/singleFeatureTests");
|
||||||
File typedAstFeatureTests = new File("src/test/resources/input/typedAstFeatureTests");
|
File typedAstFeatureTests = new File("src/test/resources/input/typedAstFeatureTests");
|
||||||
|
File finalTest = new File("src/test/resources/input/finalTest");
|
||||||
|
|
||||||
List<File> files = getJavaFilesFromDirectory(combinedFeatureTests);
|
List<File> files = getJavaFilesFromDirectory(combinedFeatureTests);
|
||||||
// files.addAll(getJavaFilesFromDirectory(endabgabeTests));
|
// files.addAll(getJavaFilesFromDirectory(endabgabeTests));
|
||||||
// files.addAll(getJavaFilesFromDirectory(singleFeatureSemanticTests));
|
// files.addAll(getJavaFilesFromDirectory(singleFeatureSemanticTests));
|
||||||
files.addAll(getJavaFilesFromDirectory(singleFeatureTests));
|
files.addAll(getJavaFilesFromDirectory(singleFeatureTests));
|
||||||
// files.addAll(getJavaFilesFromDirectory(typedAstFeatureTests));
|
// files.addAll(getJavaFilesFromDirectory(typedAstFeatureTests));
|
||||||
|
//files.addAll(getJavaFilesFromDirectory(finalTest));
|
||||||
|
|
||||||
if (!files.isEmpty()) {
|
if (!files.isEmpty()) {
|
||||||
for (File file : files) {
|
for (File file : files) {
|
||||||
|
@@ -2,8 +2,6 @@ package main;
|
|||||||
|
|
||||||
import org.junit.runner.RunWith;
|
import org.junit.runner.RunWith;
|
||||||
import org.junit.runners.Suite;
|
import org.junit.runners.Suite;
|
||||||
import parser.ParserTest;
|
|
||||||
import parser.ScannerTest;
|
|
||||||
import semantic.EndToTypedAstTest;
|
import semantic.EndToTypedAstTest;
|
||||||
import semantic.SemanticTest;
|
import semantic.SemanticTest;
|
||||||
|
|
||||||
@@ -15,8 +13,6 @@ import semantic.SemanticTest;
|
|||||||
@RunWith(Suite.class)
|
@RunWith(Suite.class)
|
||||||
@Suite.SuiteClasses({
|
@Suite.SuiteClasses({
|
||||||
InputFilesTest.class,
|
InputFilesTest.class,
|
||||||
ScannerTest.class,
|
|
||||||
ParserTest.class,
|
|
||||||
SemanticTest.class,
|
SemanticTest.class,
|
||||||
EndToTypedAstTest.class
|
EndToTypedAstTest.class
|
||||||
})
|
})
|
||||||
|
@@ -6,7 +6,7 @@ import ast.ProgramNode;
|
|||||||
import ast.expressions.IExpressionNode;
|
import ast.expressions.IExpressionNode;
|
||||||
import ast.expressions.binaryexpressions.CalculationNode;
|
import ast.expressions.binaryexpressions.CalculationNode;
|
||||||
import ast.expressions.binaryexpressions.DotNode;
|
import ast.expressions.binaryexpressions.DotNode;
|
||||||
import ast.expressions.binaryexpressions.DotSubstractionNode;
|
import ast.expressions.binaryexpressions.DotSubtractionNode;
|
||||||
import ast.expressions.binaryexpressions.NonCalculationNode;
|
import ast.expressions.binaryexpressions.NonCalculationNode;
|
||||||
import ast.expressions.unaryexpressions.MemberAccessNode;
|
import ast.expressions.unaryexpressions.MemberAccessNode;
|
||||||
import ast.expressions.unaryexpressions.UnaryNode;
|
import ast.expressions.unaryexpressions.UnaryNode;
|
||||||
@@ -308,31 +308,6 @@ class AstBuilderTest {
|
|||||||
assertThat(actual).isEqualToComparingFieldByFieldRecursively(expected);
|
assertThat(actual).isEqualToComparingFieldByFieldRecursively(expected);
|
||||||
}
|
}
|
||||||
|
|
||||||
@Test
|
|
||||||
@DisplayName("Null Test")
|
|
||||||
public void nullTest() {
|
|
||||||
BlockNode blockCon = new BlockNode();
|
|
||||||
MemberAccessNode memberAccess = new MemberAccessNode(true);
|
|
||||||
memberAccess.addIdentifier("a");
|
|
||||||
|
|
||||||
AssignableNode assignable = new AssignableNode(memberAccess);
|
|
||||||
|
|
||||||
blockCon.addStatement(new AssignNode(assignable, new UnaryNode(new ValueNode(EnumValueNode.NULL_VALUE, "null"))));
|
|
||||||
blockCon.addStatement(new ReturnNode(null));
|
|
||||||
ConstructorNode constructor = new ConstructorNode("public", "Null", blockCon);
|
|
||||||
|
|
||||||
ClassNode class1 = new ClassNode("public", "Null");
|
|
||||||
class1.addMember(new FieldNode(new AccessModifierNode("public"), new ReferenceType("Null"), "a"));
|
|
||||||
class1.addMember(constructor);
|
|
||||||
|
|
||||||
ProgramNode expected = new ProgramNode();
|
|
||||||
expected.addClass(class1);
|
|
||||||
|
|
||||||
ASTNode actual = Helper.generateAST(directoryPath + "Null.java");
|
|
||||||
|
|
||||||
assertThat(actual).isEqualToComparingFieldByFieldRecursively(expected);
|
|
||||||
}
|
|
||||||
|
|
||||||
@Test
|
@Test
|
||||||
@DisplayName("If Test")
|
@DisplayName("If Test")
|
||||||
public void ifTest() {
|
public void ifTest() {
|
||||||
@@ -428,7 +403,7 @@ class AstBuilderTest {
|
|||||||
MemberNode testClassObject = new FieldNode(new AccessModifierNode("public"), new ReferenceType("SelfReference"),"selfReference");
|
MemberNode testClassObject = new FieldNode(new AccessModifierNode("public"), new ReferenceType("SelfReference"),"selfReference");
|
||||||
|
|
||||||
BlockNode testMethod1Block = new BlockNode();
|
BlockNode testMethod1Block = new BlockNode();
|
||||||
testMethod1Block.addStatement(new ReturnNode(new UnaryNode(new MethodCallNode(new TargetNode(true), "testMethod2"))));
|
testMethod1Block.addStatement(new ReturnNode(new UnaryNode(new MethodCallNode(null, "testMethod2"))));
|
||||||
MethodNode testMethod1 = new MethodNode("public", new BaseType(TypeEnum.INT), false, "testMethod1", testMethod1Block);
|
MethodNode testMethod1 = new MethodNode("public", new BaseType(TypeEnum.INT), false, "testMethod1", testMethod1Block);
|
||||||
|
|
||||||
BlockNode testMethod2Block = new BlockNode();
|
BlockNode testMethod2Block = new BlockNode();
|
||||||
@@ -438,9 +413,7 @@ class AstBuilderTest {
|
|||||||
BlockNode testMethod3Block = new BlockNode();
|
BlockNode testMethod3Block = new BlockNode();
|
||||||
testMethod3Block.addStatement(new LocalVariableDeclarationNode(new ReferenceType("SelfReference"),"selfReference1", "=", new UnaryNode(new NewDeclarationNode("SelfReference")))); // Assing einfach "=" ?
|
testMethod3Block.addStatement(new LocalVariableDeclarationNode(new ReferenceType("SelfReference"),"selfReference1", "=", new UnaryNode(new NewDeclarationNode("SelfReference")))); // Assing einfach "=" ?
|
||||||
MemberAccessNode methodAccess = new MemberAccessNode(false);
|
MemberAccessNode methodAccess = new MemberAccessNode(false);
|
||||||
methodAccess.addIdentifier("selfReference1");
|
TargetNode methodTarget = new TargetNode("selfReference1");
|
||||||
methodAccess.addIdentifier("selfReference");
|
|
||||||
TargetNode methodTarget = new TargetNode(methodAccess);
|
|
||||||
testMethod3Block.addStatement(new ReturnNode(new UnaryNode(new MethodCallNode(methodTarget,"testMethod1"))));
|
testMethod3Block.addStatement(new ReturnNode(new UnaryNode(new MethodCallNode(methodTarget,"testMethod1"))));
|
||||||
MethodNode testMethod3 = new MethodNode("public", new BaseType(TypeEnum.INT), false, "testMethod3", testMethod3Block);
|
MethodNode testMethod3 = new MethodNode("public", new BaseType(TypeEnum.INT), false, "testMethod3", testMethod3Block);
|
||||||
|
|
||||||
@@ -514,31 +487,31 @@ class AstBuilderTest {
|
|||||||
ClassNode class1 = Helper.generateEmptyClass("VariableCalculation");
|
ClassNode class1 = Helper.generateEmptyClass("VariableCalculation");
|
||||||
|
|
||||||
BlockNode aPlusBBlock = new BlockNode();
|
BlockNode aPlusBBlock = new BlockNode();
|
||||||
aPlusBBlock.addStatement(new ReturnNode(new CalculationNode(new CalculationNode(new DotNode(new DotSubstractionNode("a"))), "+", new DotNode(new DotSubstractionNode("b")))));
|
aPlusBBlock.addStatement(new ReturnNode(new CalculationNode(new CalculationNode(new DotNode(new DotSubtractionNode("a"))), "+", new DotNode(new DotSubtractionNode("b")))));
|
||||||
MethodNode aPlusBMethod = new MethodNode("public", new BaseType(TypeEnum.INT), false, "aPlusB", aPlusBBlock);
|
MethodNode aPlusBMethod = new MethodNode("public", new BaseType(TypeEnum.INT), false, "aPlusB", aPlusBBlock);
|
||||||
aPlusBMethod.addParameter(new ParameterNode(new BaseType(TypeEnum.INT), "a"));
|
aPlusBMethod.addParameter(new ParameterNode(new BaseType(TypeEnum.INT), "a"));
|
||||||
aPlusBMethod.addParameter(new ParameterNode(new BaseType(TypeEnum.INT), "b"));
|
aPlusBMethod.addParameter(new ParameterNode(new BaseType(TypeEnum.INT), "b"));
|
||||||
|
|
||||||
BlockNode aMinusBBlock = new BlockNode();
|
BlockNode aMinusBBlock = new BlockNode();
|
||||||
aMinusBBlock.addStatement(new ReturnNode(new CalculationNode(new CalculationNode(new DotNode(new DotSubstractionNode("a"))), "-", new DotNode(new DotSubstractionNode("b")))));
|
aMinusBBlock.addStatement(new ReturnNode(new CalculationNode(new CalculationNode(new DotNode(new DotSubtractionNode("a"))), "-", new DotNode(new DotSubtractionNode("b")))));
|
||||||
MethodNode aMinusBMethod = new MethodNode("public", new BaseType(TypeEnum.INT), false, "aMinusB", aMinusBBlock);
|
MethodNode aMinusBMethod = new MethodNode("public", new BaseType(TypeEnum.INT), false, "aMinusB", aMinusBBlock);
|
||||||
aMinusBMethod.addParameter(new ParameterNode(new BaseType(TypeEnum.INT), "a"));
|
aMinusBMethod.addParameter(new ParameterNode(new BaseType(TypeEnum.INT), "a"));
|
||||||
aMinusBMethod.addParameter(new ParameterNode(new BaseType(TypeEnum.INT), "b"));
|
aMinusBMethod.addParameter(new ParameterNode(new BaseType(TypeEnum.INT), "b"));
|
||||||
|
|
||||||
BlockNode aTimeBBlock = new BlockNode();
|
BlockNode aTimeBBlock = new BlockNode();
|
||||||
aTimeBBlock.addStatement(new ReturnNode(new CalculationNode(new DotNode(new DotNode(new DotSubstractionNode("a")), "*", new DotSubstractionNode("b")))));
|
aTimeBBlock.addStatement(new ReturnNode(new CalculationNode(new DotNode(new DotNode(new DotSubtractionNode("a")), "*", new DotSubtractionNode("b")))));
|
||||||
MethodNode aTimeBMethod = new MethodNode("public", new BaseType(TypeEnum.INT), false, "aTimeB", aTimeBBlock);
|
MethodNode aTimeBMethod = new MethodNode("public", new BaseType(TypeEnum.INT), false, "aTimeB", aTimeBBlock);
|
||||||
aTimeBMethod.addParameter(new ParameterNode(new BaseType(TypeEnum.INT), "a"));
|
aTimeBMethod.addParameter(new ParameterNode(new BaseType(TypeEnum.INT), "a"));
|
||||||
aTimeBMethod.addParameter(new ParameterNode(new BaseType(TypeEnum.INT), "b"));
|
aTimeBMethod.addParameter(new ParameterNode(new BaseType(TypeEnum.INT), "b"));
|
||||||
|
|
||||||
BlockNode aDivBBlock = new BlockNode();
|
BlockNode aDivBBlock = new BlockNode();
|
||||||
aDivBBlock.addStatement(new ReturnNode(new CalculationNode(new DotNode(new DotNode(new DotSubstractionNode("a")), "/", new DotSubstractionNode("b")))));
|
aDivBBlock.addStatement(new ReturnNode(new CalculationNode(new DotNode(new DotNode(new DotSubtractionNode("a")), "/", new DotSubtractionNode("b")))));
|
||||||
MethodNode aDivBMethod = new MethodNode("public", new BaseType(TypeEnum.INT), false, "aDivB", aDivBBlock);
|
MethodNode aDivBMethod = new MethodNode("public", new BaseType(TypeEnum.INT), false, "aDivB", aDivBBlock);
|
||||||
aDivBMethod.addParameter(new ParameterNode(new BaseType(TypeEnum.INT), "a"));
|
aDivBMethod.addParameter(new ParameterNode(new BaseType(TypeEnum.INT), "a"));
|
||||||
aDivBMethod.addParameter(new ParameterNode(new BaseType(TypeEnum.INT), "b"));
|
aDivBMethod.addParameter(new ParameterNode(new BaseType(TypeEnum.INT), "b"));
|
||||||
|
|
||||||
BlockNode complexCalcBlock = new BlockNode();
|
BlockNode complexCalcBlock = new BlockNode();
|
||||||
complexCalcBlock.addStatement(new ReturnNode(new CalculationNode(null, null, new DotNode(new DotNode(new DotNode(new DotNode(new DotSubstractionNode("a")), "*", new DotSubstractionNode("b")), "/", new DotSubstractionNode(new ValueNode(EnumValueNode.INT_VALUE, "1"))), "*", new DotSubstractionNode(new ValueNode(EnumValueNode.INT_VALUE, "3"))))));
|
complexCalcBlock.addStatement(new ReturnNode(new CalculationNode(null, null, new DotNode(new DotNode(new DotNode(new DotNode(new DotSubtractionNode("a")), "*", new DotSubtractionNode("b")), "/", new DotSubtractionNode(new ValueNode(EnumValueNode.INT_VALUE, "1"))), "*", new DotSubtractionNode(new ValueNode(EnumValueNode.INT_VALUE, "3"))))));
|
||||||
MethodNode complexCalcMethod = new MethodNode("public", new BaseType(TypeEnum.INT), false, "complexCalc", complexCalcBlock);
|
MethodNode complexCalcMethod = new MethodNode("public", new BaseType(TypeEnum.INT), false, "complexCalc", complexCalcBlock);
|
||||||
complexCalcMethod.addParameter(new ParameterNode(new BaseType(TypeEnum.INT), "a"));
|
complexCalcMethod.addParameter(new ParameterNode(new BaseType(TypeEnum.INT), "a"));
|
||||||
complexCalcMethod.addParameter(new ParameterNode(new BaseType(TypeEnum.INT), "b"));
|
complexCalcMethod.addParameter(new ParameterNode(new BaseType(TypeEnum.INT), "b"));
|
||||||
@@ -610,7 +583,7 @@ class AstBuilderTest {
|
|||||||
blockCon.addStatement(new LocalVariableDeclarationNode(new BaseType(TypeEnum.INT), "i", "=", new UnaryNode(new ValueNode(EnumValueNode.INT_VALUE, "10"))));
|
blockCon.addStatement(new LocalVariableDeclarationNode(new BaseType(TypeEnum.INT), "i", "=", new UnaryNode(new ValueNode(EnumValueNode.INT_VALUE, "10"))));
|
||||||
blockCon.addStatement(whileStatement);
|
blockCon.addStatement(whileStatement);
|
||||||
blockCon.addStatement(new ReturnNode(null));
|
blockCon.addStatement(new ReturnNode(null));
|
||||||
ConstructorNode constructor = new ConstructorNode("public", "TestClass", blockCon);
|
ConstructorNode constructor = new ConstructorNode("public", "While", blockCon);
|
||||||
|
|
||||||
ClassNode class1 = new ClassNode("public", "While");
|
ClassNode class1 = new ClassNode("public", "While");
|
||||||
class1.addMember(constructor);
|
class1.addMember(constructor);
|
||||||
@@ -641,7 +614,7 @@ class AstBuilderTest {
|
|||||||
blockCon.addStatement(new LocalVariableDeclarationNode(new BaseType(TypeEnum.INT), "i", "=", new UnaryNode(new ValueNode(EnumValueNode.INT_VALUE, "0"))));
|
blockCon.addStatement(new LocalVariableDeclarationNode(new BaseType(TypeEnum.INT), "i", "=", new UnaryNode(new ValueNode(EnumValueNode.INT_VALUE, "0"))));
|
||||||
blockCon.addStatement(blockDoWhile);
|
blockCon.addStatement(blockDoWhile);
|
||||||
blockCon.addStatement(new ReturnNode(null));
|
blockCon.addStatement(new ReturnNode(null));
|
||||||
ConstructorNode constructor = new ConstructorNode("public", "TestClass", blockCon);
|
ConstructorNode constructor = new ConstructorNode("public", "DoWhile", blockCon);
|
||||||
|
|
||||||
ClassNode class1 = new ClassNode("public", "DoWhile");
|
ClassNode class1 = new ClassNode("public", "DoWhile");
|
||||||
class1.addMember(constructor);
|
class1.addMember(constructor);
|
||||||
@@ -660,7 +633,7 @@ class AstBuilderTest {
|
|||||||
LocalVariableDeclarationNode forDeclaration = new LocalVariableDeclarationNode(new BaseType(TypeEnum.INT), "i", "=", new UnaryNode(new ValueNode(EnumValueNode.INT_VALUE, "0")));
|
LocalVariableDeclarationNode forDeclaration = new LocalVariableDeclarationNode(new BaseType(TypeEnum.INT), "i", "=", new UnaryNode(new ValueNode(EnumValueNode.INT_VALUE, "0")));
|
||||||
|
|
||||||
AssignableNode assignable = new AssignableNode("i");
|
AssignableNode assignable = new AssignableNode("i");
|
||||||
IncrementNode increment = new IncrementNode(CrementType.SUFFIX, assignable);
|
IncrementNode increment = new IncrementNode(CrementType.PREFIX, assignable);
|
||||||
|
|
||||||
LocalVariableDeclarationNode declaration = new LocalVariableDeclarationNode(new BaseType(TypeEnum.INT), "a", null, null);
|
LocalVariableDeclarationNode declaration = new LocalVariableDeclarationNode(new BaseType(TypeEnum.INT), "a", null, null);
|
||||||
|
|
||||||
@@ -677,7 +650,7 @@ class AstBuilderTest {
|
|||||||
BlockNode blockCon = new BlockNode();
|
BlockNode blockCon = new BlockNode();
|
||||||
blockCon.addStatement(forStatement);
|
blockCon.addStatement(forStatement);
|
||||||
blockCon.addStatement(new ReturnNode(null));
|
blockCon.addStatement(new ReturnNode(null));
|
||||||
ConstructorNode constructor = new ConstructorNode("public", "TestClass", blockCon);
|
ConstructorNode constructor = new ConstructorNode("public", "For", blockCon);
|
||||||
|
|
||||||
ClassNode class1 = new ClassNode("public", "For");
|
ClassNode class1 = new ClassNode("public", "For");
|
||||||
class1.addMember(constructor);
|
class1.addMember(constructor);
|
||||||
|
@@ -2,12 +2,10 @@ package parser;
|
|||||||
|
|
||||||
import ast.ASTNode;
|
import ast.ASTNode;
|
||||||
import ast.ClassNode;
|
import ast.ClassNode;
|
||||||
import ast.ProgramNode;
|
|
||||||
import ast.members.ConstructorNode;
|
import ast.members.ConstructorNode;
|
||||||
import ast.members.MemberNode;
|
import ast.members.MemberNode;
|
||||||
import ast.statements.BlockNode;
|
import ast.statements.BlockNode;
|
||||||
import ast.statements.ReturnNode;
|
import ast.statements.ReturnNode;
|
||||||
import ast.type.AccessModifierNode;
|
|
||||||
import org.antlr.v4.runtime.CharStream;
|
import org.antlr.v4.runtime.CharStream;
|
||||||
import org.antlr.v4.runtime.CharStreams;
|
import org.antlr.v4.runtime.CharStreams;
|
||||||
import org.antlr.v4.runtime.CommonTokenStream;
|
import org.antlr.v4.runtime.CommonTokenStream;
|
||||||
@@ -39,7 +37,7 @@ public class Helper {
|
|||||||
public static ClassNode generateEmptyClass(String className) {
|
public static ClassNode generateEmptyClass(String className) {
|
||||||
BlockNode blockNode = new BlockNode();
|
BlockNode blockNode = new BlockNode();
|
||||||
blockNode.addStatement(new ReturnNode(null));
|
blockNode.addStatement(new ReturnNode(null));
|
||||||
MemberNode constructor = new ConstructorNode("public",className, blockNode);
|
MemberNode constructor = new ConstructorNode("public", className, blockNode);
|
||||||
ClassNode classNode = new ClassNode("public", className);
|
ClassNode classNode = new ClassNode("public", className);
|
||||||
classNode.addMember(constructor);
|
classNode.addMember(constructor);
|
||||||
return classNode;
|
return classNode;
|
||||||
|
@@ -1,138 +0,0 @@
|
|||||||
package parser;
|
|
||||||
|
|
||||||
import org.antlr.v4.runtime.*;
|
|
||||||
import org.antlr.v4.runtime.tree.ParseTree;
|
|
||||||
import org.junit.jupiter.api.BeforeEach;
|
|
||||||
import org.junit.jupiter.api.Test;
|
|
||||||
import parser.generated.SimpleJavaLexer;
|
|
||||||
import parser.generated.SimpleJavaParser;
|
|
||||||
|
|
||||||
import static org.junit.jupiter.api.Assertions.*;
|
|
||||||
|
|
||||||
import java.util.*;
|
|
||||||
|
|
||||||
public class ParserTest {
|
|
||||||
/*
|
|
||||||
@BeforeEach
|
|
||||||
public void init() { // noch nicht benötigt
|
|
||||||
String inputFilePath = "src/main/resources/input/CompilerInput.java";
|
|
||||||
String outputDirectoryPath = "src/main/resources/output";
|
|
||||||
}
|
|
||||||
*/
|
|
||||||
|
|
||||||
@Test
|
|
||||||
public void parserTest() {
|
|
||||||
// init
|
|
||||||
CharStream inputCharStream = CharStreams.fromString("public class Name {}");
|
|
||||||
SimpleJavaLexer lexer = new SimpleJavaLexer(inputCharStream);
|
|
||||||
CommonTokenStream tokenStream = new CommonTokenStream(lexer);
|
|
||||||
tokenStream.fill();
|
|
||||||
|
|
||||||
|
|
||||||
/* Parser -> Parsetree */
|
|
||||||
SimpleJavaParser parser = new SimpleJavaParser(tokenStream);
|
|
||||||
ParseTree parseTree = parser.program(); // parse the input
|
|
||||||
|
|
||||||
//Variante 1 (geht)
|
|
||||||
String expectedParseTreeAsString = "(program (classDeclaration public class Name { }))";
|
|
||||||
String actualParseTreeAsString = parseTree.toStringTree(parser);
|
|
||||||
|
|
||||||
assertEquals(expectedParseTreeAsString, actualParseTreeAsString);
|
|
||||||
|
|
||||||
// Variante 2 (geht nicht)
|
|
||||||
// - Sollte es gehen und es liegt am Parser? (keine Ahnung) -> Bitte Fehler (actual und expected) durchlesen
|
|
||||||
// ist die Methode parseStringToTree() korrekt? -> (glaub nicht)
|
|
||||||
Map<String, Object> expectedTreeStructure = parseStringToTree(expectedParseTreeAsString);
|
|
||||||
Map<String, Object> actualTreeStructure = buildTreeStructure(parseTree, parser);
|
|
||||||
|
|
||||||
// assertEquals(expectedTreeStructure, actualTreeStructure);
|
|
||||||
}
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
// Helpers Variante 2.1
|
|
||||||
|
|
||||||
public static Map<String, Object> buildTreeStructure(ParseTree tree, Parser parser) {
|
|
||||||
return buildTree(tree, parser, 0);
|
|
||||||
}
|
|
||||||
|
|
||||||
private static Map<String, Object> buildTree(ParseTree tree, Parser parser, int indent) {
|
|
||||||
Map<String, Object> node = new HashMap<>();
|
|
||||||
|
|
||||||
if (tree instanceof RuleContext) {
|
|
||||||
int ruleIndex = ((RuleContext) tree).getRuleIndex();
|
|
||||||
String ruleName = parser.getRuleNames()[ruleIndex];
|
|
||||||
node.put("rule", ruleName);
|
|
||||||
} else {
|
|
||||||
node.put("text", tree.getText());
|
|
||||||
}
|
|
||||||
|
|
||||||
List<Map<String, Object>> children = new ArrayList<>();
|
|
||||||
for (int i = 0; i < tree.getChildCount(); i++) {
|
|
||||||
children.add(buildTree(tree.getChild(i), parser, indent + 1));
|
|
||||||
}
|
|
||||||
|
|
||||||
if (!children.isEmpty()) {
|
|
||||||
node.put("children", children);
|
|
||||||
}
|
|
||||||
|
|
||||||
return node;
|
|
||||||
}
|
|
||||||
|
|
||||||
// Helpers Variante 2.2
|
|
||||||
|
|
||||||
public static Map<String, Object> parseStringToTree(String input) {
|
|
||||||
input = input.trim();
|
|
||||||
if (input.startsWith("(") && input.endsWith(")")) {
|
|
||||||
input = input.substring(1, input.length() - 1).trim();
|
|
||||||
}
|
|
||||||
return parse(input);
|
|
||||||
}
|
|
||||||
|
|
||||||
private static Map<String, Object> parse(String input) {
|
|
||||||
Map<String, Object> node = new HashMap<>();
|
|
||||||
StringBuilder currentToken = new StringBuilder();
|
|
||||||
List<Map<String, Object>> children = new ArrayList<>();
|
|
||||||
|
|
||||||
int depth = 0;
|
|
||||||
boolean inToken = false;
|
|
||||||
for (char ch : input.toCharArray()) {
|
|
||||||
if (ch == '(') {
|
|
||||||
if (depth == 0) {
|
|
||||||
if (!currentToken.isEmpty()) {
|
|
||||||
node.put("node", currentToken.toString().trim());
|
|
||||||
currentToken.setLength(0);
|
|
||||||
}
|
|
||||||
} else {
|
|
||||||
currentToken.append(ch);
|
|
||||||
}
|
|
||||||
depth++;
|
|
||||||
} else if (ch == ')') {
|
|
||||||
depth--;
|
|
||||||
if (depth == 0) {
|
|
||||||
children.add(parse(currentToken.toString().trim()));
|
|
||||||
currentToken.setLength(0);
|
|
||||||
} else {
|
|
||||||
currentToken.append(ch);
|
|
||||||
}
|
|
||||||
} else if (Character.isWhitespace(ch) && depth == 0) {
|
|
||||||
if (!currentToken.isEmpty()) {
|
|
||||||
node.put("node", currentToken.toString().trim());
|
|
||||||
currentToken.setLength(0);
|
|
||||||
}
|
|
||||||
} else {
|
|
||||||
currentToken.append(ch);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
if (!currentToken.isEmpty()) {
|
|
||||||
node.put("node", currentToken.toString().trim());
|
|
||||||
}
|
|
||||||
|
|
||||||
if (!children.isEmpty()) {
|
|
||||||
node.put("children", children);
|
|
||||||
}
|
|
||||||
|
|
||||||
return node;
|
|
||||||
}
|
|
||||||
}
|
|
@@ -1,45 +0,0 @@
|
|||||||
package parser;
|
|
||||||
|
|
||||||
import org.antlr.v4.runtime.CharStream;
|
|
||||||
import org.antlr.v4.runtime.CharStreams;
|
|
||||||
import org.antlr.v4.runtime.CommonTokenStream;
|
|
||||||
import org.antlr.v4.runtime.Token;
|
|
||||||
import org.junit.jupiter.api.Test;
|
|
||||||
import parser.generated.SimpleJavaLexer;
|
|
||||||
|
|
||||||
import java.util.Arrays;
|
|
||||||
import java.util.List;
|
|
||||||
|
|
||||||
import static org.junit.jupiter.api.Assertions.assertEquals;
|
|
||||||
|
|
||||||
public class ScannerTest {
|
|
||||||
|
|
||||||
/**
|
|
||||||
* This test method is used to test the scanner functionality of the SimpleJavaLexer.
|
|
||||||
* It creates a CharStream from a string representing a simple Java class declaration,
|
|
||||||
* and uses the SimpleJavaLexer to tokenize this input.
|
|
||||||
* It then compares the actual tokens and their types produced by the lexer to the expected tokens and their types.
|
|
||||||
*/
|
|
||||||
@Test
|
|
||||||
public void scannerTest() {
|
|
||||||
// Create a CharStream from a string representing a simple Java class declaration
|
|
||||||
CharStream inputCharStream = CharStreams.fromString("public class Name {}");
|
|
||||||
|
|
||||||
// Use the SimpleJavaLexer to tokenize the input
|
|
||||||
SimpleJavaLexer lexer = new SimpleJavaLexer(inputCharStream);
|
|
||||||
CommonTokenStream tokenStream = new CommonTokenStream(lexer);
|
|
||||||
tokenStream.fill();
|
|
||||||
|
|
||||||
// Prepare the expected results
|
|
||||||
List<String> expectedTokens = Arrays.asList("public", "class", "Name", "{", "}", "<EOF>");
|
|
||||||
List<String> expectedTokenTypes = Arrays.asList("AccessModifier", "Class", "Identifier", "OpenCurlyBracket", "ClosedCurlyBracket", "EOF");
|
|
||||||
List<Token> actualTokens = tokenStream.getTokens();
|
|
||||||
|
|
||||||
// Compare the actual tokens and their types to the expected tokens and their types
|
|
||||||
assertEquals(expectedTokens.size(), actualTokens.size());
|
|
||||||
for (int i = 0; i < expectedTokens.size(); i++) {
|
|
||||||
assertEquals(expectedTokens.get(i), actualTokens.get(i).getText());
|
|
||||||
assertEquals(expectedTokenTypes.get(i), SimpleJavaLexer.VOCABULARY.getSymbolicName(actualTokens.get(i).getType()));
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
@@ -30,6 +30,6 @@ public class SemanticHelper {
|
|||||||
ParseTree parseTree = parser.program();
|
ParseTree parseTree = parser.program();
|
||||||
ASTBuilder astBuilder = new ASTBuilder();
|
ASTBuilder astBuilder = new ASTBuilder();
|
||||||
|
|
||||||
return (ProgramNode) astBuilder.visit(parseTree);
|
return astBuilder.visit(parseTree);
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
@@ -352,34 +352,6 @@ public class SemanticTest {
|
|||||||
assertNotNull(typedAst);
|
assertNotNull(typedAst);
|
||||||
}
|
}
|
||||||
|
|
||||||
@Test
|
|
||||||
@DisplayName("Null Test")
|
|
||||||
public void nullTest() {
|
|
||||||
BlockNode blockCon = new BlockNode();
|
|
||||||
MemberAccessNode memberAccess = new MemberAccessNode(true);
|
|
||||||
memberAccess.addIdentifier("a");
|
|
||||||
|
|
||||||
AssignableNode assignable = new AssignableNode(memberAccess);
|
|
||||||
|
|
||||||
blockCon.addStatement(new AssignNode(assignable, new UnaryNode(new ValueNode(EnumValueNode.NULL_VALUE, "null"))));
|
|
||||||
blockCon.addStatement(new ReturnNode(null));
|
|
||||||
ConstructorNode constructor = new ConstructorNode("public", "Null", blockCon);
|
|
||||||
|
|
||||||
ClassNode class1 = new ClassNode("public", "Null");
|
|
||||||
class1.addMember(new FieldNode(new AccessModifierNode("public"), new BaseType(TypeEnum.INT), "a"));
|
|
||||||
class1.addMember(constructor);
|
|
||||||
|
|
||||||
ProgramNode abstractSyntaxTree = new ProgramNode();
|
|
||||||
abstractSyntaxTree.addClass(class1);
|
|
||||||
|
|
||||||
ASTNode typedAst = SemanticAnalyzer.generateTast(abstractSyntaxTree);
|
|
||||||
for (Exception runtimeException : SemanticAnalyzer.errors) {
|
|
||||||
runtimeException.printStackTrace();
|
|
||||||
}
|
|
||||||
assertTrue(SemanticAnalyzer.errors.isEmpty());
|
|
||||||
assertNotNull(typedAst);
|
|
||||||
}
|
|
||||||
|
|
||||||
@Test
|
@Test
|
||||||
@DisplayName("Self Reference Test")
|
@DisplayName("Self Reference Test")
|
||||||
public void selfReferenceTest() {
|
public void selfReferenceTest() {
|
||||||
|
@@ -1,25 +0,0 @@
|
|||||||
public class Main {
|
|
||||||
public static void main(String[] args) {
|
|
||||||
Car myCar = new Car(2020);
|
|
||||||
int tires = 0;
|
|
||||||
int year = myCar.getYear();
|
|
||||||
|
|
||||||
if (year == 2020) {
|
|
||||||
tires = 4;
|
|
||||||
} else {
|
|
||||||
tires = 2;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
class Car {
|
|
||||||
private int year;
|
|
||||||
|
|
||||||
public Car(int year) {
|
|
||||||
this.year = year;
|
|
||||||
}
|
|
||||||
|
|
||||||
public int getYear() {
|
|
||||||
return this.year;
|
|
||||||
}
|
|
||||||
}
|
|
@@ -1,36 +0,0 @@
|
|||||||
public class ControlStructures {
|
|
||||||
|
|
||||||
public int sum(int a, int b) {
|
|
||||||
return a + b;
|
|
||||||
}
|
|
||||||
|
|
||||||
public cahr checkNumber(int num) {
|
|
||||||
if (num > 0) {
|
|
||||||
return "p";
|
|
||||||
} else if (num < 0) {
|
|
||||||
return "n";
|
|
||||||
} else {
|
|
||||||
return "z";
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
public void printNumbersUpTo(int limit) {
|
|
||||||
int even = 0;
|
|
||||||
int uneven = 0;
|
|
||||||
int i = 0;
|
|
||||||
while (i < limit) {
|
|
||||||
if (i % 2 == 0) {
|
|
||||||
even++;
|
|
||||||
} else {
|
|
||||||
uneven = uneven + 1;
|
|
||||||
}
|
|
||||||
i++;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
public static void main(String[] args) {
|
|
||||||
ControlStructures cs = new ControlStructures();
|
|
||||||
cs.printNumbersUpTo(5);
|
|
||||||
int result = cs.sum(5, 5);
|
|
||||||
}
|
|
||||||
}
|
|
@@ -1,11 +0,0 @@
|
|||||||
public class Person {
|
|
||||||
private int age;
|
|
||||||
|
|
||||||
public Person(int age) {
|
|
||||||
this.age = age;
|
|
||||||
}
|
|
||||||
|
|
||||||
public int getAge() {
|
|
||||||
return this.age;
|
|
||||||
}
|
|
||||||
}
|
|
63
src/test/resources/input/finalTest/Car.java
Normal file
63
src/test/resources/input/finalTest/Car.java
Normal file
@@ -0,0 +1,63 @@
|
|||||||
|
public class Car {
|
||||||
|
public int ps;
|
||||||
|
public char brand;
|
||||||
|
public int tires;
|
||||||
|
public int drivenKilometers;
|
||||||
|
|
||||||
|
public Car(int horsePower) {
|
||||||
|
this.ps = horsePower;
|
||||||
|
this.tires = 4;
|
||||||
|
}
|
||||||
|
|
||||||
|
public int getTires() {
|
||||||
|
return this.tires;
|
||||||
|
}
|
||||||
|
|
||||||
|
public boolean isSuperCar() {
|
||||||
|
if(this.ps > 300) {
|
||||||
|
return true;
|
||||||
|
} else {
|
||||||
|
return false;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
public void tune(int horsePower) {
|
||||||
|
this.ps = this.ps + horsePower;
|
||||||
|
}
|
||||||
|
|
||||||
|
public void tune() {
|
||||||
|
this.ps = this.ps + 50;
|
||||||
|
}
|
||||||
|
|
||||||
|
public void driveCircels(int circels) {
|
||||||
|
for(int i = 0; i < circels; i++) {
|
||||||
|
this.drivenKilometers = this.drivenKilometers + 5;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
public void isTunable(boolean hasEngine, boolean hasTires) {
|
||||||
|
if(hasEngine && hasTires) {
|
||||||
|
this.tune(5);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
public char race() {
|
||||||
|
int enemyHorsePower = 200;
|
||||||
|
char win = 'W';
|
||||||
|
char lose = 'L';
|
||||||
|
Car enemy = new Car(ps);
|
||||||
|
if(this.ps > enemyHorsePower) {
|
||||||
|
return win;
|
||||||
|
} else {
|
||||||
|
return lose;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
public int refuel(int currentTank, int maxTank){
|
||||||
|
int tank = currentTank;
|
||||||
|
do{
|
||||||
|
tank++;
|
||||||
|
}while(tank<maxTank);
|
||||||
|
return tank;
|
||||||
|
}
|
||||||
|
}
|
32
src/test/resources/input/finalTest/Main.java
Normal file
32
src/test/resources/input/finalTest/Main.java
Normal file
@@ -0,0 +1,32 @@
|
|||||||
|
public class Main {
|
||||||
|
public static void main(String[] args) {
|
||||||
|
Car vw = new Car(50);
|
||||||
|
System.out.println(vw.getTires());
|
||||||
|
System.out.println(vw.isSuperCar());
|
||||||
|
|
||||||
|
System.out.println("--------------------------------------");
|
||||||
|
|
||||||
|
vw.tune(300);
|
||||||
|
System.out.println(vw.ps);
|
||||||
|
System.out.println(vw.isSuperCar());
|
||||||
|
|
||||||
|
System.out.println("--------------------------------------");
|
||||||
|
|
||||||
|
System.out.println(vw.drivenKilometers);
|
||||||
|
vw.driveCircels(25);
|
||||||
|
System.out.println(vw.drivenKilometers);
|
||||||
|
|
||||||
|
System.out.println("--------------------------------------");
|
||||||
|
|
||||||
|
vw.isTunable(true, true);
|
||||||
|
System.out.println(vw.ps);
|
||||||
|
|
||||||
|
System.out.println("--------------------------------------");
|
||||||
|
|
||||||
|
System.out.println(vw.race());
|
||||||
|
|
||||||
|
System.out.println("--------------------------------------");
|
||||||
|
|
||||||
|
System.out.println(vw.refuel(10, 20));
|
||||||
|
}
|
||||||
|
}
|
@@ -1,7 +1,7 @@
|
|||||||
class For{
|
class For{
|
||||||
|
|
||||||
public For(){
|
public For(){
|
||||||
for(int i = 0; i < 10; i++){
|
for(int i = 0; i < 10; ++i){
|
||||||
int a;
|
int a;
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
@@ -3,7 +3,7 @@ public class Increment {
|
|||||||
public int test;
|
public int test;
|
||||||
|
|
||||||
public void increment(int p) {
|
public void increment(int p) {
|
||||||
test = p++;
|
this.test = p++;
|
||||||
|
|
||||||
for(int i = 1; i<=10; i++) {
|
for(int i = 1; i<=10; i++) {
|
||||||
int a = 5;
|
int a = 5;
|
||||||
|
@@ -1,8 +0,0 @@
|
|||||||
class Null{
|
|
||||||
|
|
||||||
Null a;
|
|
||||||
|
|
||||||
public Null(){
|
|
||||||
this.a = null;
|
|
||||||
}
|
|
||||||
}
|
|
@@ -1,18 +1,18 @@
|
|||||||
class SelfReference{
|
class SelfReference {
|
||||||
|
|
||||||
SelfReference selfReference;
|
SelfReference selfReference;
|
||||||
|
|
||||||
int testMethod1() {
|
int testMethod1() {
|
||||||
return this.testMethod2();
|
return testMethod2();
|
||||||
}
|
}
|
||||||
|
|
||||||
int testMethod2() {
|
int testMethod2() {
|
||||||
return 1;
|
return 1;
|
||||||
}
|
}
|
||||||
|
|
||||||
int testMethod3(){
|
int testMethod3() {
|
||||||
SelfReference selfReference1 = new SelfReference();
|
SelfReference selfReference1 = new SelfReference();
|
||||||
return selfReference1.selfReference.testMethod1();
|
return selfReference1.testMethod1();
|
||||||
}
|
}
|
||||||
|
|
||||||
}
|
}
|
||||||
|
@@ -1,16 +1,8 @@
|
|||||||
public class Compiler {
|
public class If {
|
||||||
Node node;
|
public If() {
|
||||||
public int add(int i, int j) {
|
int intValue = 5;
|
||||||
node = new Node();
|
if(intValue == 5) {
|
||||||
node.x = 1;
|
intValue--;
|
||||||
return i+j;
|
}
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
public class Node {
|
|
||||||
public int x;
|
|
||||||
public void main() {
|
|
||||||
Compiler compiler = new Compiler();
|
|
||||||
int i = compiler.add(5, 8);
|
|
||||||
}
|
}
|
||||||
}
|
}
|
0
src/test/resources/output/javac/test
Normal file
0
src/test/resources/output/javac/test
Normal file
@@ -1,70 +0,0 @@
|
|||||||
{
|
|
||||||
"classes": [
|
|
||||||
{
|
|
||||||
"identifier": "testClass1",
|
|
||||||
"accessType": {
|
|
||||||
"enumAccessTypeNode": "PUBLIC"
|
|
||||||
},
|
|
||||||
"members": [
|
|
||||||
{
|
|
||||||
"@type": "Field",
|
|
||||||
"accessTypeNode": {
|
|
||||||
"enumAccessTypeNode": "PUBLIC"
|
|
||||||
},
|
|
||||||
"type": {
|
|
||||||
"@type": "Base",
|
|
||||||
"enumType": "INT"
|
|
||||||
},
|
|
||||||
"identifier": "testVar1"
|
|
||||||
},
|
|
||||||
{
|
|
||||||
"@type": "Method",
|
|
||||||
"visibility": {
|
|
||||||
"enumAccessTypeNode": "PUBLIC"
|
|
||||||
},
|
|
||||||
"type": {
|
|
||||||
"@type": "Base",
|
|
||||||
"enumType": "INT"
|
|
||||||
},
|
|
||||||
"identifier": "testMethod",
|
|
||||||
"parameters": {
|
|
||||||
"parameters": [
|
|
||||||
{
|
|
||||||
"type": {
|
|
||||||
"@type": "Base",
|
|
||||||
"enumType": "INT"
|
|
||||||
},
|
|
||||||
"identifier": "param1"
|
|
||||||
}
|
|
||||||
]
|
|
||||||
},
|
|
||||||
"statements": [
|
|
||||||
{
|
|
||||||
"@type": "Assignment",
|
|
||||||
"expressionLeft": {
|
|
||||||
"@type": "InstVar",
|
|
||||||
"identifier": "testVar1",
|
|
||||||
"expression": {
|
|
||||||
"@type": "This",
|
|
||||||
"type": {
|
|
||||||
"@type": "Reference",
|
|
||||||
"identifier": "testClass1"
|
|
||||||
}
|
|
||||||
},
|
|
||||||
"type": null
|
|
||||||
},
|
|
||||||
"expressionRight": {
|
|
||||||
"@type": "Literal",
|
|
||||||
"type": {
|
|
||||||
"@type": "Base",
|
|
||||||
"enumType": "INT"
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
]
|
|
||||||
}
|
|
||||||
],
|
|
||||||
"hasConstructor": false
|
|
||||||
}
|
|
||||||
]
|
|
||||||
}
|
|
@@ -1,133 +0,0 @@
|
|||||||
{
|
|
||||||
"classes": [
|
|
||||||
{
|
|
||||||
"identifier": "testClass1",
|
|
||||||
"accessType": {
|
|
||||||
"enumAccessTypeNode": "PUBLIC"
|
|
||||||
},
|
|
||||||
"members": [
|
|
||||||
{
|
|
||||||
"@type": "Field",
|
|
||||||
"accessTypeNode": {
|
|
||||||
"enumAccessTypeNode": "PUBLIC"
|
|
||||||
},
|
|
||||||
"type": {
|
|
||||||
"@type": "Base",
|
|
||||||
"enumType": "INT"
|
|
||||||
},
|
|
||||||
"identifier": "testVar1"
|
|
||||||
},
|
|
||||||
{
|
|
||||||
"@type": "Method",
|
|
||||||
"visibility": {
|
|
||||||
"enumAccessTypeNode": "PUBLIC"
|
|
||||||
},
|
|
||||||
"type": {
|
|
||||||
"@type": "Base",
|
|
||||||
"enumType": "INT"
|
|
||||||
},
|
|
||||||
"identifier": "testMethod",
|
|
||||||
"parameters": {
|
|
||||||
"parameters": [
|
|
||||||
{
|
|
||||||
"type": {
|
|
||||||
"@type": "Base",
|
|
||||||
"enumType": "INT"
|
|
||||||
},
|
|
||||||
"identifier": "param1"
|
|
||||||
}
|
|
||||||
]
|
|
||||||
},
|
|
||||||
"statements": [
|
|
||||||
{
|
|
||||||
"@type": "Assignment",
|
|
||||||
"expressionLeft": {
|
|
||||||
"@type": "InstVar",
|
|
||||||
"identifier": "testVar1",
|
|
||||||
"expression": {
|
|
||||||
"@type": "This",
|
|
||||||
"type": {
|
|
||||||
"@type": "Reference",
|
|
||||||
"identifier": "testClass1"
|
|
||||||
}
|
|
||||||
},
|
|
||||||
"type": null
|
|
||||||
},
|
|
||||||
"expressionRight": {
|
|
||||||
"@type": "Literal",
|
|
||||||
"type": {
|
|
||||||
"@type": "Base",
|
|
||||||
"enumType": "BOOLEAN"
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
]
|
|
||||||
}
|
|
||||||
],
|
|
||||||
"hasConstructor": false,
|
|
||||||
"methods": [
|
|
||||||
{
|
|
||||||
"@type": "Method",
|
|
||||||
"visibility": {
|
|
||||||
"enumAccessTypeNode": "PUBLIC"
|
|
||||||
},
|
|
||||||
"type": {
|
|
||||||
"@type": "Base",
|
|
||||||
"enumType": "INT"
|
|
||||||
},
|
|
||||||
"identifier": "testMethod",
|
|
||||||
"parameters": {
|
|
||||||
"parameters": [
|
|
||||||
{
|
|
||||||
"type": {
|
|
||||||
"@type": "Base",
|
|
||||||
"enumType": "INT"
|
|
||||||
},
|
|
||||||
"identifier": "param1"
|
|
||||||
}
|
|
||||||
]
|
|
||||||
},
|
|
||||||
"statements": [
|
|
||||||
{
|
|
||||||
"@type": "Assignment",
|
|
||||||
"expressionLeft": {
|
|
||||||
"@type": "InstVar",
|
|
||||||
"identifier": "testVar",
|
|
||||||
"expression": {
|
|
||||||
"@type": "InstVar",
|
|
||||||
"identifier": "testVar",
|
|
||||||
"expression": {
|
|
||||||
"@type": "This",
|
|
||||||
"type": {
|
|
||||||
"@type": "Reference",
|
|
||||||
"identifier": "testClass2"
|
|
||||||
}
|
|
||||||
},
|
|
||||||
"type": null
|
|
||||||
},
|
|
||||||
"type": null
|
|
||||||
},
|
|
||||||
"expressionRight": {
|
|
||||||
"@type": "Literal",
|
|
||||||
"type": null
|
|
||||||
},
|
|
||||||
"type": null
|
|
||||||
},
|
|
||||||
{
|
|
||||||
"@type": "VariableDeclaration",
|
|
||||||
"type": {
|
|
||||||
"@type": "Base",
|
|
||||||
"enumType": "CHAR"
|
|
||||||
},
|
|
||||||
"identifier": "objectVar",
|
|
||||||
"expression": {
|
|
||||||
"@type": "Literal",
|
|
||||||
"type": null
|
|
||||||
}
|
|
||||||
}
|
|
||||||
]
|
|
||||||
}
|
|
||||||
]
|
|
||||||
}
|
|
||||||
]
|
|
||||||
}
|
|
@@ -1 +0,0 @@
|
|||||||
{"classes":[{"identifier":"testClass","accessType":{"enumAccessTypeNode":"PUBLIC"},"members":[{"@type":"Field","accessTypeNode":{"enumAccessTypeNode":"PUBLIC"},"type":{"@type":"Base","enumType":"INT"},"identifier":"testVar1"},{"@type":"Field","accessTypeNode":{"enumAccessTypeNode":"PUBLIC"},"type":{"@type":"Base","enumType":"INT"},"identifier":"objectVar"},{"@type":"Method","visibility":{"enumAccessTypeNode":"PUBLIC"},"type":{"@type":"Base","enumType":"INT"},"identifier":"testVar2","parameters":{"parameters":[{"type":{"@type":"Base","enumType":"INT"},"identifier":"param1"}]},"statements":[{"@type":"Assignment","expressionLeft":{"@type":"InstVar","identifier":"objectVar","expression":{"@type":"This","type":{"@type":"Reference","identifier":"testClass"}},"type":null},"expressionRight":{"@type":"Literal","type":{"@type":"Base","enumType":"INT"}}}]}],"hasConstructor":false,"methods":[{"@type":"Method","visibility":{"enumAccessTypeNode":"PUBLIC"},"type":{"@type":"Base","enumType":"INT"},"identifier":"testVar2","parameters":{"parameters":[{"type":{"@type":"Base","enumType":"INT"},"identifier":"param1"}]},"statements":[{"@type":"Assignment","expressionLeft":{"@type":"InstVar","identifier":"objectVar","expression":{"@type":"This","type":{"@type":"Reference","identifier":"testClass"}},"type":null},"expressionRight":{"@type":"Literal","type":{"@type":"Base","enumType":"INT"}}}]}]}]}
|
|
Reference in New Issue
Block a user