ecrire fait

ArbreAbstrait/Ecrire.java

+/*
+ * Represent an equal comparaison expression node inside the AST.
+ */
+
+
+
+public class Ecrire extends Instruction {
+    private Expression source;
+
+    /**
+     * Constructor
+     */
+    public Ecrire(Expression source, String fl, int line, int col) {
+        super(fl, line, col);
+        this.source = source;
+    }
+
+    /**
+     * Get the binary operator
+     */
+    public Expression getSource() {
+        return this.source;
+    }
+
+
+    
+    /**
+     * Accepts a AST visitor
+     */
+    Object accept(ASTVisitor visitor){
+        return visitor.visit(this);
+    }
+}

Tests/test_base_with_sementic_issue.input

@@ -4,4 +4,6 @@ debutprg
     c = c * 2;
     b = 3;
     d = c <> b;
+
+    ecrire "oui";
 finprg

Visitors/ASTVisitor.java

@@ -26,7 +26,7 @@ public interface ASTVisitor {
     Object visit(Diff node);
     Object visit(Division node);
 
-    // Object visit(Ecrire node);
+    Object visit(Ecrire node);
     Object visit(Egal node);
 
     Object visit(Et node);

Visitors/ByteCodeGenerator.java

@@ -40,7 +40,7 @@ public class ByteCodeGenerator implements ASTVisitor {
         return null;
     }
 
-    // public Object visit(Ecrire node) { return null; }
+    public Object visit(Ecrire node) { return null; }
 
     public Object visit(Egal node) {
         return null;

Visitors/SemanticAnalyzer.java

@@ -42,7 +42,7 @@ public class SemanticAnalyzer implements ASTVisitor {
         return null;
     }
 
-    // public Object visit(Ecrire node) { return null; }
+    public Object visit(Ecrire node) { return null; }
 
     public Object visit(Egal node) {
         return null;

Visitors/SourceCodeGenerator.java

@@ -15,7 +15,7 @@ public class SourceCodeGenerator implements ASTVisitor {
     /**
      * Depth level (tabulations)
      */
-    private int level = 0;
+    private int level = 1;
     /**
      * If we are currently declaring function parameters
      */
@@ -131,13 +131,13 @@ public class SourceCodeGenerator implements ASTVisitor {
         node.getDroite().accept(this);
         return null;
     }
-    //
-    // public Object visit(Ecrire node){
-    // code += "ecrire ";
-    // node.getSource().accept(this);
-    // code += ";";
-    // return null;
-    // }
+    
+    public Object visit(Ecrire node){
+    code += "ecrire ";
+    node.getSource().accept(this);
+    code += ";";
+    return null;
+    }
 
     public Object visit(Egal node) {
         node.getGauche().accept(this);

hepial.cup

@@ -24,7 +24,7 @@ non terminal Expression expr, access, operand;
 non terminal for_instr;
 non terminal while_instr;
 non terminal cond_instr;
-non terminal write_instr;
+non terminal Ecrire write_instr;
 non terminal read_instr;
 non terminal Instruction instr;
 non terminal Affectation assign;
@@ -117,7 +117,7 @@ instr_lst         ::= {: RESULT = new ArrayList(); :}
                       :};
 
 instr             ::= assign:inst         {: RESULT = inst; :}
-                      | write_instr  {: :}
+                      | write_instr:e  {: RESULT = e; :}
                       | read_instr   {: :}
                       | cond_instr   {: :}
                       | while_instr  {: :}
@@ -125,8 +125,8 @@ instr             ::= assign:inst         {: RESULT = inst; :}
 
 assign            ::= access:dest EQUAL:e expr:src SEMICOLON {: RESULT = new Affectation(dest, src, "", eleft, eright); :};
 
-write_instr       ::= WRITE expr SEMICOLON {: :}
-                      | WRITE STRINGCONST SEMICOLON   {: :};
+write_instr       ::= WRITE expr:a SEMICOLON {: RESULT = new Ecrire(a, "", aleft, aright); :}
+                      | WRITE STRINGCONST:b SEMICOLON   {:  RESULT = new Ecrire(new Chaine(b, "",bleft, bright), "", bleft, bright); :};
 
 read_instr        ::= READ IDENT SEMICOLON   {: :};