feat: abstract synthax tree contracts definition

AST/ast_interfaces.go

@@ -0,0 +1,33 @@
+package ast
+
+/*
+* Abstract syntax tree is the data structure
+* which our parser will return it's is an hierarchical DS
+* that represents 'the flow of the tokens' with a top down approach
+* It's called abstract because it doesn't include all elements such whitespace break lines ..
+ */
+
+/*
+* The node type which be contained in the tree
+ */
+type Node interface{
+	/* 
+	* The token literal representation in the node
+	* This will be used only for testing and debugging purposes 
+	*/
+	TokenLiteral() string  
+}
+
+/*
+* we wil be define for now 2 types of nodes 
+* Statements nodes: doesn't return any value
+* Expression nodes : does return a value
+*/
+type Statement interface {
+	Node
+	statementNode()
+}
+type Expression interface {
+	Node
+	expressionNode()
+}

lexer/lexer.go

@@ -1,7 +1,6 @@
 package lexer
 
 import (
-	"fmt"
 	"unicode/utf8"
 
 	"github.com/houcine7/JIPL/token"
@@ -32,7 +31,6 @@ func (l *Lexer) NextToken() token.Token {
 	// var tokens []token.Token
 	var test token.Token
 	l.ignoreWhiteSpace()
-	fmt.Println(string(l.char),l.currentPos)
 
 	switch l.char{
 		case '=':
@@ -104,8 +102,6 @@ func (l *Lexer) NextToken() token.Token {
 			}
 	}
 
-	fmt.Print(test)
-
 	l.readChar() // move to next char
 	return test
 }